./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel/ticket-4.wvr.c --full-output -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistentFixedOrder-NoLbe-Lockstep.epf --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 -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistentFixedOrder-NoLbe-Lockstep.epf ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 22:40:02,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-05 22:40:02,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-05 22:40:02,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-05 22:40:02,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-05 22:40:02,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-05 22:40:02,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-05 22:40:02,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-05 22:40:02,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-05 22:40:02,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-05 22:40:02,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-05 22:40:02,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-05 22:40:02,920 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-05 22:40:02,921 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-05 22:40:02,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-05 22:40:02,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-05 22:40:02,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-05 22:40:02,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-05 22:40:02,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-05 22:40:02,932 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-05 22:40:02,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-05 22:40:02,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-05 22:40:02,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-05 22:40:02,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-05 22:40:02,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-05 22:40:02,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-05 22:40:02,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-05 22:40:02,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-05 22:40:02,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-05 22:40:02,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-05 22:40:02,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-05 22:40:02,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-05 22:40:02,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-05 22:40:02,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-05 22:40:02,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-05 22:40:02,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-05 22:40:02,952 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-05 22:40:02,952 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-05 22:40:02,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-05 22:40:02,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-05 22:40:02,955 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-05 22:40:02,957 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 22:40:02,996 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-05 22:40:02,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-05 22:40:02,997 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-05 22:40:02,998 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-05 22:40:02,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-05 22:40:03,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-05 22:40:03,000 INFO L138 SettingsManager]: * Use SBE=true [2021-10-05 22:40:03,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-05 22:40:03,001 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-05 22:40:03,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-05 22:40:03,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-05 22:40:03,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-05 22:40:03,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-05 22:40:03,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-05 22:40:03,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-05 22:40:03,004 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-05 22:40:03,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-05 22:40:03,004 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-05 22:40:03,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-05 22:40:03,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-05 22:40:03,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-05 22:40:03,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-05 22:40:03,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-05 22:40:03,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-05 22:40:03,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-05 22:40:03,007 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-05 22:40:03,007 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-05 22:40:03,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-05 22:40:03,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-05 22:40:03,008 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-05 22:40:03,008 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 22:40:03,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-05 22:40:03,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-05 22:40:03,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-05 22:40:03,499 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-05 22:40:03,500 INFO L275 PluginConnector]: CDTParser initialized [2021-10-05 22:40:03,501 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 22:40:03,587 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c1e6459d3/4efe1e07df604257ab8d53d0d8d82238/FLAGb876b4796 [2021-10-05 22:40:04,305 INFO L306 CDTParser]: Found 1 translation units. [2021-10-05 22:40:04,306 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/ticket-4.wvr.c [2021-10-05 22:40:04,315 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c1e6459d3/4efe1e07df604257ab8d53d0d8d82238/FLAGb876b4796 [2021-10-05 22:40:04,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c1e6459d3/4efe1e07df604257ab8d53d0d8d82238 [2021-10-05 22:40:04,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-05 22:40:04,645 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-05 22:40:04,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-05 22:40:04,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-05 22:40:04,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-05 22:40:04,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:40:04" (1/1) ... [2021-10-05 22:40:04,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@381131f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:04, skipping insertion in model container [2021-10-05 22:40:04,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:40:04" (1/1) ... [2021-10-05 22:40:04,671 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-05 22:40:04,706 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-05 22:40:04,907 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 22:40:04,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-05 22:40:04,923 INFO L203 MainTranslator]: Completed pre-run [2021-10-05 22:40:04,952 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 22:40:04,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-05 22:40:04,972 INFO L208 MainTranslator]: Completed translation [2021-10-05 22:40:04,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:04 WrapperNode [2021-10-05 22:40:04,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-05 22:40:04,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-05 22:40:04,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-05 22:40:04,978 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-05 22:40:04,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:04" (1/1) ... [2021-10-05 22:40:04,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:04" (1/1) ... [2021-10-05 22:40:05,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-05 22:40:05,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-05 22:40:05,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-05 22:40:05,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-05 22:40:05,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:04" (1/1) ... [2021-10-05 22:40:05,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:04" (1/1) ... [2021-10-05 22:40:05,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:04" (1/1) ... [2021-10-05 22:40:05,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:04" (1/1) ... [2021-10-05 22:40:05,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:04" (1/1) ... [2021-10-05 22:40:05,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:04" (1/1) ... [2021-10-05 22:40:05,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:04" (1/1) ... [2021-10-05 22:40:05,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-05 22:40:05,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-05 22:40:05,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-05 22:40:05,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-05 22:40:05,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:04" (1/1) ... [2021-10-05 22:40:05,075 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-05 22:40:05,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 22:40:05,106 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 22:40:05,125 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 22:40:05,174 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-05 22:40:05,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-05 22:40:05,174 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-05 22:40:05,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-05 22:40:05,175 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-05 22:40:05,175 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-05 22:40:05,175 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-10-05 22:40:05,175 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-10-05 22:40:05,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-05 22:40:05,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-05 22:40:05,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-05 22:40:05,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-05 22:40:05,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-05 22:40:05,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-05 22:40:05,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-05 22:40:05,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-05 22:40:05,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-05 22:40:05,179 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 22:40:05,783 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-05 22:40:05,784 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2021-10-05 22:40:05,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:40:05 BoogieIcfgContainer [2021-10-05 22:40:05,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-05 22:40:05,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-05 22:40:05,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-05 22:40:05,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-05 22:40:05,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 10:40:04" (1/3) ... [2021-10-05 22:40:05,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9bd08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:40:05, skipping insertion in model container [2021-10-05 22:40:05,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:04" (2/3) ... [2021-10-05 22:40:05,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9bd08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:40:05, skipping insertion in model container [2021-10-05 22:40:05,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:40:05" (3/3) ... [2021-10-05 22:40:05,811 INFO L111 eAbstractionObserver]: Analyzing ICFG ticket-4.wvr.c [2021-10-05 22:40:05,818 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-05 22:40:05,818 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-05 22:40:05,819 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-05 22:40:05,819 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-05 22:40:05,875 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,876 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,876 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 22:40:05,877 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 22:40:05,877 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,878 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,878 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 22:40:05,878 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,882 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 22:40:05,882 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,883 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,883 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,883 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,884 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,884 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,885 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,885 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,885 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,886 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,886 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,886 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,887 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,887 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,887 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,909 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,909 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,910 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 22:40:05,910 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 22:40:05,910 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,911 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,911 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 22:40:05,911 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,911 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 22:40:05,912 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,912 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,912 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,913 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,913 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,914 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,914 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,914 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,915 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,915 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,915 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,916 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,916 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,916 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,917 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,917 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,918 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,918 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 22:40:05,918 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 22:40:05,919 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,919 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,920 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 22:40:05,920 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,920 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 22:40:05,920 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,921 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,921 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,921 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,922 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,922 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,923 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,923 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,923 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,924 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,924 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,924 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,925 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,925 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,926 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,926 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,927 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,927 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 22:40:05,927 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 22:40:05,928 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,928 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,928 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 22:40:05,928 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,929 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 22:40:05,929 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,930 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,930 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,930 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,931 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,931 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,932 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,932 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,932 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,933 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,933 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,934 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,934 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,934 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,934 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,939 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,939 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,940 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,940 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,940 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 22:40:05,941 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,944 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 22:40:05,945 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,945 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,945 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,946 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,946 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,950 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,951 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,951 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,952 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,952 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,952 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 22:40:05,955 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,955 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,956 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,956 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,956 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 22:40:05,956 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:40:05,978 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-10-05 22:40:06,058 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-05 22:40:06,087 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 22:40:06,089 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-10-05 22:40:06,122 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-05 22:40:06,137 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 159 transitions, 350 flow [2021-10-05 22:40:06,141 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 159 transitions, 350 flow [2021-10-05 22:40:06,144 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 166 places, 159 transitions, 350 flow [2021-10-05 22:40:06,330 INFO L129 PetriNetUnfolder]: 6/155 cut-off events. [2021-10-05 22:40:06,331 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-10-05 22:40:06,340 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 22:40:06,349 INFO L116 LiptonReduction]: Number of co-enabled transitions 3864 [2021-10-05 22:40:12,661 INFO L131 LiptonReduction]: Checked pairs total: 11383 [2021-10-05 22:40:12,662 INFO L133 LiptonReduction]: Total number of compositions: 142 [2021-10-05 22:40:12,671 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 47 transitions, 126 flow [2021-10-05 22:40:12,939 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 22:40:12,963 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 22:40:13,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-05 22:40:13,018 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:13,018 INFO L512 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 22:40:13,019 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 22:40:13,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:13,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1665807441, now seen corresponding path program 1 times [2021-10-05 22:40:13,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:13,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232104430] [2021-10-05 22:40:13,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:13,041 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:13,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 22:40:13,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:13,271 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232104430] [2021-10-05 22:40:13,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232104430] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:13,272 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:13,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-05 22:40:13,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766265198] [2021-10-05 22:40:13,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-05 22:40:13,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:13,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-05 22:40:13,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-05 22:40:13,334 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 22:40:13,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:13,467 INFO L93 Difference]: Finished difference Result 4146 states and 15422 transitions. [2021-10-05 22:40:13,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-05 22:40:13,469 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 22:40:13,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:13,544 INFO L225 Difference]: With dead ends: 4146 [2021-10-05 22:40:13,544 INFO L226 Difference]: Without dead ends: 4146 [2021-10-05 22:40:13,546 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 22:40:13,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4146 states. [2021-10-05 22:40:13,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4146 to 4146. [2021-10-05 22:40:13,898 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 22:40:13,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4146 states to 4146 states and 15422 transitions. [2021-10-05 22:40:13,966 INFO L78 Accepts]: Start accepts. Automaton has 4146 states and 15422 transitions. Word has length 21 [2021-10-05 22:40:13,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:13,968 INFO L470 AbstractCegarLoop]: Abstraction has 4146 states and 15422 transitions. [2021-10-05 22:40:13,969 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 22:40:13,972 INFO L276 IsEmpty]: Start isEmpty. Operand 4146 states and 15422 transitions. [2021-10-05 22:40:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:13,997 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:13,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 22:40:13,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-05 22:40:13,998 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 22:40:13,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:13,999 INFO L82 PathProgramCache]: Analyzing trace with hash 465448181, now seen corresponding path program 1 times [2021-10-05 22:40:14,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:14,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988767519] [2021-10-05 22:40:14,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:14,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:14,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:14,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988767519] [2021-10-05 22:40:14,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988767519] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:14,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:14,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-05 22:40:14,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691788430] [2021-10-05 22:40:14,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-05 22:40:14,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:14,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-05 22:40:14,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-10-05 22:40:14,725 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 22:40:14,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:14,979 INFO L93 Difference]: Finished difference Result 6361 states and 23267 transitions. [2021-10-05 22:40:14,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-05 22:40:14,980 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 22:40:14,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:15,032 INFO L225 Difference]: With dead ends: 6361 [2021-10-05 22:40:15,032 INFO L226 Difference]: Without dead ends: 4368 [2021-10-05 22:40:15,033 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 53.2ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-05 22:40:15,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4368 states. [2021-10-05 22:40:15,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4368 to 4368. [2021-10-05 22:40:15,424 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 22:40:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4368 states to 4368 states and 15813 transitions. [2021-10-05 22:40:15,512 INFO L78 Accepts]: Start accepts. Automaton has 4368 states and 15813 transitions. Word has length 38 [2021-10-05 22:40:15,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:15,513 INFO L470 AbstractCegarLoop]: Abstraction has 4368 states and 15813 transitions. [2021-10-05 22:40:15,514 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 22:40:15,517 INFO L276 IsEmpty]: Start isEmpty. Operand 4368 states and 15813 transitions. [2021-10-05 22:40:15,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:15,542 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:15,542 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:15,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-05 22:40:15,544 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 22:40:15,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:15,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1521095357, now seen corresponding path program 2 times [2021-10-05 22:40:15,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:15,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260847449] [2021-10-05 22:40:15,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:15,555 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:15,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:15,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260847449] [2021-10-05 22:40:15,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260847449] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:15,780 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:15,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-05 22:40:15,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637886128] [2021-10-05 22:40:15,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-05 22:40:15,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:15,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-05 22:40:15,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-05 22:40:15,789 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 22:40:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:15,968 INFO L93 Difference]: Finished difference Result 4808 states and 17465 transitions. [2021-10-05 22:40:15,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-05 22:40:15,968 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 22:40:15,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:16,044 INFO L225 Difference]: With dead ends: 4808 [2021-10-05 22:40:16,044 INFO L226 Difference]: Without dead ends: 4808 [2021-10-05 22:40:16,045 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.2ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-05 22:40:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4808 states. [2021-10-05 22:40:16,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4808 to 4808. [2021-10-05 22:40:16,366 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 22:40:16,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4808 states to 4808 states and 17465 transitions. [2021-10-05 22:40:16,447 INFO L78 Accepts]: Start accepts. Automaton has 4808 states and 17465 transitions. Word has length 38 [2021-10-05 22:40:16,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:16,448 INFO L470 AbstractCegarLoop]: Abstraction has 4808 states and 17465 transitions. [2021-10-05 22:40:16,449 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 22:40:16,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4808 states and 17465 transitions. [2021-10-05 22:40:16,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:16,507 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:16,507 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:16,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-05 22:40:16,507 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 22:40:16,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:16,510 INFO L82 PathProgramCache]: Analyzing trace with hash 661953761, now seen corresponding path program 3 times [2021-10-05 22:40:16,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:16,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117561622] [2021-10-05 22:40:16,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:16,513 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:16,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:16,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117561622] [2021-10-05 22:40:16,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117561622] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:16,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:16,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:16,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267980673] [2021-10-05 22:40:16,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:16,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:16,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:16,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:16,799 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 22:40:17,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:17,548 INFO L93 Difference]: Finished difference Result 7092 states and 24571 transitions. [2021-10-05 22:40:17,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 22:40:17,551 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 22:40:17,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:17,666 INFO L225 Difference]: With dead ends: 7092 [2021-10-05 22:40:17,666 INFO L226 Difference]: Without dead ends: 6226 [2021-10-05 22:40:17,667 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 176.5ms TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:40:17,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6226 states. [2021-10-05 22:40:17,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6226 to 5356. [2021-10-05 22:40:17,895 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 22:40:17,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5356 states to 5356 states and 19209 transitions. [2021-10-05 22:40:17,926 INFO L78 Accepts]: Start accepts. Automaton has 5356 states and 19209 transitions. Word has length 38 [2021-10-05 22:40:17,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:17,927 INFO L470 AbstractCegarLoop]: Abstraction has 5356 states and 19209 transitions. [2021-10-05 22:40:17,927 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 22:40:17,927 INFO L276 IsEmpty]: Start isEmpty. Operand 5356 states and 19209 transitions. [2021-10-05 22:40:17,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:17,950 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:17,950 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:17,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-05 22:40:17,951 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 22:40:17,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:17,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1447149423, now seen corresponding path program 4 times [2021-10-05 22:40:17,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:17,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894251755] [2021-10-05 22:40:17,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:17,953 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:18,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:18,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894251755] [2021-10-05 22:40:18,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894251755] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:18,184 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:18,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:40:18,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690225508] [2021-10-05 22:40:18,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:40:18,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:18,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:40:18,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:40:18,187 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 22:40:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:18,894 INFO L93 Difference]: Finished difference Result 8488 states and 28209 transitions. [2021-10-05 22:40:18,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-05 22:40:18,895 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 22:40:18,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:18,932 INFO L225 Difference]: With dead ends: 8488 [2021-10-05 22:40:18,932 INFO L226 Difference]: Without dead ends: 7124 [2021-10-05 22:40:18,933 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 230.8ms TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:40:18,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7124 states. [2021-10-05 22:40:19,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7124 to 5742. [2021-10-05 22:40:19,258 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 22:40:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5742 states to 5742 states and 20045 transitions. [2021-10-05 22:40:19,294 INFO L78 Accepts]: Start accepts. Automaton has 5742 states and 20045 transitions. Word has length 38 [2021-10-05 22:40:19,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:19,295 INFO L470 AbstractCegarLoop]: Abstraction has 5742 states and 20045 transitions. [2021-10-05 22:40:19,295 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 22:40:19,295 INFO L276 IsEmpty]: Start isEmpty. Operand 5742 states and 20045 transitions. [2021-10-05 22:40:19,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:19,319 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:19,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 22:40:19,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-05 22:40:19,320 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 22:40:19,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:19,320 INFO L82 PathProgramCache]: Analyzing trace with hash -219164853, now seen corresponding path program 5 times [2021-10-05 22:40:19,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:19,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849743393] [2021-10-05 22:40:19,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:19,322 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:19,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:19,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849743393] [2021-10-05 22:40:19,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849743393] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:19,499 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:19,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:40:19,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470644866] [2021-10-05 22:40:19,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:40:19,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:19,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:40:19,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:40:19,502 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 22:40:19,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:19,982 INFO L93 Difference]: Finished difference Result 6252 states and 20379 transitions. [2021-10-05 22:40:19,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:40:19,983 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 22:40:19,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:20,013 INFO L225 Difference]: With dead ends: 6252 [2021-10-05 22:40:20,014 INFO L226 Difference]: Without dead ends: 5344 [2021-10-05 22:40:20,015 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 150.7ms TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:40:20,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2021-10-05 22:40:20,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 4588. [2021-10-05 22:40:20,209 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 22:40:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4588 states to 4588 states and 15169 transitions. [2021-10-05 22:40:20,343 INFO L78 Accepts]: Start accepts. Automaton has 4588 states and 15169 transitions. Word has length 38 [2021-10-05 22:40:20,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:20,343 INFO L470 AbstractCegarLoop]: Abstraction has 4588 states and 15169 transitions. [2021-10-05 22:40:20,343 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 22:40:20,343 INFO L276 IsEmpty]: Start isEmpty. Operand 4588 states and 15169 transitions. [2021-10-05 22:40:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:20,371 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:20,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 22:40:20,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-05 22:40:20,372 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 22:40:20,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:20,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1983960991, now seen corresponding path program 6 times [2021-10-05 22:40:20,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:20,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776298890] [2021-10-05 22:40:20,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:20,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:20,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:20,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776298890] [2021-10-05 22:40:20,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776298890] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:20,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:20,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:20,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745178807] [2021-10-05 22:40:20,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:20,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:20,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:20,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:20,601 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 22:40:20,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:20,998 INFO L93 Difference]: Finished difference Result 4744 states and 15525 transitions. [2021-10-05 22:40:20,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:40:20,998 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 22:40:20,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:21,021 INFO L225 Difference]: With dead ends: 4744 [2021-10-05 22:40:21,021 INFO L226 Difference]: Without dead ends: 4676 [2021-10-05 22:40:21,022 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 157.4ms TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:40:21,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4676 states. [2021-10-05 22:40:21,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4676 to 4594. [2021-10-05 22:40:21,176 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 22:40:21,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4594 states to 4594 states and 15181 transitions. [2021-10-05 22:40:21,202 INFO L78 Accepts]: Start accepts. Automaton has 4594 states and 15181 transitions. Word has length 38 [2021-10-05 22:40:21,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:21,202 INFO L470 AbstractCegarLoop]: Abstraction has 4594 states and 15181 transitions. [2021-10-05 22:40:21,203 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 22:40:21,203 INFO L276 IsEmpty]: Start isEmpty. Operand 4594 states and 15181 transitions. [2021-10-05 22:40:21,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:21,223 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:21,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 22:40:21,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-05 22:40:21,224 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 22:40:21,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:21,224 INFO L82 PathProgramCache]: Analyzing trace with hash 201903121, now seen corresponding path program 7 times [2021-10-05 22:40:21,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:21,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960689801] [2021-10-05 22:40:21,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:21,226 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:21,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 22:40:21,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:21,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960689801] [2021-10-05 22:40:21,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960689801] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:21,380 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:21,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:40:21,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847610591] [2021-10-05 22:40:21,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:40:21,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:21,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:40:21,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:40:21,382 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 22:40:21,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:21,795 INFO L93 Difference]: Finished difference Result 4764 states and 15581 transitions. [2021-10-05 22:40:21,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:40:21,797 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 22:40:21,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:21,818 INFO L225 Difference]: With dead ends: 4764 [2021-10-05 22:40:21,819 INFO L226 Difference]: Without dead ends: 4646 [2021-10-05 22:40:21,819 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 199.7ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-10-05 22:40:21,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2021-10-05 22:40:21,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 4598. [2021-10-05 22:40:21,962 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 22:40:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4598 states to 4598 states and 15185 transitions. [2021-10-05 22:40:21,988 INFO L78 Accepts]: Start accepts. Automaton has 4598 states and 15185 transitions. Word has length 38 [2021-10-05 22:40:21,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:21,990 INFO L470 AbstractCegarLoop]: Abstraction has 4598 states and 15185 transitions. [2021-10-05 22:40:21,990 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 22:40:21,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4598 states and 15185 transitions. [2021-10-05 22:40:22,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:22,008 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:22,008 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:22,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-05 22:40:22,009 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 22:40:22,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:22,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1664575563, now seen corresponding path program 8 times [2021-10-05 22:40:22,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:22,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027180167] [2021-10-05 22:40:22,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:22,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:22,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:22,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027180167] [2021-10-05 22:40:22,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027180167] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:22,150 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:22,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:40:22,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452530981] [2021-10-05 22:40:22,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:40:22,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:22,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:40:22,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:40:22,153 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 22:40:22,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:22,458 INFO L93 Difference]: Finished difference Result 4792 states and 15639 transitions. [2021-10-05 22:40:22,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:40:22,459 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 22:40:22,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:22,480 INFO L225 Difference]: With dead ends: 4792 [2021-10-05 22:40:22,480 INFO L226 Difference]: Without dead ends: 4680 [2021-10-05 22:40:22,481 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 105.4ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-10-05 22:40:22,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2021-10-05 22:40:22,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4590. [2021-10-05 22:40:22,682 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 22:40:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4590 states to 4590 states and 15168 transitions. [2021-10-05 22:40:22,706 INFO L78 Accepts]: Start accepts. Automaton has 4590 states and 15168 transitions. Word has length 38 [2021-10-05 22:40:22,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:22,706 INFO L470 AbstractCegarLoop]: Abstraction has 4590 states and 15168 transitions. [2021-10-05 22:40:22,707 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 22:40:22,707 INFO L276 IsEmpty]: Start isEmpty. Operand 4590 states and 15168 transitions. [2021-10-05 22:40:22,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:22,723 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:22,724 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:22,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-05 22:40:22,724 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 22:40:22,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:22,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1667946649, now seen corresponding path program 9 times [2021-10-05 22:40:22,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:22,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054858980] [2021-10-05 22:40:22,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:22,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:22,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:22,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054858980] [2021-10-05 22:40:22,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054858980] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:22,875 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:22,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:22,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887351460] [2021-10-05 22:40:22,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:22,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:22,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:22,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:22,877 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 22:40:23,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:23,182 INFO L93 Difference]: Finished difference Result 4734 states and 15491 transitions. [2021-10-05 22:40:23,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:40:23,183 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 22:40:23,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:23,203 INFO L225 Difference]: With dead ends: 4734 [2021-10-05 22:40:23,204 INFO L226 Difference]: Without dead ends: 4666 [2021-10-05 22:40:23,204 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 123.8ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-10-05 22:40:23,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4666 states. [2021-10-05 22:40:23,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4666 to 4596. [2021-10-05 22:40:23,345 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 22:40:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4596 states to 4596 states and 15177 transitions. [2021-10-05 22:40:23,368 INFO L78 Accepts]: Start accepts. Automaton has 4596 states and 15177 transitions. Word has length 38 [2021-10-05 22:40:23,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:23,369 INFO L470 AbstractCegarLoop]: Abstraction has 4596 states and 15177 transitions. [2021-10-05 22:40:23,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 22:40:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 4596 states and 15177 transitions. [2021-10-05 22:40:23,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:23,386 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:23,387 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:23,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-05 22:40:23,387 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 22:40:23,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:23,388 INFO L82 PathProgramCache]: Analyzing trace with hash -441156535, now seen corresponding path program 10 times [2021-10-05 22:40:23,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:23,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696290260] [2021-10-05 22:40:23,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:23,389 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:23,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:23,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:23,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696290260] [2021-10-05 22:40:23,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696290260] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:23,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:23,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:40:23,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764469028] [2021-10-05 22:40:23,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:40:23,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:23,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:40:23,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:40:23,535 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 22:40:23,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:23,819 INFO L93 Difference]: Finished difference Result 4800 states and 15646 transitions. [2021-10-05 22:40:23,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 22:40:23,820 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 22:40:23,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:23,837 INFO L225 Difference]: With dead ends: 4800 [2021-10-05 22:40:23,838 INFO L226 Difference]: Without dead ends: 4664 [2021-10-05 22:40:23,838 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 84.6ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-10-05 22:40:23,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4664 states. [2021-10-05 22:40:23,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4664 to 4608. [2021-10-05 22:40:24,004 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 22:40:24,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4608 states to 4608 states and 15189 transitions. [2021-10-05 22:40:24,033 INFO L78 Accepts]: Start accepts. Automaton has 4608 states and 15189 transitions. Word has length 38 [2021-10-05 22:40:24,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:24,034 INFO L470 AbstractCegarLoop]: Abstraction has 4608 states and 15189 transitions. [2021-10-05 22:40:24,035 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 22:40:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 4608 states and 15189 transitions. [2021-10-05 22:40:24,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:24,054 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:24,054 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:24,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-05 22:40:24,054 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 22:40:24,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:24,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1191537169, now seen corresponding path program 11 times [2021-10-05 22:40:24,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:24,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806216175] [2021-10-05 22:40:24,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:24,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:24,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 22:40:24,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:24,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806216175] [2021-10-05 22:40:24,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806216175] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:24,213 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:24,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:40:24,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542508712] [2021-10-05 22:40:24,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:40:24,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:24,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:40:24,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:40:24,216 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 22:40:24,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:24,531 INFO L93 Difference]: Finished difference Result 4818 states and 15675 transitions. [2021-10-05 22:40:24,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 22:40:24,532 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 22:40:24,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:24,552 INFO L225 Difference]: With dead ends: 4818 [2021-10-05 22:40:24,553 INFO L226 Difference]: Without dead ends: 4682 [2021-10-05 22:40:24,553 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 86.3ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-10-05 22:40:24,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2021-10-05 22:40:24,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 4584. [2021-10-05 22:40:24,719 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 22:40:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4584 states to 4584 states and 15129 transitions. [2021-10-05 22:40:24,744 INFO L78 Accepts]: Start accepts. Automaton has 4584 states and 15129 transitions. Word has length 38 [2021-10-05 22:40:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:24,745 INFO L470 AbstractCegarLoop]: Abstraction has 4584 states and 15129 transitions. [2021-10-05 22:40:24,745 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 22:40:24,745 INFO L276 IsEmpty]: Start isEmpty. Operand 4584 states and 15129 transitions. [2021-10-05 22:40:24,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:24,764 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:24,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 22:40:24,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-05 22:40:24,765 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 22:40:24,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:24,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1194600461, now seen corresponding path program 12 times [2021-10-05 22:40:24,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:24,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084571495] [2021-10-05 22:40:24,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:24,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:24,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:24,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:24,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084571495] [2021-10-05 22:40:24,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084571495] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:24,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:24,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:24,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488242880] [2021-10-05 22:40:24,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:24,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:24,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:24,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:24,931 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 22:40:25,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:25,504 INFO L93 Difference]: Finished difference Result 6372 states and 20060 transitions. [2021-10-05 22:40:25,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 22:40:25,504 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 22:40:25,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:25,527 INFO L225 Difference]: With dead ends: 6372 [2021-10-05 22:40:25,527 INFO L226 Difference]: Without dead ends: 6050 [2021-10-05 22:40:25,528 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 204.5ms TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:40:25,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2021-10-05 22:40:25,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 4716. [2021-10-05 22:40:25,780 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 22:40:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4716 states to 4716 states and 15439 transitions. [2021-10-05 22:40:25,805 INFO L78 Accepts]: Start accepts. Automaton has 4716 states and 15439 transitions. Word has length 38 [2021-10-05 22:40:25,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:25,805 INFO L470 AbstractCegarLoop]: Abstraction has 4716 states and 15439 transitions. [2021-10-05 22:40:25,806 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 22:40:25,806 INFO L276 IsEmpty]: Start isEmpty. Operand 4716 states and 15439 transitions. [2021-10-05 22:40:25,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:25,822 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:25,822 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:25,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-05 22:40:25,822 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 22:40:25,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:25,823 INFO L82 PathProgramCache]: Analyzing trace with hash 991263651, now seen corresponding path program 13 times [2021-10-05 22:40:25,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:25,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043872975] [2021-10-05 22:40:25,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:25,824 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:25,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 22:40:25,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:25,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043872975] [2021-10-05 22:40:25,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043872975] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:25,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:25,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 22:40:25,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937341638] [2021-10-05 22:40:25,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 22:40:25,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:25,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 22:40:25,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-05 22:40:25,928 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 22:40:26,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:26,429 INFO L93 Difference]: Finished difference Result 6538 states and 20777 transitions. [2021-10-05 22:40:26,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 22:40:26,430 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 22:40:26,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:26,458 INFO L225 Difference]: With dead ends: 6538 [2021-10-05 22:40:26,458 INFO L226 Difference]: Without dead ends: 6402 [2021-10-05 22:40:26,459 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 128.7ms TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:40:26,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6402 states. [2021-10-05 22:40:26,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6402 to 4692. [2021-10-05 22:40:26,642 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 22:40:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4692 states to 4692 states and 15375 transitions. [2021-10-05 22:40:26,667 INFO L78 Accepts]: Start accepts. Automaton has 4692 states and 15375 transitions. Word has length 38 [2021-10-05 22:40:26,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:26,668 INFO L470 AbstractCegarLoop]: Abstraction has 4692 states and 15375 transitions. [2021-10-05 22:40:26,668 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 22:40:26,668 INFO L276 IsEmpty]: Start isEmpty. Operand 4692 states and 15375 transitions. [2021-10-05 22:40:26,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:26,683 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:26,683 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:26,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-05 22:40:26,684 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 22:40:26,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:26,685 INFO L82 PathProgramCache]: Analyzing trace with hash 454452083, now seen corresponding path program 14 times [2021-10-05 22:40:26,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:26,685 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35402197] [2021-10-05 22:40:26,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:26,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:26,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:26,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:26,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35402197] [2021-10-05 22:40:26,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35402197] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:26,838 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:26,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:26,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261246238] [2021-10-05 22:40:26,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:26,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:26,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:26,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:26,841 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 22:40:27,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:27,416 INFO L93 Difference]: Finished difference Result 5860 states and 19109 transitions. [2021-10-05 22:40:27,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 22:40:27,417 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 22:40:27,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:27,440 INFO L225 Difference]: With dead ends: 5860 [2021-10-05 22:40:27,440 INFO L226 Difference]: Without dead ends: 5792 [2021-10-05 22:40:27,441 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 209.7ms TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:40:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5792 states. [2021-10-05 22:40:27,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5792 to 4688. [2021-10-05 22:40:27,602 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 22:40:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4688 states to 4688 states and 15366 transitions. [2021-10-05 22:40:27,625 INFO L78 Accepts]: Start accepts. Automaton has 4688 states and 15366 transitions. Word has length 38 [2021-10-05 22:40:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:27,625 INFO L470 AbstractCegarLoop]: Abstraction has 4688 states and 15366 transitions. [2021-10-05 22:40:27,626 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 22:40:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 4688 states and 15366 transitions. [2021-10-05 22:40:27,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:27,640 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:27,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 22:40:27,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-05 22:40:27,641 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 22:40:27,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:27,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1654651101, now seen corresponding path program 15 times [2021-10-05 22:40:27,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:27,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405276605] [2021-10-05 22:40:27,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:27,643 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:27,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 22:40:27,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:27,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405276605] [2021-10-05 22:40:27,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405276605] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:27,781 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:27,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:40:27,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556867493] [2021-10-05 22:40:27,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:40:27,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:27,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:40:27,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:40:27,785 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 22:40:28,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:28,473 INFO L93 Difference]: Finished difference Result 6104 states and 19560 transitions. [2021-10-05 22:40:28,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-05 22:40:28,474 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 22:40:28,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:28,498 INFO L225 Difference]: With dead ends: 6104 [2021-10-05 22:40:28,498 INFO L226 Difference]: Without dead ends: 5908 [2021-10-05 22:40:28,499 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 249.3ms TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2021-10-05 22:40:28,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5908 states. [2021-10-05 22:40:28,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5908 to 4844. [2021-10-05 22:40:28,677 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 22:40:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4844 states to 4844 states and 15892 transitions. [2021-10-05 22:40:28,704 INFO L78 Accepts]: Start accepts. Automaton has 4844 states and 15892 transitions. Word has length 38 [2021-10-05 22:40:28,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:28,704 INFO L470 AbstractCegarLoop]: Abstraction has 4844 states and 15892 transitions. [2021-10-05 22:40:28,704 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 22:40:28,704 INFO L276 IsEmpty]: Start isEmpty. Operand 4844 states and 15892 transitions. [2021-10-05 22:40:28,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:28,720 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:28,720 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:28,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-05 22:40:28,721 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 22:40:28,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:28,721 INFO L82 PathProgramCache]: Analyzing trace with hash -191978659, now seen corresponding path program 16 times [2021-10-05 22:40:28,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:28,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804192708] [2021-10-05 22:40:28,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:28,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:28,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:28,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:28,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804192708] [2021-10-05 22:40:28,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804192708] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:28,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:28,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:40:28,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342088502] [2021-10-05 22:40:28,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:40:28,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:28,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:40:28,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:40:28,866 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 22:40:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:29,529 INFO L93 Difference]: Finished difference Result 6168 states and 19764 transitions. [2021-10-05 22:40:29,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-05 22:40:29,532 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 22:40:29,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:29,549 INFO L225 Difference]: With dead ends: 6168 [2021-10-05 22:40:29,549 INFO L226 Difference]: Without dead ends: 5974 [2021-10-05 22:40:29,551 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 233.8ms TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2021-10-05 22:40:29,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2021-10-05 22:40:29,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 5060. [2021-10-05 22:40:29,735 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 22:40:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5060 states to 5060 states and 16624 transitions. [2021-10-05 22:40:29,765 INFO L78 Accepts]: Start accepts. Automaton has 5060 states and 16624 transitions. Word has length 38 [2021-10-05 22:40:29,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:29,766 INFO L470 AbstractCegarLoop]: Abstraction has 5060 states and 16624 transitions. [2021-10-05 22:40:29,766 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 22:40:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 5060 states and 16624 transitions. [2021-10-05 22:40:29,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:29,785 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:29,785 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:29,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-05 22:40:29,786 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 22:40:29,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:29,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1700623171, now seen corresponding path program 17 times [2021-10-05 22:40:29,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:29,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979949841] [2021-10-05 22:40:29,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:29,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:29,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:29,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979949841] [2021-10-05 22:40:29,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979949841] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:29,968 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:29,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:29,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455898675] [2021-10-05 22:40:29,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:29,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:29,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:29,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:29,971 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 22:40:30,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:30,610 INFO L93 Difference]: Finished difference Result 6160 states and 19568 transitions. [2021-10-05 22:40:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 22:40:30,611 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 22:40:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:30,633 INFO L225 Difference]: With dead ends: 6160 [2021-10-05 22:40:30,634 INFO L226 Difference]: Without dead ends: 6076 [2021-10-05 22:40:30,634 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 204.9ms TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:40:30,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2021-10-05 22:40:30,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 4978. [2021-10-05 22:40:30,804 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 22:40:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4978 states to 4978 states and 16367 transitions. [2021-10-05 22:40:30,830 INFO L78 Accepts]: Start accepts. Automaton has 4978 states and 16367 transitions. Word has length 38 [2021-10-05 22:40:30,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:30,831 INFO L470 AbstractCegarLoop]: Abstraction has 4978 states and 16367 transitions. [2021-10-05 22:40:30,831 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 22:40:30,831 INFO L276 IsEmpty]: Start isEmpty. Operand 4978 states and 16367 transitions. [2021-10-05 22:40:30,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:30,847 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:30,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 22:40:30,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-05 22:40:30,848 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 22:40:30,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:30,849 INFO L82 PathProgramCache]: Analyzing trace with hash 485240941, now seen corresponding path program 18 times [2021-10-05 22:40:30,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:30,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859635663] [2021-10-05 22:40:30,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:30,850 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:30,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:30,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859635663] [2021-10-05 22:40:30,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859635663] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:30,948 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:30,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 22:40:30,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734304666] [2021-10-05 22:40:30,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 22:40:30,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:30,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 22:40:30,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-05 22:40:30,951 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 22:40:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:31,345 INFO L93 Difference]: Finished difference Result 6098 states and 19340 transitions. [2021-10-05 22:40:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:40:31,346 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 22:40:31,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:31,369 INFO L225 Difference]: With dead ends: 6098 [2021-10-05 22:40:31,369 INFO L226 Difference]: Without dead ends: 5962 [2021-10-05 22:40:31,370 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 92.7ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-10-05 22:40:31,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2021-10-05 22:40:31,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 4910. [2021-10-05 22:40:31,529 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 22:40:31,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4910 states to 4910 states and 16157 transitions. [2021-10-05 22:40:31,555 INFO L78 Accepts]: Start accepts. Automaton has 4910 states and 16157 transitions. Word has length 38 [2021-10-05 22:40:31,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:31,556 INFO L470 AbstractCegarLoop]: Abstraction has 4910 states and 16157 transitions. [2021-10-05 22:40:31,556 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 22:40:31,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4910 states and 16157 transitions. [2021-10-05 22:40:31,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:31,572 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:31,572 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:31,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-05 22:40:31,573 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 22:40:31,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:31,574 INFO L82 PathProgramCache]: Analyzing trace with hash -188066323, now seen corresponding path program 19 times [2021-10-05 22:40:31,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:31,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950253721] [2021-10-05 22:40:31,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:31,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:31,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:31,665 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950253721] [2021-10-05 22:40:31,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950253721] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:31,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:31,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 22:40:31,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179814686] [2021-10-05 22:40:31,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 22:40:31,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:31,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 22:40:31,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-05 22:40:31,668 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 22:40:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:31,981 INFO L93 Difference]: Finished difference Result 4536 states and 13579 transitions. [2021-10-05 22:40:31,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 22:40:31,982 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 22:40:31,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:31,999 INFO L225 Difference]: With dead ends: 4536 [2021-10-05 22:40:31,999 INFO L226 Difference]: Without dead ends: 4536 [2021-10-05 22:40:32,000 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 58.4ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:40:32,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2021-10-05 22:40:32,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 3706. [2021-10-05 22:40:32,120 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 22:40:32,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 11323 transitions. [2021-10-05 22:40:32,140 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 11323 transitions. Word has length 38 [2021-10-05 22:40:32,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:32,140 INFO L470 AbstractCegarLoop]: Abstraction has 3706 states and 11323 transitions. [2021-10-05 22:40:32,141 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 22:40:32,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 11323 transitions. [2021-10-05 22:40:32,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:32,153 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:32,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 22:40:32,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-05 22:40:32,154 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 22:40:32,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:32,155 INFO L82 PathProgramCache]: Analyzing trace with hash -321727587, now seen corresponding path program 20 times [2021-10-05 22:40:32,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:32,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079099518] [2021-10-05 22:40:32,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:32,156 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:32,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:32,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:32,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079099518] [2021-10-05 22:40:32,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079099518] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:32,295 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:32,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:40:32,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419680418] [2021-10-05 22:40:32,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:40:32,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:32,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:40:32,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:40:32,297 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 22:40:33,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:33,172 INFO L93 Difference]: Finished difference Result 5154 states and 15119 transitions. [2021-10-05 22:40:33,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-05 22:40:33,173 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 22:40:33,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:33,190 INFO L225 Difference]: With dead ends: 5154 [2021-10-05 22:40:33,190 INFO L226 Difference]: Without dead ends: 5014 [2021-10-05 22:40:33,191 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 302.8ms TimeCoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2021-10-05 22:40:33,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5014 states. [2021-10-05 22:40:33,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5014 to 3836. [2021-10-05 22:40:33,317 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 22:40:33,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 11660 transitions. [2021-10-05 22:40:33,337 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 11660 transitions. Word has length 38 [2021-10-05 22:40:33,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:33,339 INFO L470 AbstractCegarLoop]: Abstraction has 3836 states and 11660 transitions. [2021-10-05 22:40:33,339 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 22:40:33,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 11660 transitions. [2021-10-05 22:40:33,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:33,351 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:33,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 22:40:33,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-05 22:40:33,352 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 22:40:33,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:33,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1170595613, now seen corresponding path program 21 times [2021-10-05 22:40:33,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:33,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899736183] [2021-10-05 22:40:33,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:33,354 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:33,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:33,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899736183] [2021-10-05 22:40:33,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899736183] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:33,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:33,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:40:33,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073504735] [2021-10-05 22:40:33,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:40:33,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:33,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:40:33,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:40:33,520 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 22:40:34,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:34,902 INFO L93 Difference]: Finished difference Result 6370 states and 18514 transitions. [2021-10-05 22:40:34,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-10-05 22:40:34,903 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 22:40:34,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:34,920 INFO L225 Difference]: With dead ends: 6370 [2021-10-05 22:40:34,921 INFO L226 Difference]: Without dead ends: 5994 [2021-10-05 22:40:34,922 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 591.1ms TimeCoverageRelationStatistics Valid=430, Invalid=1732, Unknown=0, NotChecked=0, Total=2162 [2021-10-05 22:40:34,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2021-10-05 22:40:35,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 4074. [2021-10-05 22:40:35,032 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 22:40:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4074 states to 4074 states and 12323 transitions. [2021-10-05 22:40:35,048 INFO L78 Accepts]: Start accepts. Automaton has 4074 states and 12323 transitions. Word has length 38 [2021-10-05 22:40:35,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:35,049 INFO L470 AbstractCegarLoop]: Abstraction has 4074 states and 12323 transitions. [2021-10-05 22:40:35,049 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 22:40:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand 4074 states and 12323 transitions. [2021-10-05 22:40:35,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:35,062 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:35,062 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:35,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-05 22:40:35,063 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 22:40:35,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:35,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1999490939, now seen corresponding path program 22 times [2021-10-05 22:40:35,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:35,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283401504] [2021-10-05 22:40:35,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:35,064 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:35,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:35,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:35,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283401504] [2021-10-05 22:40:35,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283401504] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:35,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:35,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:35,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700223209] [2021-10-05 22:40:35,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:35,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:35,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:35,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:35,196 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 22:40:35,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:35,822 INFO L93 Difference]: Finished difference Result 5010 states and 14652 transitions. [2021-10-05 22:40:35,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-05 22:40:35,823 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 22:40:35,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:35,840 INFO L225 Difference]: With dead ends: 5010 [2021-10-05 22:40:35,841 INFO L226 Difference]: Without dead ends: 4992 [2021-10-05 22:40:35,841 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 218.1ms TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2021-10-05 22:40:35,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4992 states. [2021-10-05 22:40:35,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4992 to 4292. [2021-10-05 22:40:35,951 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 22:40:35,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4292 states to 4292 states and 12897 transitions. [2021-10-05 22:40:35,969 INFO L78 Accepts]: Start accepts. Automaton has 4292 states and 12897 transitions. Word has length 38 [2021-10-05 22:40:35,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:35,969 INFO L470 AbstractCegarLoop]: Abstraction has 4292 states and 12897 transitions. [2021-10-05 22:40:35,969 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 22:40:35,969 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 12897 transitions. [2021-10-05 22:40:35,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:35,980 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:35,980 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:35,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-05 22:40:35,980 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 22:40:35,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:35,981 INFO L82 PathProgramCache]: Analyzing trace with hash 117067827, now seen corresponding path program 23 times [2021-10-05 22:40:35,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:35,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368607690] [2021-10-05 22:40:35,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:35,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:36,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:36,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:36,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368607690] [2021-10-05 22:40:36,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368607690] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:36,077 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:36,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:40:36,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941422378] [2021-10-05 22:40:36,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:40:36,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:36,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:40:36,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:40:36,078 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 22:40:36,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:36,628 INFO L93 Difference]: Finished difference Result 5830 states and 16904 transitions. [2021-10-05 22:40:36,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-05 22:40:36,629 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 22:40:36,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:36,641 INFO L225 Difference]: With dead ends: 5830 [2021-10-05 22:40:36,641 INFO L226 Difference]: Without dead ends: 5822 [2021-10-05 22:40:36,642 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 174.2ms TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2021-10-05 22:40:36,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5822 states. [2021-10-05 22:40:36,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5822 to 4350. [2021-10-05 22:40:36,736 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 22:40:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4350 states to 4350 states and 13063 transitions. [2021-10-05 22:40:36,751 INFO L78 Accepts]: Start accepts. Automaton has 4350 states and 13063 transitions. Word has length 38 [2021-10-05 22:40:36,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:36,752 INFO L470 AbstractCegarLoop]: Abstraction has 4350 states and 13063 transitions. [2021-10-05 22:40:36,752 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 22:40:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 4350 states and 13063 transitions. [2021-10-05 22:40:36,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:36,760 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:36,761 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:36,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-05 22:40:36,761 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 22:40:36,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:36,762 INFO L82 PathProgramCache]: Analyzing trace with hash 838238755, now seen corresponding path program 24 times [2021-10-05 22:40:36,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:36,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466963324] [2021-10-05 22:40:36,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:36,762 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:36,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:36,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466963324] [2021-10-05 22:40:36,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466963324] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:36,862 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:36,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:36,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962005685] [2021-10-05 22:40:36,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:36,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:36,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:36,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:36,864 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 22:40:37,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:37,611 INFO L93 Difference]: Finished difference Result 5594 states and 16031 transitions. [2021-10-05 22:40:37,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-10-05 22:40:37,612 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 22:40:37,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:37,624 INFO L225 Difference]: With dead ends: 5594 [2021-10-05 22:40:37,624 INFO L226 Difference]: Without dead ends: 5562 [2021-10-05 22:40:37,625 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 261.2ms TimeCoverageRelationStatistics Valid=224, Invalid=706, Unknown=0, NotChecked=0, Total=930 [2021-10-05 22:40:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states. [2021-10-05 22:40:37,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 4310. [2021-10-05 22:40:37,712 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 22:40:37,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4310 states to 4310 states and 12957 transitions. [2021-10-05 22:40:37,723 INFO L78 Accepts]: Start accepts. Automaton has 4310 states and 12957 transitions. Word has length 38 [2021-10-05 22:40:37,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:37,723 INFO L470 AbstractCegarLoop]: Abstraction has 4310 states and 12957 transitions. [2021-10-05 22:40:37,723 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 22:40:37,723 INFO L276 IsEmpty]: Start isEmpty. Operand 4310 states and 12957 transitions. [2021-10-05 22:40:37,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:37,731 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:37,732 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:37,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-05 22:40:37,732 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 22:40:37,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:37,733 INFO L82 PathProgramCache]: Analyzing trace with hash -428037203, now seen corresponding path program 25 times [2021-10-05 22:40:37,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:37,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890813466] [2021-10-05 22:40:37,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:37,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:37,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:37,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:37,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890813466] [2021-10-05 22:40:37,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890813466] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:37,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:37,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:40:37,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792996692] [2021-10-05 22:40:37,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:40:37,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:37,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:40:37,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:40:37,830 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 22:40:38,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:38,428 INFO L93 Difference]: Finished difference Result 5708 states and 16342 transitions. [2021-10-05 22:40:38,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-05 22:40:38,429 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 22:40:38,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:38,442 INFO L225 Difference]: With dead ends: 5708 [2021-10-05 22:40:38,442 INFO L226 Difference]: Without dead ends: 5692 [2021-10-05 22:40:38,443 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 188.2ms TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2021-10-05 22:40:38,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5692 states. [2021-10-05 22:40:38,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5692 to 4314. [2021-10-05 22:40:38,534 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 22:40:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4314 states to 4314 states and 12930 transitions. [2021-10-05 22:40:38,550 INFO L78 Accepts]: Start accepts. Automaton has 4314 states and 12930 transitions. Word has length 38 [2021-10-05 22:40:38,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:38,550 INFO L470 AbstractCegarLoop]: Abstraction has 4314 states and 12930 transitions. [2021-10-05 22:40:38,550 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 22:40:38,550 INFO L276 IsEmpty]: Start isEmpty. Operand 4314 states and 12930 transitions. [2021-10-05 22:40:38,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:38,558 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:38,558 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:38,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-05 22:40:38,559 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 22:40:38,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:38,559 INFO L82 PathProgramCache]: Analyzing trace with hash 293133725, now seen corresponding path program 26 times [2021-10-05 22:40:38,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:38,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336387726] [2021-10-05 22:40:38,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:38,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:38,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:38,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:38,660 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336387726] [2021-10-05 22:40:38,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336387726] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:38,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:38,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:38,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235964146] [2021-10-05 22:40:38,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:38,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:38,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:38,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:38,662 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 22:40:39,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:39,436 INFO L93 Difference]: Finished difference Result 5710 states and 16309 transitions. [2021-10-05 22:40:39,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 22:40:39,437 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 22:40:39,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:39,448 INFO L225 Difference]: With dead ends: 5710 [2021-10-05 22:40:39,448 INFO L226 Difference]: Without dead ends: 5670 [2021-10-05 22:40:39,449 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 273.1ms TimeCoverageRelationStatistics Valid=246, Invalid=746, Unknown=0, NotChecked=0, Total=992 [2021-10-05 22:40:39,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5670 states. [2021-10-05 22:40:39,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5670 to 4270. [2021-10-05 22:40:39,527 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 22:40:39,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4270 states to 4270 states and 12803 transitions. [2021-10-05 22:40:39,538 INFO L78 Accepts]: Start accepts. Automaton has 4270 states and 12803 transitions. Word has length 38 [2021-10-05 22:40:39,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:39,539 INFO L470 AbstractCegarLoop]: Abstraction has 4270 states and 12803 transitions. [2021-10-05 22:40:39,539 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 22:40:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 4270 states and 12803 transitions. [2021-10-05 22:40:39,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:39,548 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:39,548 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:39,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-05 22:40:39,549 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 22:40:39,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:39,549 INFO L82 PathProgramCache]: Analyzing trace with hash 930379165, now seen corresponding path program 27 times [2021-10-05 22:40:39,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:39,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442142733] [2021-10-05 22:40:39,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:39,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:39,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 22:40:39,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:39,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442142733] [2021-10-05 22:40:39,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442142733] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:39,649 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:39,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:40:39,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567085493] [2021-10-05 22:40:39,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:40:39,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:39,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:40:39,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:40:39,650 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 22:40:40,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:40,246 INFO L93 Difference]: Finished difference Result 5976 states and 17159 transitions. [2021-10-05 22:40:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-05 22:40:40,247 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 22:40:40,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:40,258 INFO L225 Difference]: With dead ends: 5976 [2021-10-05 22:40:40,259 INFO L226 Difference]: Without dead ends: 5828 [2021-10-05 22:40:40,259 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 180.0ms TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2021-10-05 22:40:40,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5828 states. [2021-10-05 22:40:40,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5828 to 4286. [2021-10-05 22:40:40,338 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 22:40:40,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 12843 transitions. [2021-10-05 22:40:40,349 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 12843 transitions. Word has length 38 [2021-10-05 22:40:40,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:40,349 INFO L470 AbstractCegarLoop]: Abstraction has 4286 states and 12843 transitions. [2021-10-05 22:40:40,349 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 22:40:40,349 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 12843 transitions. [2021-10-05 22:40:40,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:40,356 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:40,356 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:40,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-05 22:40:40,359 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 22:40:40,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:40,360 INFO L82 PathProgramCache]: Analyzing trace with hash 47097069, now seen corresponding path program 28 times [2021-10-05 22:40:40,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:40,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743994162] [2021-10-05 22:40:40,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:40,360 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:40,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:40,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743994162] [2021-10-05 22:40:40,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743994162] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:40,490 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:40,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:40:40,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333448172] [2021-10-05 22:40:40,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:40:40,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:40,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:40:40,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:40:40,491 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 22:40:41,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:41,633 INFO L93 Difference]: Finished difference Result 5698 states and 16136 transitions. [2021-10-05 22:40:41,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-10-05 22:40:41,634 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 22:40:41,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:41,644 INFO L225 Difference]: With dead ends: 5698 [2021-10-05 22:40:41,645 INFO L226 Difference]: Without dead ends: 5510 [2021-10-05 22:40:41,646 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 485.7ms TimeCoverageRelationStatistics Valid=420, Invalid=1650, Unknown=0, NotChecked=0, Total=2070 [2021-10-05 22:40:41,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5510 states. [2021-10-05 22:40:41,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5510 to 3880. [2021-10-05 22:40:41,717 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 22:40:41,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3880 states to 3880 states and 11633 transitions. [2021-10-05 22:40:41,728 INFO L78 Accepts]: Start accepts. Automaton has 3880 states and 11633 transitions. Word has length 38 [2021-10-05 22:40:41,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:41,728 INFO L470 AbstractCegarLoop]: Abstraction has 3880 states and 11633 transitions. [2021-10-05 22:40:41,729 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 22:40:41,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3880 states and 11633 transitions. [2021-10-05 22:40:41,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:41,736 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:41,736 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:41,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-05 22:40:41,737 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 22:40:41,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:41,737 INFO L82 PathProgramCache]: Analyzing trace with hash -708803817, now seen corresponding path program 29 times [2021-10-05 22:40:41,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:41,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039914460] [2021-10-05 22:40:41,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:41,738 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:41,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:41,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039914460] [2021-10-05 22:40:41,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039914460] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:41,901 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:41,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:40:41,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008569689] [2021-10-05 22:40:41,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:40:41,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:41,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:40:41,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:40:41,903 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 22:40:42,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:42,682 INFO L93 Difference]: Finished difference Result 4610 states and 13390 transitions. [2021-10-05 22:40:42,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 22:40:42,683 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 22:40:42,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:42,693 INFO L225 Difference]: With dead ends: 4610 [2021-10-05 22:40:42,693 INFO L226 Difference]: Without dead ends: 4586 [2021-10-05 22:40:42,694 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 324.7ms TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2021-10-05 22:40:42,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4586 states. [2021-10-05 22:40:42,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4586 to 3954. [2021-10-05 22:40:42,762 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 22:40:42,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 11800 transitions. [2021-10-05 22:40:42,774 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 11800 transitions. Word has length 38 [2021-10-05 22:40:42,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:42,774 INFO L470 AbstractCegarLoop]: Abstraction has 3954 states and 11800 transitions. [2021-10-05 22:40:42,774 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 22:40:42,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 11800 transitions. [2021-10-05 22:40:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:42,781 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:42,781 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:42,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-05 22:40:42,782 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 22:40:42,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:42,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1405943655, now seen corresponding path program 30 times [2021-10-05 22:40:42,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:42,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568677527] [2021-10-05 22:40:42,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:42,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:42,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:42,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568677527] [2021-10-05 22:40:42,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568677527] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:42,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:42,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:42,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086542801] [2021-10-05 22:40:42,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:42,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:42,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:42,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:42,906 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 22:40:43,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:43,750 INFO L93 Difference]: Finished difference Result 5524 states and 16046 transitions. [2021-10-05 22:40:43,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 22:40:43,750 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 22:40:43,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:43,760 INFO L225 Difference]: With dead ends: 5524 [2021-10-05 22:40:43,761 INFO L226 Difference]: Without dead ends: 5508 [2021-10-05 22:40:43,761 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 323.1ms TimeCoverageRelationStatistics Valid=244, Invalid=686, Unknown=0, NotChecked=0, Total=930 [2021-10-05 22:40:43,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5508 states. [2021-10-05 22:40:43,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5508 to 4022. [2021-10-05 22:40:43,859 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 22:40:43,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 12024 transitions. [2021-10-05 22:40:43,870 INFO L78 Accepts]: Start accepts. Automaton has 4022 states and 12024 transitions. Word has length 38 [2021-10-05 22:40:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:43,870 INFO L470 AbstractCegarLoop]: Abstraction has 4022 states and 12024 transitions. [2021-10-05 22:40:43,870 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 22:40:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4022 states and 12024 transitions. [2021-10-05 22:40:43,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:43,877 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:43,877 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:43,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-05 22:40:43,878 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 22:40:43,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:43,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1211511691, now seen corresponding path program 31 times [2021-10-05 22:40:43,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:43,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621524425] [2021-10-05 22:40:43,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:43,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:44,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:44,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621524425] [2021-10-05 22:40:44,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621524425] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:44,006 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:44,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:40:44,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9528799] [2021-10-05 22:40:44,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:40:44,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:44,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:40:44,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:40:44,008 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 22:40:45,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:45,042 INFO L93 Difference]: Finished difference Result 5590 states and 16173 transitions. [2021-10-05 22:40:45,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-05 22:40:45,043 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 22:40:45,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:45,061 INFO L225 Difference]: With dead ends: 5590 [2021-10-05 22:40:45,062 INFO L226 Difference]: Without dead ends: 5548 [2021-10-05 22:40:45,063 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 441.5ms TimeCoverageRelationStatistics Valid=356, Invalid=1126, Unknown=0, NotChecked=0, Total=1482 [2021-10-05 22:40:45,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2021-10-05 22:40:45,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 4008. [2021-10-05 22:40:45,160 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 22:40:45,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 11989 transitions. [2021-10-05 22:40:45,171 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 11989 transitions. Word has length 38 [2021-10-05 22:40:45,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:45,171 INFO L470 AbstractCegarLoop]: Abstraction has 4008 states and 11989 transitions. [2021-10-05 22:40:45,171 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 22:40:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 11989 transitions. [2021-10-05 22:40:45,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:45,181 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:45,181 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:45,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-05 22:40:45,181 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 22:40:45,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:45,182 INFO L82 PathProgramCache]: Analyzing trace with hash 2048816405, now seen corresponding path program 32 times [2021-10-05 22:40:45,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:45,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238021927] [2021-10-05 22:40:45,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:45,182 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:45,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 22:40:45,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:45,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238021927] [2021-10-05 22:40:45,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238021927] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:45,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:45,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:45,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125223135] [2021-10-05 22:40:45,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:45,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:45,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:45,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:45,303 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 22:40:46,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:46,044 INFO L93 Difference]: Finished difference Result 5374 states and 15512 transitions. [2021-10-05 22:40:46,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-10-05 22:40:46,044 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 22:40:46,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:46,056 INFO L225 Difference]: With dead ends: 5374 [2021-10-05 22:40:46,056 INFO L226 Difference]: Without dead ends: 5362 [2021-10-05 22:40:46,057 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 298.4ms TimeCoverageRelationStatistics Valid=295, Invalid=895, Unknown=0, NotChecked=0, Total=1190 [2021-10-05 22:40:46,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states. [2021-10-05 22:40:46,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 3984. [2021-10-05 22:40:46,128 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 22:40:46,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 11893 transitions. [2021-10-05 22:40:46,138 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 11893 transitions. Word has length 38 [2021-10-05 22:40:46,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:46,139 INFO L470 AbstractCegarLoop]: Abstraction has 3984 states and 11893 transitions. [2021-10-05 22:40:46,139 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 22:40:46,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 11893 transitions. [2021-10-05 22:40:46,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:46,146 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:46,147 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:46,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-05 22:40:46,147 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 22:40:46,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:46,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1854384441, now seen corresponding path program 33 times [2021-10-05 22:40:46,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:46,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084422380] [2021-10-05 22:40:46,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:46,148 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:46,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:46,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084422380] [2021-10-05 22:40:46,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084422380] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:46,270 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:46,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:40:46,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465161937] [2021-10-05 22:40:46,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:40:46,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:46,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:40:46,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:40:46,272 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 22:40:47,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:47,146 INFO L93 Difference]: Finished difference Result 5362 states and 15448 transitions. [2021-10-05 22:40:47,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-10-05 22:40:47,147 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 22:40:47,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:47,158 INFO L225 Difference]: With dead ends: 5362 [2021-10-05 22:40:47,158 INFO L226 Difference]: Without dead ends: 5330 [2021-10-05 22:40:47,159 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 374.7ms TimeCoverageRelationStatistics Valid=393, Invalid=1247, Unknown=0, NotChecked=0, Total=1640 [2021-10-05 22:40:47,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5330 states. [2021-10-05 22:40:47,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5330 to 3924. [2021-10-05 22:40:47,259 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 22:40:47,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 11713 transitions. [2021-10-05 22:40:47,277 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 11713 transitions. Word has length 38 [2021-10-05 22:40:47,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:47,277 INFO L470 AbstractCegarLoop]: Abstraction has 3924 states and 11713 transitions. [2021-10-05 22:40:47,277 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 22:40:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 11713 transitions. [2021-10-05 22:40:47,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:47,288 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:47,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 22:40:47,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-05 22:40:47,289 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 22:40:47,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:47,289 INFO L82 PathProgramCache]: Analyzing trace with hash 783442425, now seen corresponding path program 34 times [2021-10-05 22:40:47,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:47,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557752912] [2021-10-05 22:40:47,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:47,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:47,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 22:40:47,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:47,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557752912] [2021-10-05 22:40:47,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557752912] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:47,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:47,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:40:47,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357060075] [2021-10-05 22:40:47,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:40:47,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:47,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:40:47,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:40:47,399 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 22:40:47,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:47,963 INFO L93 Difference]: Finished difference Result 5190 states and 15001 transitions. [2021-10-05 22:40:47,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-05 22:40:47,964 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 22:40:47,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:47,979 INFO L225 Difference]: With dead ends: 5190 [2021-10-05 22:40:47,979 INFO L226 Difference]: Without dead ends: 5072 [2021-10-05 22:40:47,980 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 179.9ms TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2021-10-05 22:40:47,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2021-10-05 22:40:48,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 4038. [2021-10-05 22:40:48,091 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 22:40:48,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4038 states to 4038 states and 12018 transitions. [2021-10-05 22:40:48,109 INFO L78 Accepts]: Start accepts. Automaton has 4038 states and 12018 transitions. Word has length 38 [2021-10-05 22:40:48,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:48,110 INFO L470 AbstractCegarLoop]: Abstraction has 4038 states and 12018 transitions. [2021-10-05 22:40:48,110 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 22:40:48,110 INFO L276 IsEmpty]: Start isEmpty. Operand 4038 states and 12018 transitions. [2021-10-05 22:40:48,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:48,119 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:48,120 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:48,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-05 22:40:48,120 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 22:40:48,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:48,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1318167409, now seen corresponding path program 35 times [2021-10-05 22:40:48,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:48,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498038348] [2021-10-05 22:40:48,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:48,122 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:48,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 22:40:48,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:48,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498038348] [2021-10-05 22:40:48,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498038348] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:48,236 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:48,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:40:48,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927042378] [2021-10-05 22:40:48,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:40:48,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:48,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:40:48,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:40:48,238 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 22:40:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:49,248 INFO L93 Difference]: Finished difference Result 5626 states and 16095 transitions. [2021-10-05 22:40:49,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-10-05 22:40:49,248 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 22:40:49,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:49,295 INFO L225 Difference]: With dead ends: 5626 [2021-10-05 22:40:49,295 INFO L226 Difference]: Without dead ends: 5472 [2021-10-05 22:40:49,296 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 408.2ms TimeCoverageRelationStatistics Valid=397, Invalid=1409, Unknown=0, NotChecked=0, Total=1806 [2021-10-05 22:40:49,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5472 states. [2021-10-05 22:40:49,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5472 to 4104. [2021-10-05 22:40:49,439 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 22:40:49,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 12203 transitions. [2021-10-05 22:40:49,460 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 12203 transitions. Word has length 38 [2021-10-05 22:40:49,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:49,461 INFO L470 AbstractCegarLoop]: Abstraction has 4104 states and 12203 transitions. [2021-10-05 22:40:49,461 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 22:40:49,461 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 12203 transitions. [2021-10-05 22:40:49,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:49,472 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:49,472 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:49,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-05 22:40:49,472 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 22:40:49,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:49,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1580468935, now seen corresponding path program 36 times [2021-10-05 22:40:49,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:49,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554346474] [2021-10-05 22:40:49,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:49,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:49,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 22:40:49,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:49,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554346474] [2021-10-05 22:40:49,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554346474] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:49,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:49,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:40:49,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091376588] [2021-10-05 22:40:49,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:40:49,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:49,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:40:49,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:40:49,597 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 22:40:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:50,449 INFO L93 Difference]: Finished difference Result 5420 states and 15464 transitions. [2021-10-05 22:40:50,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-05 22:40:50,449 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 22:40:50,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:50,464 INFO L225 Difference]: With dead ends: 5420 [2021-10-05 22:40:50,464 INFO L226 Difference]: Without dead ends: 5074 [2021-10-05 22:40:50,465 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 327.8ms TimeCoverageRelationStatistics Valid=248, Invalid=874, Unknown=0, NotChecked=0, Total=1122 [2021-10-05 22:40:50,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5074 states. [2021-10-05 22:40:50,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5074 to 4264. [2021-10-05 22:40:50,573 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 22:40:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4264 states to 4264 states and 12644 transitions. [2021-10-05 22:40:50,588 INFO L78 Accepts]: Start accepts. Automaton has 4264 states and 12644 transitions. Word has length 38 [2021-10-05 22:40:50,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:50,589 INFO L470 AbstractCegarLoop]: Abstraction has 4264 states and 12644 transitions. [2021-10-05 22:40:50,589 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 22:40:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 4264 states and 12644 transitions. [2021-10-05 22:40:50,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:50,599 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:50,599 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:50,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-05 22:40:50,600 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 22:40:50,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:50,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1021802961, now seen corresponding path program 37 times [2021-10-05 22:40:50,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:50,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343649080] [2021-10-05 22:40:50,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:50,601 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:50,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:50,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343649080] [2021-10-05 22:40:50,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343649080] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:50,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:50,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:40:50,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070310516] [2021-10-05 22:40:50,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:40:50,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:50,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:40:50,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:40:50,722 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 22:40:51,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:51,725 INFO L93 Difference]: Finished difference Result 5652 states and 15864 transitions. [2021-10-05 22:40:51,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-05 22:40:51,726 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 22:40:51,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:51,747 INFO L225 Difference]: With dead ends: 5652 [2021-10-05 22:40:51,747 INFO L226 Difference]: Without dead ends: 5394 [2021-10-05 22:40:51,748 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 425.3ms TimeCoverageRelationStatistics Valid=349, Invalid=1211, Unknown=0, NotChecked=0, Total=1560 [2021-10-05 22:40:51,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5394 states. [2021-10-05 22:40:51,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5394 to 3936. [2021-10-05 22:40:51,849 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 22:40:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3936 states to 3936 states and 11638 transitions. [2021-10-05 22:40:51,865 INFO L78 Accepts]: Start accepts. Automaton has 3936 states and 11638 transitions. Word has length 38 [2021-10-05 22:40:51,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:51,865 INFO L470 AbstractCegarLoop]: Abstraction has 3936 states and 11638 transitions. [2021-10-05 22:40:51,865 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 22:40:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 3936 states and 11638 transitions. [2021-10-05 22:40:51,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:51,875 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:51,875 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:51,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-05 22:40:51,876 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 22:40:51,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:51,876 INFO L82 PathProgramCache]: Analyzing trace with hash -54192441, now seen corresponding path program 38 times [2021-10-05 22:40:51,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:51,876 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601003244] [2021-10-05 22:40:51,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:51,877 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:52,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:52,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601003244] [2021-10-05 22:40:52,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601003244] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:52,033 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:52,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:40:52,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663143292] [2021-10-05 22:40:52,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:40:52,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:52,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:40:52,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:40:52,035 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 22:40:52,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:52,863 INFO L93 Difference]: Finished difference Result 4496 states and 13219 transitions. [2021-10-05 22:40:52,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-10-05 22:40:52,864 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 22:40:52,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:52,881 INFO L225 Difference]: With dead ends: 4496 [2021-10-05 22:40:52,882 INFO L226 Difference]: Without dead ends: 4474 [2021-10-05 22:40:52,882 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 385.2ms TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2021-10-05 22:40:52,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4474 states. [2021-10-05 22:40:52,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4474 to 3944. [2021-10-05 22:40:52,977 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 22:40:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 11658 transitions. [2021-10-05 22:40:52,992 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 11658 transitions. Word has length 38 [2021-10-05 22:40:52,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:52,992 INFO L470 AbstractCegarLoop]: Abstraction has 3944 states and 11658 transitions. [2021-10-05 22:40:52,993 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 22:40:52,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 11658 transitions. [2021-10-05 22:40:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:53,002 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:53,002 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:53,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-05 22:40:53,003 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 22:40:53,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:53,003 INFO L82 PathProgramCache]: Analyzing trace with hash -190968269, now seen corresponding path program 39 times [2021-10-05 22:40:53,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:53,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935271749] [2021-10-05 22:40:53,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:53,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:53,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 22:40:53,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:53,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935271749] [2021-10-05 22:40:53,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935271749] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:53,155 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:53,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:40:53,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956464855] [2021-10-05 22:40:53,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:40:53,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:53,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:40:53,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:40:53,156 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 22:40:54,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:54,456 INFO L93 Difference]: Finished difference Result 5344 states and 14999 transitions. [2021-10-05 22:40:54,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-10-05 22:40:54,457 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 22:40:54,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:54,475 INFO L225 Difference]: With dead ends: 5344 [2021-10-05 22:40:54,475 INFO L226 Difference]: Without dead ends: 4900 [2021-10-05 22:40:54,476 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 593.4ms TimeCoverageRelationStatistics Valid=426, Invalid=1644, Unknown=0, NotChecked=0, Total=2070 [2021-10-05 22:40:54,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4900 states. [2021-10-05 22:40:54,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4900 to 3814. [2021-10-05 22:40:54,570 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 22:40:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3814 states to 3814 states and 11180 transitions. [2021-10-05 22:40:54,584 INFO L78 Accepts]: Start accepts. Automaton has 3814 states and 11180 transitions. Word has length 38 [2021-10-05 22:40:54,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:54,584 INFO L470 AbstractCegarLoop]: Abstraction has 3814 states and 11180 transitions. [2021-10-05 22:40:54,584 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 22:40:54,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3814 states and 11180 transitions. [2021-10-05 22:40:54,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:54,594 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:54,594 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:54,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-05 22:40:54,594 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 22:40:54,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:54,594 INFO L82 PathProgramCache]: Analyzing trace with hash -853483989, now seen corresponding path program 40 times [2021-10-05 22:40:54,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:54,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110366187] [2021-10-05 22:40:54,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:54,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:54,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 22:40:54,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:54,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110366187] [2021-10-05 22:40:54,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110366187] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:54,749 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:54,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:40:54,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359871443] [2021-10-05 22:40:54,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:40:54,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:54,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:40:54,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:40:54,751 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 22:40:55,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:55,907 INFO L93 Difference]: Finished difference Result 5006 states and 14163 transitions. [2021-10-05 22:40:55,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-05 22:40:55,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 22:40:55,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:55,923 INFO L225 Difference]: With dead ends: 5006 [2021-10-05 22:40:55,923 INFO L226 Difference]: Without dead ends: 4970 [2021-10-05 22:40:55,924 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 547.5ms TimeCoverageRelationStatistics Valid=336, Invalid=1224, Unknown=0, NotChecked=0, Total=1560 [2021-10-05 22:40:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4970 states. [2021-10-05 22:40:56,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4970 to 3826. [2021-10-05 22:40:56,022 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 22:40:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 11202 transitions. [2021-10-05 22:40:56,036 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 11202 transitions. Word has length 38 [2021-10-05 22:40:56,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:56,037 INFO L470 AbstractCegarLoop]: Abstraction has 3826 states and 11202 transitions. [2021-10-05 22:40:56,037 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 22:40:56,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 11202 transitions. [2021-10-05 22:40:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:56,047 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:56,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 22:40:56,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-05 22:40:56,047 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 22:40:56,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:56,048 INFO L82 PathProgramCache]: Analyzing trace with hash 911260395, now seen corresponding path program 41 times [2021-10-05 22:40:56,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:56,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694623974] [2021-10-05 22:40:56,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:56,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:56,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 22:40:56,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:56,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694623974] [2021-10-05 22:40:56,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694623974] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:56,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:56,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:40:56,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462998104] [2021-10-05 22:40:56,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:40:56,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:56,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:40:56,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:40:56,192 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 22:40:57,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:57,281 INFO L93 Difference]: Finished difference Result 5764 states and 16036 transitions. [2021-10-05 22:40:57,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-05 22:40:57,281 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 22:40:57,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:57,296 INFO L225 Difference]: With dead ends: 5764 [2021-10-05 22:40:57,296 INFO L226 Difference]: Without dead ends: 5662 [2021-10-05 22:40:57,297 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 481.7ms TimeCoverageRelationStatistics Valid=337, Invalid=1145, Unknown=0, NotChecked=0, Total=1482 [2021-10-05 22:40:57,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5662 states. [2021-10-05 22:40:57,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5662 to 3774. [2021-10-05 22:40:57,375 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 22:40:57,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3774 states to 3774 states and 11069 transitions. [2021-10-05 22:40:57,384 INFO L78 Accepts]: Start accepts. Automaton has 3774 states and 11069 transitions. Word has length 38 [2021-10-05 22:40:57,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:57,385 INFO L470 AbstractCegarLoop]: Abstraction has 3774 states and 11069 transitions. [2021-10-05 22:40:57,385 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 22:40:57,385 INFO L276 IsEmpty]: Start isEmpty. Operand 3774 states and 11069 transitions. [2021-10-05 22:40:57,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:57,391 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:57,391 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:57,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-05 22:40:57,392 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 22:40:57,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:57,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1110862167, now seen corresponding path program 42 times [2021-10-05 22:40:57,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:57,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266684898] [2021-10-05 22:40:57,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:57,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:57,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:57,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:57,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266684898] [2021-10-05 22:40:57,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266684898] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:57,515 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:57,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:57,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328512508] [2021-10-05 22:40:57,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:57,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:57,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:57,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:57,520 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 22:40:58,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:58,062 INFO L93 Difference]: Finished difference Result 4326 states and 12611 transitions. [2021-10-05 22:40:58,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 22:40:58,063 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 22:40:58,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:58,088 INFO L225 Difference]: With dead ends: 4326 [2021-10-05 22:40:58,088 INFO L226 Difference]: Without dead ends: 4312 [2021-10-05 22:40:58,089 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 226.3ms TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:40:58,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4312 states. [2021-10-05 22:40:58,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4312 to 3776. [2021-10-05 22:40:58,151 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 22:40:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3776 states to 3776 states and 11072 transitions. [2021-10-05 22:40:58,161 INFO L78 Accepts]: Start accepts. Automaton has 3776 states and 11072 transitions. Word has length 38 [2021-10-05 22:40:58,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:58,161 INFO L470 AbstractCegarLoop]: Abstraction has 3776 states and 11072 transitions. [2021-10-05 22:40:58,162 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 22:40:58,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3776 states and 11072 transitions. [2021-10-05 22:40:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:58,170 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:58,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 22:40:58,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-05 22:40:58,170 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 22:40:58,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:58,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1596839181, now seen corresponding path program 43 times [2021-10-05 22:40:58,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:58,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775923130] [2021-10-05 22:40:58,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:58,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:58,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:58,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775923130] [2021-10-05 22:40:58,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775923130] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:58,302 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:58,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:40:58,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898674588] [2021-10-05 22:40:58,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:40:58,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:58,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:40:58,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:40:58,304 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 22:40:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:59,285 INFO L93 Difference]: Finished difference Result 4812 states and 13598 transitions. [2021-10-05 22:40:59,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 22:40:59,286 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 22:40:59,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:59,303 INFO L225 Difference]: With dead ends: 4812 [2021-10-05 22:40:59,303 INFO L226 Difference]: Without dead ends: 4784 [2021-10-05 22:40:59,304 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 476.9ms TimeCoverageRelationStatistics Valid=317, Invalid=943, Unknown=0, NotChecked=0, Total=1260 [2021-10-05 22:40:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4784 states. [2021-10-05 22:40:59,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4784 to 3798. [2021-10-05 22:40:59,395 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 22:40:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3798 states to 3798 states and 11135 transitions. [2021-10-05 22:40:59,409 INFO L78 Accepts]: Start accepts. Automaton has 3798 states and 11135 transitions. Word has length 38 [2021-10-05 22:40:59,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:59,410 INFO L470 AbstractCegarLoop]: Abstraction has 3798 states and 11135 transitions. [2021-10-05 22:40:59,410 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 22:40:59,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3798 states and 11135 transitions. [2021-10-05 22:40:59,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:40:59,419 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:59,419 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:59,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-05 22:40:59,420 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 22:40:59,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:59,420 INFO L82 PathProgramCache]: Analyzing trace with hash 815705003, now seen corresponding path program 44 times [2021-10-05 22:40:59,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:59,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073624473] [2021-10-05 22:40:59,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:59,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:59,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:59,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:59,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073624473] [2021-10-05 22:40:59,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073624473] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:59,557 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:59,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:40:59,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186305137] [2021-10-05 22:40:59,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:40:59,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:59,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:40:59,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:40:59,560 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 22:41:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:00,566 INFO L93 Difference]: Finished difference Result 5588 states and 15636 transitions. [2021-10-05 22:41:00,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-05 22:41:00,566 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 22:41:00,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:00,585 INFO L225 Difference]: With dead ends: 5588 [2021-10-05 22:41:00,585 INFO L226 Difference]: Without dead ends: 5572 [2021-10-05 22:41:00,586 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 462.2ms TimeCoverageRelationStatistics Valid=347, Invalid=1059, Unknown=0, NotChecked=0, Total=1406 [2021-10-05 22:41:00,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5572 states. [2021-10-05 22:41:00,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5572 to 3798. [2021-10-05 22:41:00,692 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 22:41:00,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3798 states to 3798 states and 11123 transitions. [2021-10-05 22:41:00,707 INFO L78 Accepts]: Start accepts. Automaton has 3798 states and 11123 transitions. Word has length 38 [2021-10-05 22:41:00,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:00,707 INFO L470 AbstractCegarLoop]: Abstraction has 3798 states and 11123 transitions. [2021-10-05 22:41:00,707 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 22:41:00,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3798 states and 11123 transitions. [2021-10-05 22:41:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:00,717 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:00,717 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:00,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-05 22:41:00,718 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 22:41:00,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:00,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1536875931, now seen corresponding path program 45 times [2021-10-05 22:41:00,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:00,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980041801] [2021-10-05 22:41:00,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:00,719 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:00,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:00,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:00,894 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980041801] [2021-10-05 22:41:00,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980041801] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:00,894 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:00,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:00,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884420852] [2021-10-05 22:41:00,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:00,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:00,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:00,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:00,896 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 22:41:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:01,974 INFO L93 Difference]: Finished difference Result 4916 states and 13926 transitions. [2021-10-05 22:41:01,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-05 22:41:01,975 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 22:41:01,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:01,989 INFO L225 Difference]: With dead ends: 4916 [2021-10-05 22:41:01,990 INFO L226 Difference]: Without dead ends: 4900 [2021-10-05 22:41:01,991 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 22:41:02,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4900 states. [2021-10-05 22:41:02,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4900 to 3796. [2021-10-05 22:41:02,086 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 22:41:02,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 11110 transitions. [2021-10-05 22:41:02,100 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 11110 transitions. Word has length 38 [2021-10-05 22:41:02,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:02,101 INFO L470 AbstractCegarLoop]: Abstraction has 3796 states and 11110 transitions. [2021-10-05 22:41:02,101 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 22:41:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 11110 transitions. [2021-10-05 22:41:02,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:02,111 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:02,111 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:02,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-10-05 22:41:02,111 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 22:41:02,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:02,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1591792559, now seen corresponding path program 46 times [2021-10-05 22:41:02,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:02,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642192166] [2021-10-05 22:41:02,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:02,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:02,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:02,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:02,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642192166] [2021-10-05 22:41:02,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642192166] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:02,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:02,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:02,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112366559] [2021-10-05 22:41:02,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:02,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:02,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:02,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:02,243 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 22:41:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:03,182 INFO L93 Difference]: Finished difference Result 5162 states and 14490 transitions. [2021-10-05 22:41:03,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 22:41:03,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 22:41:03,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:03,201 INFO L225 Difference]: With dead ends: 5162 [2021-10-05 22:41:03,201 INFO L226 Difference]: Without dead ends: 5148 [2021-10-05 22:41:03,202 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 432.8ms TimeCoverageRelationStatistics Valid=301, Invalid=959, Unknown=0, NotChecked=0, Total=1260 [2021-10-05 22:41:03,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5148 states. [2021-10-05 22:41:03,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5148 to 3788. [2021-10-05 22:41:03,299 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 22:41:03,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3788 states and 11092 transitions. [2021-10-05 22:41:03,313 INFO L78 Accepts]: Start accepts. Automaton has 3788 states and 11092 transitions. Word has length 38 [2021-10-05 22:41:03,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:03,313 INFO L470 AbstractCegarLoop]: Abstraction has 3788 states and 11092 transitions. [2021-10-05 22:41:03,313 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 22:41:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 11092 transitions. [2021-10-05 22:41:03,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:03,324 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:03,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 22:41:03,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-05 22:41:03,324 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 22:41:03,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:03,325 INFO L82 PathProgramCache]: Analyzing trace with hash 289232823, now seen corresponding path program 47 times [2021-10-05 22:41:03,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:03,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415366209] [2021-10-05 22:41:03,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:03,326 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:03,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 22:41:03,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:03,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415366209] [2021-10-05 22:41:03,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415366209] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:03,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:03,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:41:03,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208701817] [2021-10-05 22:41:03,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:41:03,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:03,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:41:03,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:41:03,481 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 22:41:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:04,394 INFO L93 Difference]: Finished difference Result 4462 states and 12684 transitions. [2021-10-05 22:41:04,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 22:41:04,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 22:41:04,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:04,404 INFO L225 Difference]: With dead ends: 4462 [2021-10-05 22:41:04,404 INFO L226 Difference]: Without dead ends: 4430 [2021-10-05 22:41:04,405 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 412.2ms TimeCoverageRelationStatistics Valid=268, Invalid=854, Unknown=0, NotChecked=0, Total=1122 [2021-10-05 22:41:04,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4430 states. [2021-10-05 22:41:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4430 to 3776. [2021-10-05 22:41:04,504 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 22:41:04,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3776 states to 3776 states and 11057 transitions. [2021-10-05 22:41:04,513 INFO L78 Accepts]: Start accepts. Automaton has 3776 states and 11057 transitions. Word has length 38 [2021-10-05 22:41:04,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:04,514 INFO L470 AbstractCegarLoop]: Abstraction has 3776 states and 11057 transitions. [2021-10-05 22:41:04,514 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 22:41:04,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3776 states and 11057 transitions. [2021-10-05 22:41:04,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:04,522 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:04,523 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:04,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-05 22:41:04,524 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 22:41:04,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:04,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1807470791, now seen corresponding path program 48 times [2021-10-05 22:41:04,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:04,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792686744] [2021-10-05 22:41:04,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:04,525 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:04,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:04,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792686744] [2021-10-05 22:41:04,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792686744] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:04,638 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:04,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:41:04,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766562512] [2021-10-05 22:41:04,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:41:04,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:04,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:41:04,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:41:04,642 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 22:41:05,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:05,507 INFO L93 Difference]: Finished difference Result 5170 states and 14569 transitions. [2021-10-05 22:41:05,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-05 22:41:05,508 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 22:41:05,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:05,521 INFO L225 Difference]: With dead ends: 5170 [2021-10-05 22:41:05,521 INFO L226 Difference]: Without dead ends: 5162 [2021-10-05 22:41:05,522 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 398.7ms TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2021-10-05 22:41:05,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5162 states. [2021-10-05 22:41:05,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5162 to 3794. [2021-10-05 22:41:05,593 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 22:41:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 11094 transitions. [2021-10-05 22:41:05,603 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 11094 transitions. Word has length 38 [2021-10-05 22:41:05,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:05,603 INFO L470 AbstractCegarLoop]: Abstraction has 3794 states and 11094 transitions. [2021-10-05 22:41:05,603 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 22:41:05,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 11094 transitions. [2021-10-05 22:41:05,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:05,611 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:05,611 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:05,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-10-05 22:41:05,612 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 22:41:05,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:05,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1766325577, now seen corresponding path program 49 times [2021-10-05 22:41:05,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:05,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747624315] [2021-10-05 22:41:05,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:05,613 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:05,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:05,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747624315] [2021-10-05 22:41:05,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747624315] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:05,742 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:05,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:05,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842445686] [2021-10-05 22:41:05,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:05,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:05,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:05,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:05,744 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 22:41:06,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:06,783 INFO L93 Difference]: Finished difference Result 5216 states and 14673 transitions. [2021-10-05 22:41:06,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-10-05 22:41:06,783 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 22:41:06,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:06,793 INFO L225 Difference]: With dead ends: 5216 [2021-10-05 22:41:06,793 INFO L226 Difference]: Without dead ends: 5208 [2021-10-05 22:41:06,794 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 504.9ms TimeCoverageRelationStatistics Valid=436, Invalid=1456, Unknown=0, NotChecked=0, Total=1892 [2021-10-05 22:41:06,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5208 states. [2021-10-05 22:41:06,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5208 to 3792. [2021-10-05 22:41:06,863 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 22:41:06,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 11089 transitions. [2021-10-05 22:41:06,873 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 11089 transitions. Word has length 38 [2021-10-05 22:41:06,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:06,873 INFO L470 AbstractCegarLoop]: Abstraction has 3792 states and 11089 transitions. [2021-10-05 22:41:06,873 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 22:41:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 11089 transitions. [2021-10-05 22:41:06,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:06,880 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:06,880 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:06,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-10-05 22:41:06,880 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 22:41:06,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:06,881 INFO L82 PathProgramCache]: Analyzing trace with hash 679971847, now seen corresponding path program 50 times [2021-10-05 22:41:06,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:06,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494915648] [2021-10-05 22:41:06,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:06,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:07,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:07,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:07,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494915648] [2021-10-05 22:41:07,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494915648] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:07,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:07,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:41:07,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680990279] [2021-10-05 22:41:07,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:41:07,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:07,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:41:07,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:41:07,005 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 22:41:07,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:07,782 INFO L93 Difference]: Finished difference Result 5234 states and 14670 transitions. [2021-10-05 22:41:07,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 22:41:07,783 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 22:41:07,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:07,794 INFO L225 Difference]: With dead ends: 5234 [2021-10-05 22:41:07,794 INFO L226 Difference]: Without dead ends: 5226 [2021-10-05 22:41:07,795 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 339.7ms TimeCoverageRelationStatistics Valid=287, Invalid=835, Unknown=0, NotChecked=0, Total=1122 [2021-10-05 22:41:07,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5226 states. [2021-10-05 22:41:07,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5226 to 3792. [2021-10-05 22:41:07,869 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 22:41:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 11089 transitions. [2021-10-05 22:41:07,878 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 11089 transitions. Word has length 38 [2021-10-05 22:41:07,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:07,879 INFO L470 AbstractCegarLoop]: Abstraction has 3792 states and 11089 transitions. [2021-10-05 22:41:07,879 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 22:41:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 11089 transitions. [2021-10-05 22:41:07,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:07,886 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:07,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 22:41:07,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-10-05 22:41:07,887 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 22:41:07,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:07,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1129080137, now seen corresponding path program 51 times [2021-10-05 22:41:07,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:07,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974819614] [2021-10-05 22:41:07,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:07,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:08,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:08,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974819614] [2021-10-05 22:41:08,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974819614] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:08,010 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:08,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:08,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156995575] [2021-10-05 22:41:08,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:08,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:08,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:08,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:08,012 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 22:41:08,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:08,807 INFO L93 Difference]: Finished difference Result 5240 states and 14683 transitions. [2021-10-05 22:41:08,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-05 22:41:08,807 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 22:41:08,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:08,819 INFO L225 Difference]: With dead ends: 5240 [2021-10-05 22:41:08,819 INFO L226 Difference]: Without dead ends: 5212 [2021-10-05 22:41:08,819 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 323.1ms TimeCoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2021-10-05 22:41:08,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5212 states. [2021-10-05 22:41:08,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5212 to 3792. [2021-10-05 22:41:08,892 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 22:41:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 11085 transitions. [2021-10-05 22:41:08,902 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 11085 transitions. Word has length 38 [2021-10-05 22:41:08,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:08,903 INFO L470 AbstractCegarLoop]: Abstraction has 3792 states and 11085 transitions. [2021-10-05 22:41:08,903 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 22:41:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 11085 transitions. [2021-10-05 22:41:08,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:08,910 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:08,910 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:08,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-10-05 22:41:08,911 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 22:41:08,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:08,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2012362233, now seen corresponding path program 52 times [2021-10-05 22:41:08,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:08,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101720264] [2021-10-05 22:41:08,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:08,912 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:09,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:09,050 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101720264] [2021-10-05 22:41:09,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101720264] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:09,050 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:09,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:41:09,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768078554] [2021-10-05 22:41:09,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:41:09,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:09,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:41:09,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:41:09,052 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 22:41:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:10,166 INFO L93 Difference]: Finished difference Result 5222 states and 14681 transitions. [2021-10-05 22:41:10,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-10-05 22:41:10,167 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 22:41:10,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:10,184 INFO L225 Difference]: With dead ends: 5222 [2021-10-05 22:41:10,185 INFO L226 Difference]: Without dead ends: 5172 [2021-10-05 22:41:10,185 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 529.8ms TimeCoverageRelationStatistics Valid=408, Invalid=1484, Unknown=0, NotChecked=0, Total=1892 [2021-10-05 22:41:10,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5172 states. [2021-10-05 22:41:10,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5172 to 3772. [2021-10-05 22:41:10,287 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 22:41:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3772 states to 3772 states and 11046 transitions. [2021-10-05 22:41:10,302 INFO L78 Accepts]: Start accepts. Automaton has 3772 states and 11046 transitions. Word has length 38 [2021-10-05 22:41:10,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:10,303 INFO L470 AbstractCegarLoop]: Abstraction has 3772 states and 11046 transitions. [2021-10-05 22:41:10,303 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 22:41:10,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3772 states and 11046 transitions. [2021-10-05 22:41:10,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:10,314 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:10,314 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:10,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-10-05 22:41:10,314 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 22:41:10,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:10,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1737242703, now seen corresponding path program 53 times [2021-10-05 22:41:10,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:10,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478345429] [2021-10-05 22:41:10,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:10,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:10,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:10,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:10,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478345429] [2021-10-05 22:41:10,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478345429] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:10,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:10,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:41:10,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616788770] [2021-10-05 22:41:10,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:41:10,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:10,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:41:10,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:41:10,430 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 22:41:11,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:11,030 INFO L93 Difference]: Finished difference Result 4292 states and 12504 transitions. [2021-10-05 22:41:11,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 22:41:11,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 22:41:11,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:11,040 INFO L225 Difference]: With dead ends: 4292 [2021-10-05 22:41:11,040 INFO L226 Difference]: Without dead ends: 4278 [2021-10-05 22:41:11,041 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 231.0ms TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:41:11,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4278 states. [2021-10-05 22:41:11,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4278 to 3776. [2021-10-05 22:41:11,103 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 22:41:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3776 states to 3776 states and 11056 transitions. [2021-10-05 22:41:11,113 INFO L78 Accepts]: Start accepts. Automaton has 3776 states and 11056 transitions. Word has length 38 [2021-10-05 22:41:11,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:11,113 INFO L470 AbstractCegarLoop]: Abstraction has 3776 states and 11056 transitions. [2021-10-05 22:41:11,113 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 22:41:11,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3776 states and 11056 transitions. [2021-10-05 22:41:11,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:11,120 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:11,120 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:11,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-10-05 22:41:11,120 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 22:41:11,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:11,121 INFO L82 PathProgramCache]: Analyzing trace with hash 2071747579, now seen corresponding path program 54 times [2021-10-05 22:41:11,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:11,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515148382] [2021-10-05 22:41:11,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:11,121 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:11,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:11,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515148382] [2021-10-05 22:41:11,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515148382] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:11,248 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:11,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:11,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614277722] [2021-10-05 22:41:11,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:11,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:11,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:11,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:11,250 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 22:41:12,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:12,294 INFO L93 Difference]: Finished difference Result 4742 states and 13422 transitions. [2021-10-05 22:41:12,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 22:41:12,296 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 22:41:12,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:12,307 INFO L225 Difference]: With dead ends: 4742 [2021-10-05 22:41:12,307 INFO L226 Difference]: Without dead ends: 4730 [2021-10-05 22:41:12,307 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 477.4ms TimeCoverageRelationStatistics Valid=317, Invalid=943, Unknown=0, NotChecked=0, Total=1260 [2021-10-05 22:41:12,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4730 states. [2021-10-05 22:41:12,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4730 to 3790. [2021-10-05 22:41:12,372 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 22:41:12,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 11091 transitions. [2021-10-05 22:41:12,382 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 11091 transitions. Word has length 38 [2021-10-05 22:41:12,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:12,382 INFO L470 AbstractCegarLoop]: Abstraction has 3790 states and 11091 transitions. [2021-10-05 22:41:12,382 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 22:41:12,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 11091 transitions. [2021-10-05 22:41:12,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:12,389 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:12,389 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:12,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-10-05 22:41:12,390 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 22:41:12,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:12,390 INFO L82 PathProgramCache]: Analyzing trace with hash -108472245, now seen corresponding path program 55 times [2021-10-05 22:41:12,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:12,390 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135049834] [2021-10-05 22:41:12,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:12,390 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:12,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:12,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135049834] [2021-10-05 22:41:12,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135049834] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:12,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:12,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:12,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997451342] [2021-10-05 22:41:12,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:12,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:12,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:12,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:12,518 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 22:41:13,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:13,568 INFO L93 Difference]: Finished difference Result 5444 states and 15221 transitions. [2021-10-05 22:41:13,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-05 22:41:13,568 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 22:41:13,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:13,580 INFO L225 Difference]: With dead ends: 5444 [2021-10-05 22:41:13,580 INFO L226 Difference]: Without dead ends: 5436 [2021-10-05 22:41:13,580 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 467.1ms TimeCoverageRelationStatistics Valid=347, Invalid=1059, Unknown=0, NotChecked=0, Total=1406 [2021-10-05 22:41:13,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5436 states. [2021-10-05 22:41:13,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5436 to 3792. [2021-10-05 22:41:13,648 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 22:41:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 11094 transitions. [2021-10-05 22:41:13,658 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 11094 transitions. Word has length 38 [2021-10-05 22:41:13,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:13,658 INFO L470 AbstractCegarLoop]: Abstraction has 3792 states and 11094 transitions. [2021-10-05 22:41:13,658 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 22:41:13,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 11094 transitions. [2021-10-05 22:41:13,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:13,665 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:13,665 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:13,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-10-05 22:41:13,665 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 22:41:13,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:13,666 INFO L82 PathProgramCache]: Analyzing trace with hash -302904209, now seen corresponding path program 56 times [2021-10-05 22:41:13,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:13,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152696347] [2021-10-05 22:41:13,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:13,667 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:13,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 22:41:13,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:13,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152696347] [2021-10-05 22:41:13,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152696347] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:13,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:13,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:13,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987345257] [2021-10-05 22:41:13,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:13,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:13,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:13,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:13,798 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 22:41:14,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:14,885 INFO L93 Difference]: Finished difference Result 4844 states and 13734 transitions. [2021-10-05 22:41:14,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-05 22:41:14,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 22:41:14,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:14,901 INFO L225 Difference]: With dead ends: 4844 [2021-10-05 22:41:14,902 INFO L226 Difference]: Without dead ends: 4828 [2021-10-05 22:41:14,902 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 522.2ms TimeCoverageRelationStatistics Valid=329, Invalid=1077, Unknown=0, NotChecked=0, Total=1406 [2021-10-05 22:41:14,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4828 states. [2021-10-05 22:41:15,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4828 to 3782. [2021-10-05 22:41:15,065 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 22:41:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 11069 transitions. [2021-10-05 22:41:15,078 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 11069 transitions. Word has length 38 [2021-10-05 22:41:15,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:15,079 INFO L470 AbstractCegarLoop]: Abstraction has 3782 states and 11069 transitions. [2021-10-05 22:41:15,079 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 22:41:15,079 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 11069 transitions. [2021-10-05 22:41:15,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:15,088 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:15,088 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:15,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-10-05 22:41:15,089 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 22:41:15,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:15,090 INFO L82 PathProgramCache]: Analyzing trace with hash 262072719, now seen corresponding path program 57 times [2021-10-05 22:41:15,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:15,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125894509] [2021-10-05 22:41:15,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:15,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:15,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:15,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125894509] [2021-10-05 22:41:15,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125894509] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:15,239 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:15,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:41:15,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036305485] [2021-10-05 22:41:15,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:41:15,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:15,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:41:15,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:41:15,241 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 22:41:16,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:16,061 INFO L93 Difference]: Finished difference Result 4282 states and 12473 transitions. [2021-10-05 22:41:16,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-10-05 22:41:16,062 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 22:41:16,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:16,070 INFO L225 Difference]: With dead ends: 4282 [2021-10-05 22:41:16,070 INFO L226 Difference]: Without dead ends: 4260 [2021-10-05 22:41:16,071 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 383.9ms TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2021-10-05 22:41:16,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4260 states. [2021-10-05 22:41:16,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4260 to 3784. [2021-10-05 22:41:16,131 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 22:41:16,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 11072 transitions. [2021-10-05 22:41:16,140 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 11072 transitions. Word has length 38 [2021-10-05 22:41:16,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:16,140 INFO L470 AbstractCegarLoop]: Abstraction has 3784 states and 11072 transitions. [2021-10-05 22:41:16,141 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 22:41:16,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 11072 transitions. [2021-10-05 22:41:16,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:16,148 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:16,148 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:16,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-10-05 22:41:16,149 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 22:41:16,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:16,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1334248131, now seen corresponding path program 58 times [2021-10-05 22:41:16,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:16,149 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795952227] [2021-10-05 22:41:16,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:16,149 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:16,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:16,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795952227] [2021-10-05 22:41:16,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795952227] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:16,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:16,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:41:16,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541027404] [2021-10-05 22:41:16,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:41:16,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:16,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:41:16,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:41:16,287 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 22:41:17,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:17,409 INFO L93 Difference]: Finished difference Result 4838 states and 13604 transitions. [2021-10-05 22:41:17,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-05 22:41:17,410 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 22:41:17,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:17,419 INFO L225 Difference]: With dead ends: 4838 [2021-10-05 22:41:17,419 INFO L226 Difference]: Without dead ends: 4782 [2021-10-05 22:41:17,420 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 535.0ms TimeCoverageRelationStatistics Valid=381, Invalid=1259, Unknown=0, NotChecked=0, Total=1640 [2021-10-05 22:41:17,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2021-10-05 22:41:17,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 3810. [2021-10-05 22:41:17,482 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 22:41:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3810 states to 3810 states and 11119 transitions. [2021-10-05 22:41:17,491 INFO L78 Accepts]: Start accepts. Automaton has 3810 states and 11119 transitions. Word has length 38 [2021-10-05 22:41:17,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:17,492 INFO L470 AbstractCegarLoop]: Abstraction has 3810 states and 11119 transitions. [2021-10-05 22:41:17,492 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 22:41:17,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3810 states and 11119 transitions. [2021-10-05 22:41:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:17,498 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:17,498 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:17,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-10-05 22:41:17,498 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 22:41:17,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:17,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1121604557, now seen corresponding path program 59 times [2021-10-05 22:41:17,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:17,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441411616] [2021-10-05 22:41:17,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:17,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:17,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:17,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441411616] [2021-10-05 22:41:17,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441411616] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:17,630 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:17,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:41:17,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795817712] [2021-10-05 22:41:17,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:41:17,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:17,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:41:17,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:41:17,632 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 22:41:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:18,726 INFO L93 Difference]: Finished difference Result 4892 states and 13792 transitions. [2021-10-05 22:41:18,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-05 22:41:18,726 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 22:41:18,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:18,736 INFO L225 Difference]: With dead ends: 4892 [2021-10-05 22:41:18,737 INFO L226 Difference]: Without dead ends: 4860 [2021-10-05 22:41:18,738 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 533.7ms TimeCoverageRelationStatistics Valid=336, Invalid=1224, Unknown=0, NotChecked=0, Total=1560 [2021-10-05 22:41:18,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4860 states. [2021-10-05 22:41:18,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4860 to 3818. [2021-10-05 22:41:18,796 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 22:41:18,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3818 states to 3818 states and 11133 transitions. [2021-10-05 22:41:18,804 INFO L78 Accepts]: Start accepts. Automaton has 3818 states and 11133 transitions. Word has length 38 [2021-10-05 22:41:18,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:18,804 INFO L470 AbstractCegarLoop]: Abstraction has 3818 states and 11133 transitions. [2021-10-05 22:41:18,805 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 22:41:18,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3818 states and 11133 transitions. [2021-10-05 22:41:18,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:18,810 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:18,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 22:41:18,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-10-05 22:41:18,811 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 22:41:18,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:18,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1490790803, now seen corresponding path program 60 times [2021-10-05 22:41:18,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:18,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076446611] [2021-10-05 22:41:18,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:18,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:18,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 22:41:18,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:18,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076446611] [2021-10-05 22:41:18,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076446611] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:18,943 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:18,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:41:18,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962048704] [2021-10-05 22:41:18,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:41:18,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:18,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:41:18,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:41:18,945 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 22:41:19,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:19,881 INFO L93 Difference]: Finished difference Result 5528 states and 15358 transitions. [2021-10-05 22:41:19,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-05 22:41:19,881 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 22:41:19,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:19,892 INFO L225 Difference]: With dead ends: 5528 [2021-10-05 22:41:19,892 INFO L226 Difference]: Without dead ends: 5458 [2021-10-05 22:41:19,892 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 452.8ms TimeCoverageRelationStatistics Valid=337, Invalid=1145, Unknown=0, NotChecked=0, Total=1482 [2021-10-05 22:41:19,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5458 states. [2021-10-05 22:41:19,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5458 to 3784. [2021-10-05 22:41:19,955 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 22:41:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 11052 transitions. [2021-10-05 22:41:19,964 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 11052 transitions. Word has length 38 [2021-10-05 22:41:19,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:19,964 INFO L470 AbstractCegarLoop]: Abstraction has 3784 states and 11052 transitions. [2021-10-05 22:41:19,964 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 22:41:19,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 11052 transitions. [2021-10-05 22:41:19,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:19,970 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:19,970 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:19,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-10-05 22:41:19,971 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 22:41:19,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:19,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1708441429, now seen corresponding path program 61 times [2021-10-05 22:41:19,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:19,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591995820] [2021-10-05 22:41:19,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:19,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:20,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:20,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591995820] [2021-10-05 22:41:20,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591995820] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:20,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:20,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:41:20,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709762368] [2021-10-05 22:41:20,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:41:20,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:20,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:41:20,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:41:20,082 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 22:41:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:20,995 INFO L93 Difference]: Finished difference Result 5000 states and 14114 transitions. [2021-10-05 22:41:20,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-05 22:41:20,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 22:41:20,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:21,006 INFO L225 Difference]: With dead ends: 5000 [2021-10-05 22:41:21,006 INFO L226 Difference]: Without dead ends: 4992 [2021-10-05 22:41:21,007 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 395.3ms TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2021-10-05 22:41:21,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4992 states. [2021-10-05 22:41:21,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4992 to 3794. [2021-10-05 22:41:21,072 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 22:41:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 11071 transitions. [2021-10-05 22:41:21,083 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 11071 transitions. Word has length 38 [2021-10-05 22:41:21,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:21,083 INFO L470 AbstractCegarLoop]: Abstraction has 3794 states and 11071 transitions. [2021-10-05 22:41:21,083 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 22:41:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 11071 transitions. [2021-10-05 22:41:21,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:21,090 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:21,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 22:41:21,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-10-05 22:41:21,091 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 22:41:21,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:21,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1514009465, now seen corresponding path program 62 times [2021-10-05 22:41:21,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:21,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776165732] [2021-10-05 22:41:21,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:21,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:21,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 22:41:21,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:21,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776165732] [2021-10-05 22:41:21,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776165732] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:21,213 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:21,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:21,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543148130] [2021-10-05 22:41:21,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:21,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:21,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:21,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:21,215 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 22:41:22,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:22,300 INFO L93 Difference]: Finished difference Result 5036 states and 14194 transitions. [2021-10-05 22:41:22,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-10-05 22:41:22,300 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 22:41:22,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:22,310 INFO L225 Difference]: With dead ends: 5036 [2021-10-05 22:41:22,310 INFO L226 Difference]: Without dead ends: 5028 [2021-10-05 22:41:22,310 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 520.3ms TimeCoverageRelationStatistics Valid=436, Invalid=1456, Unknown=0, NotChecked=0, Total=1892 [2021-10-05 22:41:22,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5028 states. [2021-10-05 22:41:22,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5028 to 3792. [2021-10-05 22:41:22,372 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 22:41:22,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 11066 transitions. [2021-10-05 22:41:22,381 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 11066 transitions. Word has length 38 [2021-10-05 22:41:22,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:22,381 INFO L470 AbstractCegarLoop]: Abstraction has 3792 states and 11066 transitions. [2021-10-05 22:41:22,381 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 22:41:22,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 11066 transitions. [2021-10-05 22:41:22,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:22,387 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:22,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 22:41:22,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-10-05 22:41:22,388 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 22:41:22,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:22,389 INFO L82 PathProgramCache]: Analyzing trace with hash 268313167, now seen corresponding path program 63 times [2021-10-05 22:41:22,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:22,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132998623] [2021-10-05 22:41:22,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:22,389 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:22,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 22:41:22,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:22,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132998623] [2021-10-05 22:41:22,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132998623] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:22,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:22,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:41:22,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831253685] [2021-10-05 22:41:22,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:41:22,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:22,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:41:22,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:41:22,498 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 22:41:23,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:23,299 INFO L93 Difference]: Finished difference Result 5114 states and 14358 transitions. [2021-10-05 22:41:23,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 22:41:23,299 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 22:41:23,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:23,309 INFO L225 Difference]: With dead ends: 5114 [2021-10-05 22:41:23,309 INFO L226 Difference]: Without dead ends: 5106 [2021-10-05 22:41:23,309 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 346.7ms TimeCoverageRelationStatistics Valid=287, Invalid=835, Unknown=0, NotChecked=0, Total=1122 [2021-10-05 22:41:23,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5106 states. [2021-10-05 22:41:23,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5106 to 3794. [2021-10-05 22:41:23,373 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 22:41:23,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 11069 transitions. [2021-10-05 22:41:23,383 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 11069 transitions. Word has length 38 [2021-10-05 22:41:23,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:23,383 INFO L470 AbstractCegarLoop]: Abstraction has 3794 states and 11069 transitions. [2021-10-05 22:41:23,384 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 22:41:23,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 11069 transitions. [2021-10-05 22:41:23,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:23,391 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:23,391 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:23,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-10-05 22:41:23,391 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 22:41:23,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:23,392 INFO L82 PathProgramCache]: Analyzing trace with hash 443067449, now seen corresponding path program 64 times [2021-10-05 22:41:23,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:23,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307969903] [2021-10-05 22:41:23,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:23,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:23,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:23,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:23,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307969903] [2021-10-05 22:41:23,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307969903] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:23,517 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:23,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:23,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326248570] [2021-10-05 22:41:23,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:23,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:23,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:23,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:23,519 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 22:41:24,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:24,362 INFO L93 Difference]: Finished difference Result 5136 states and 14401 transitions. [2021-10-05 22:41:24,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-05 22:41:24,362 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 22:41:24,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:24,372 INFO L225 Difference]: With dead ends: 5136 [2021-10-05 22:41:24,373 INFO L226 Difference]: Without dead ends: 5116 [2021-10-05 22:41:24,373 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 352.6ms TimeCoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2021-10-05 22:41:24,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5116 states. [2021-10-05 22:41:24,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5116 to 3792. [2021-10-05 22:41:24,439 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 22:41:24,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 11064 transitions. [2021-10-05 22:41:24,448 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 11064 transitions. Word has length 38 [2021-10-05 22:41:24,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:24,449 INFO L470 AbstractCegarLoop]: Abstraction has 3792 states and 11064 transitions. [2021-10-05 22:41:24,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 22:41:24,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 11064 transitions. [2021-10-05 22:41:24,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:24,456 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:24,456 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:24,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-10-05 22:41:24,456 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 22:41:24,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:24,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1658542385, now seen corresponding path program 65 times [2021-10-05 22:41:24,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:24,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147711888] [2021-10-05 22:41:24,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:24,457 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:24,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:24,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147711888] [2021-10-05 22:41:24,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147711888] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:24,593 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:24,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:41:24,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428885776] [2021-10-05 22:41:24,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:41:24,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:24,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:41:24,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:41:24,595 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 22:41:25,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:25,643 INFO L93 Difference]: Finished difference Result 5070 states and 14261 transitions. [2021-10-05 22:41:25,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-10-05 22:41:25,643 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 22:41:25,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:25,653 INFO L225 Difference]: With dead ends: 5070 [2021-10-05 22:41:25,653 INFO L226 Difference]: Without dead ends: 5032 [2021-10-05 22:41:25,653 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 477.2ms TimeCoverageRelationStatistics Valid=408, Invalid=1484, Unknown=0, NotChecked=0, Total=1892 [2021-10-05 22:41:25,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5032 states. [2021-10-05 22:41:25,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5032 to 3776. [2021-10-05 22:41:25,716 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 22:41:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3776 states to 3776 states and 11036 transitions. [2021-10-05 22:41:25,725 INFO L78 Accepts]: Start accepts. Automaton has 3776 states and 11036 transitions. Word has length 38 [2021-10-05 22:41:25,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:25,725 INFO L470 AbstractCegarLoop]: Abstraction has 3776 states and 11036 transitions. [2021-10-05 22:41:25,725 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 22:41:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3776 states and 11036 transitions. [2021-10-05 22:41:25,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:25,731 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:25,732 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:25,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-10-05 22:41:25,732 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 22:41:25,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:25,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1915311487, now seen corresponding path program 66 times [2021-10-05 22:41:25,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:25,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715904968] [2021-10-05 22:41:25,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:25,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:25,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 22:41:25,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:25,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715904968] [2021-10-05 22:41:25,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715904968] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:25,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:25,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:41:25,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801449018] [2021-10-05 22:41:25,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:41:25,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:25,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:41:25,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:41:25,866 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 22:41:26,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:26,658 INFO L93 Difference]: Finished difference Result 4598 states and 12959 transitions. [2021-10-05 22:41:26,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-05 22:41:26,658 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 22:41:26,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:26,668 INFO L225 Difference]: With dead ends: 4598 [2021-10-05 22:41:26,668 INFO L226 Difference]: Without dead ends: 4414 [2021-10-05 22:41:26,668 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 301.6ms TimeCoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2021-10-05 22:41:26,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4414 states. [2021-10-05 22:41:26,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4414 to 3964. [2021-10-05 22:41:26,727 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 22:41:26,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3964 states to 3964 states and 11463 transitions. [2021-10-05 22:41:26,736 INFO L78 Accepts]: Start accepts. Automaton has 3964 states and 11463 transitions. Word has length 38 [2021-10-05 22:41:26,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:26,737 INFO L470 AbstractCegarLoop]: Abstraction has 3964 states and 11463 transitions. [2021-10-05 22:41:26,737 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 22:41:26,737 INFO L276 IsEmpty]: Start isEmpty. Operand 3964 states and 11463 transitions. [2021-10-05 22:41:26,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:26,743 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:26,743 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:26,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-10-05 22:41:26,744 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 22:41:26,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:26,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1061450289, now seen corresponding path program 67 times [2021-10-05 22:41:26,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:26,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452188557] [2021-10-05 22:41:26,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:26,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:26,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 22:41:26,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:26,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452188557] [2021-10-05 22:41:26,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452188557] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:26,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:26,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:41:26,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822320344] [2021-10-05 22:41:26,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:41:26,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:26,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:41:26,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:41:26,889 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 22:41:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:28,050 INFO L93 Difference]: Finished difference Result 4878 states and 13669 transitions. [2021-10-05 22:41:28,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-05 22:41:28,050 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 22:41:28,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:28,059 INFO L225 Difference]: With dead ends: 4878 [2021-10-05 22:41:28,059 INFO L226 Difference]: Without dead ends: 4676 [2021-10-05 22:41:28,060 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 449.0ms TimeCoverageRelationStatistics Valid=316, Invalid=1166, Unknown=0, NotChecked=0, Total=1482 [2021-10-05 22:41:28,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4676 states. [2021-10-05 22:41:28,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4676 to 3928. [2021-10-05 22:41:28,118 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 22:41:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 11361 transitions. [2021-10-05 22:41:28,127 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 11361 transitions. Word has length 38 [2021-10-05 22:41:28,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:28,127 INFO L470 AbstractCegarLoop]: Abstraction has 3928 states and 11361 transitions. [2021-10-05 22:41:28,127 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 22:41:28,128 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 11361 transitions. [2021-10-05 22:41:28,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:28,134 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:28,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 22:41:28,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-10-05 22:41:28,134 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 22:41:28,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:28,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1888338645, now seen corresponding path program 68 times [2021-10-05 22:41:28,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:28,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291157663] [2021-10-05 22:41:28,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:28,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:28,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:28,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:28,257 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291157663] [2021-10-05 22:41:28,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291157663] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:28,257 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:28,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:41:28,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111602627] [2021-10-05 22:41:28,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:41:28,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:28,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:41:28,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:41:28,258 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 22:41:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:29,244 INFO L93 Difference]: Finished difference Result 4734 states and 13210 transitions. [2021-10-05 22:41:29,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 22:41:29,245 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 22:41:29,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:29,254 INFO L225 Difference]: With dead ends: 4734 [2021-10-05 22:41:29,254 INFO L226 Difference]: Without dead ends: 4648 [2021-10-05 22:41:29,254 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 350.5ms TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2021-10-05 22:41:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4648 states. [2021-10-05 22:41:29,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4648 to 3928. [2021-10-05 22:41:29,312 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 22:41:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 11331 transitions. [2021-10-05 22:41:29,321 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 11331 transitions. Word has length 38 [2021-10-05 22:41:29,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:29,321 INFO L470 AbstractCegarLoop]: Abstraction has 3928 states and 11331 transitions. [2021-10-05 22:41:29,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 22:41:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 11331 transitions. [2021-10-05 22:41:29,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:29,328 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:29,328 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:29,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-10-05 22:41:29,328 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 22:41:29,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:29,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1744112931, now seen corresponding path program 69 times [2021-10-05 22:41:29,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:29,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497640886] [2021-10-05 22:41:29,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:29,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:29,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 22:41:29,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:29,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497640886] [2021-10-05 22:41:29,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497640886] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:29,453 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:29,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:41:29,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956346681] [2021-10-05 22:41:29,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:41:29,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:29,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:41:29,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:41:29,454 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 22:41:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:30,484 INFO L93 Difference]: Finished difference Result 4878 states and 13605 transitions. [2021-10-05 22:41:30,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-05 22:41:30,484 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 22:41:30,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:30,493 INFO L225 Difference]: With dead ends: 4878 [2021-10-05 22:41:30,494 INFO L226 Difference]: Without dead ends: 4822 [2021-10-05 22:41:30,494 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 384.7ms TimeCoverageRelationStatistics Valid=282, Invalid=1050, Unknown=0, NotChecked=0, Total=1332 [2021-10-05 22:41:30,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4822 states. [2021-10-05 22:41:30,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4822 to 3948. [2021-10-05 22:41:30,561 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 22:41:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 11368 transitions. [2021-10-05 22:41:30,570 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 11368 transitions. Word has length 38 [2021-10-05 22:41:30,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:30,570 INFO L470 AbstractCegarLoop]: Abstraction has 3948 states and 11368 transitions. [2021-10-05 22:41:30,571 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 22:41:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 11368 transitions. [2021-10-05 22:41:30,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:30,577 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:30,577 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:30,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-10-05 22:41:30,578 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 22:41:30,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:30,578 INFO L82 PathProgramCache]: Analyzing trace with hash -786109981, now seen corresponding path program 70 times [2021-10-05 22:41:30,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:30,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178045883] [2021-10-05 22:41:30,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:30,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:30,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:30,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178045883] [2021-10-05 22:41:30,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178045883] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:30,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:30,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:41:30,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500165233] [2021-10-05 22:41:30,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:41:30,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:30,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:41:30,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:41:30,703 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 22:41:31,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:31,597 INFO L93 Difference]: Finished difference Result 5320 states and 14725 transitions. [2021-10-05 22:41:31,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 22:41:31,597 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 22:41:31,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:31,608 INFO L225 Difference]: With dead ends: 5320 [2021-10-05 22:41:31,609 INFO L226 Difference]: Without dead ends: 5152 [2021-10-05 22:41:31,609 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 316.4ms TimeCoverageRelationStatistics Valid=261, Invalid=861, Unknown=0, NotChecked=0, Total=1122 [2021-10-05 22:41:31,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5152 states. [2021-10-05 22:41:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5152 to 3856. [2021-10-05 22:41:31,676 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 22:41:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3856 states to 3856 states and 11119 transitions. [2021-10-05 22:41:31,685 INFO L78 Accepts]: Start accepts. Automaton has 3856 states and 11119 transitions. Word has length 38 [2021-10-05 22:41:31,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:31,685 INFO L470 AbstractCegarLoop]: Abstraction has 3856 states and 11119 transitions. [2021-10-05 22:41:31,685 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 22:41:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3856 states and 11119 transitions. [2021-10-05 22:41:31,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:31,693 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:31,694 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:31,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-10-05 22:41:31,694 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 22:41:31,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:31,695 INFO L82 PathProgramCache]: Analyzing trace with hash -776678947, now seen corresponding path program 71 times [2021-10-05 22:41:31,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:31,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839454119] [2021-10-05 22:41:31,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:31,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:31,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:31,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:31,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839454119] [2021-10-05 22:41:31,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839454119] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:31,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:31,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:31,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381868336] [2021-10-05 22:41:31,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:31,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:31,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:31,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:31,825 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 22:41:32,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:32,481 INFO L93 Difference]: Finished difference Result 4172 states and 11800 transitions. [2021-10-05 22:41:32,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-05 22:41:32,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 22:41:32,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:32,490 INFO L225 Difference]: With dead ends: 4172 [2021-10-05 22:41:32,490 INFO L226 Difference]: Without dead ends: 4098 [2021-10-05 22:41:32,490 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 233.6ms TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2021-10-05 22:41:32,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2021-10-05 22:41:32,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3916. [2021-10-05 22:41:32,551 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 22:41:32,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3916 states to 3916 states and 11253 transitions. [2021-10-05 22:41:32,560 INFO L78 Accepts]: Start accepts. Automaton has 3916 states and 11253 transitions. Word has length 38 [2021-10-05 22:41:32,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:32,560 INFO L470 AbstractCegarLoop]: Abstraction has 3916 states and 11253 transitions. [2021-10-05 22:41:32,561 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 22:41:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3916 states and 11253 transitions. [2021-10-05 22:41:32,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:32,568 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:32,568 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:32,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-10-05 22:41:32,568 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 22:41:32,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:32,568 INFO L82 PathProgramCache]: Analyzing trace with hash 429124977, now seen corresponding path program 72 times [2021-10-05 22:41:32,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:32,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780288451] [2021-10-05 22:41:32,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:32,569 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:32,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:32,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780288451] [2021-10-05 22:41:32,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780288451] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:32,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:32,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:32,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609747974] [2021-10-05 22:41:32,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:32,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:32,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:32,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:32,693 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 22:41:33,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:33,510 INFO L93 Difference]: Finished difference Result 4322 states and 12224 transitions. [2021-10-05 22:41:33,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 22:41:33,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 22:41:33,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:33,519 INFO L225 Difference]: With dead ends: 4322 [2021-10-05 22:41:33,519 INFO L226 Difference]: Without dead ends: 4234 [2021-10-05 22:41:33,519 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 334.9ms TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2021-10-05 22:41:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2021-10-05 22:41:33,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3904. [2021-10-05 22:41:33,575 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 22:41:33,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3904 states to 3904 states and 11201 transitions. [2021-10-05 22:41:33,584 INFO L78 Accepts]: Start accepts. Automaton has 3904 states and 11201 transitions. Word has length 38 [2021-10-05 22:41:33,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:33,584 INFO L470 AbstractCegarLoop]: Abstraction has 3904 states and 11201 transitions. [2021-10-05 22:41:33,584 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 22:41:33,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3904 states and 11201 transitions. [2021-10-05 22:41:33,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:33,590 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:33,590 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:33,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-10-05 22:41:33,590 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 22:41:33,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:33,591 INFO L82 PathProgramCache]: Analyzing trace with hash -56852037, now seen corresponding path program 73 times [2021-10-05 22:41:33,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:33,591 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652690259] [2021-10-05 22:41:33,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:33,591 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:33,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:33,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:33,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652690259] [2021-10-05 22:41:33,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652690259] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:33,723 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:33,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:33,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117872610] [2021-10-05 22:41:33,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:33,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:33,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:33,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:33,725 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 22:41:34,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:34,481 INFO L93 Difference]: Finished difference Result 4500 states and 12633 transitions. [2021-10-05 22:41:34,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-10-05 22:41:34,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 22:41:34,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:34,489 INFO L225 Difference]: With dead ends: 4500 [2021-10-05 22:41:34,490 INFO L226 Difference]: Without dead ends: 4480 [2021-10-05 22:41:34,490 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 263.1ms TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2021-10-05 22:41:34,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4480 states. [2021-10-05 22:41:34,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4480 to 3904. [2021-10-05 22:41:34,549 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 22:41:34,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3904 states to 3904 states and 11191 transitions. [2021-10-05 22:41:34,558 INFO L78 Accepts]: Start accepts. Automaton has 3904 states and 11191 transitions. Word has length 38 [2021-10-05 22:41:34,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:34,558 INFO L470 AbstractCegarLoop]: Abstraction has 3904 states and 11191 transitions. [2021-10-05 22:41:34,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 22:41:34,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3904 states and 11191 transitions. [2021-10-05 22:41:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:34,564 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:34,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 22:41:34,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-10-05 22:41:34,565 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 22:41:34,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:34,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1939275149, now seen corresponding path program 74 times [2021-10-05 22:41:34,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:34,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353663297] [2021-10-05 22:41:34,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:34,566 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:34,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:34,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353663297] [2021-10-05 22:41:34,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353663297] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:34,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:34,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:34,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178893122] [2021-10-05 22:41:34,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:34,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:34,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:34,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:34,680 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 22:41:35,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:35,471 INFO L93 Difference]: Finished difference Result 5132 states and 14261 transitions. [2021-10-05 22:41:35,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-10-05 22:41:35,471 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 22:41:35,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:35,482 INFO L225 Difference]: With dead ends: 5132 [2021-10-05 22:41:35,482 INFO L226 Difference]: Without dead ends: 5124 [2021-10-05 22:41:35,482 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 300.0ms TimeCoverageRelationStatistics Valid=228, Invalid=642, Unknown=0, NotChecked=0, Total=870 [2021-10-05 22:41:35,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5124 states. [2021-10-05 22:41:35,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5124 to 3906. [2021-10-05 22:41:35,545 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 22:41:35,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3906 states to 3906 states and 11190 transitions. [2021-10-05 22:41:35,554 INFO L78 Accepts]: Start accepts. Automaton has 3906 states and 11190 transitions. Word has length 38 [2021-10-05 22:41:35,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:35,554 INFO L470 AbstractCegarLoop]: Abstraction has 3906 states and 11190 transitions. [2021-10-05 22:41:35,554 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 22:41:35,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3906 states and 11190 transitions. [2021-10-05 22:41:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:35,560 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:35,560 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:35,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-10-05 22:41:35,561 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 22:41:35,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:35,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1218104221, now seen corresponding path program 75 times [2021-10-05 22:41:35,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:35,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240587403] [2021-10-05 22:41:35,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:35,562 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:35,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:35,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240587403] [2021-10-05 22:41:35,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240587403] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:35,673 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:35,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:35,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036306160] [2021-10-05 22:41:35,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:35,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:35,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:35,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:35,675 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 22:41:36,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:36,571 INFO L93 Difference]: Finished difference Result 4644 states and 13024 transitions. [2021-10-05 22:41:36,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-10-05 22:41:36,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 22:41:36,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:36,580 INFO L225 Difference]: With dead ends: 4644 [2021-10-05 22:41:36,580 INFO L226 Difference]: Without dead ends: 4602 [2021-10-05 22:41:36,581 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 302.5ms TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2021-10-05 22:41:36,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4602 states. [2021-10-05 22:41:36,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4602 to 3874. [2021-10-05 22:41:36,639 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 22:41:36,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3874 states to 3874 states and 11114 transitions. [2021-10-05 22:41:36,648 INFO L78 Accepts]: Start accepts. Automaton has 3874 states and 11114 transitions. Word has length 38 [2021-10-05 22:41:36,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:36,648 INFO L470 AbstractCegarLoop]: Abstraction has 3874 states and 11114 transitions. [2021-10-05 22:41:36,648 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 22:41:36,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3874 states and 11114 transitions. [2021-10-05 22:41:36,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:36,654 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:36,654 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:36,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-10-05 22:41:36,654 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 22:41:36,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:36,655 INFO L82 PathProgramCache]: Analyzing trace with hash -270768385, now seen corresponding path program 76 times [2021-10-05 22:41:36,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:36,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413858961] [2021-10-05 22:41:36,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:36,655 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:36,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:36,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413858961] [2021-10-05 22:41:36,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413858961] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:36,775 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:36,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:36,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281161841] [2021-10-05 22:41:36,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:36,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:36,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:36,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:36,777 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 22:41:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:37,615 INFO L93 Difference]: Finished difference Result 4380 states and 12433 transitions. [2021-10-05 22:41:37,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 22:41:37,616 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 22:41:37,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:37,624 INFO L225 Difference]: With dead ends: 4380 [2021-10-05 22:41:37,624 INFO L226 Difference]: Without dead ends: 4312 [2021-10-05 22:41:37,625 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 380.8ms TimeCoverageRelationStatistics Valid=293, Invalid=897, Unknown=0, NotChecked=0, Total=1190 [2021-10-05 22:41:37,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4312 states. [2021-10-05 22:41:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4312 to 3838. [2021-10-05 22:41:37,686 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 22:41:37,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3838 states to 3838 states and 11018 transitions. [2021-10-05 22:41:37,695 INFO L78 Accepts]: Start accepts. Automaton has 3838 states and 11018 transitions. Word has length 38 [2021-10-05 22:41:37,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:37,695 INFO L470 AbstractCegarLoop]: Abstraction has 3838 states and 11018 transitions. [2021-10-05 22:41:37,696 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 22:41:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3838 states and 11018 transitions. [2021-10-05 22:41:37,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:37,703 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:37,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 22:41:37,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-10-05 22:41:37,703 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 22:41:37,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:37,704 INFO L82 PathProgramCache]: Analyzing trace with hash 660473423, now seen corresponding path program 77 times [2021-10-05 22:41:37,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:37,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325476253] [2021-10-05 22:41:37,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:37,704 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:37,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 22:41:37,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:37,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325476253] [2021-10-05 22:41:37,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325476253] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:37,837 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:37,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:41:37,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007136575] [2021-10-05 22:41:37,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:41:37,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:37,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:41:37,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:41:37,838 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 22:41:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:38,785 INFO L93 Difference]: Finished difference Result 4644 states and 13106 transitions. [2021-10-05 22:41:38,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 22:41:38,785 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 22:41:38,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:38,795 INFO L225 Difference]: With dead ends: 4644 [2021-10-05 22:41:38,795 INFO L226 Difference]: Without dead ends: 4560 [2021-10-05 22:41:38,795 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 386.4ms TimeCoverageRelationStatistics Valid=255, Invalid=935, Unknown=0, NotChecked=0, Total=1190 [2021-10-05 22:41:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4560 states. [2021-10-05 22:41:38,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4560 to 3742. [2021-10-05 22:41:38,859 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 22:41:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 10772 transitions. [2021-10-05 22:41:38,868 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 10772 transitions. Word has length 38 [2021-10-05 22:41:38,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:38,868 INFO L470 AbstractCegarLoop]: Abstraction has 3742 states and 10772 transitions. [2021-10-05 22:41:38,868 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 22:41:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 10772 transitions. [2021-10-05 22:41:38,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:38,875 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:38,875 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:38,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-10-05 22:41:38,875 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 22:41:38,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:38,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1343504207, now seen corresponding path program 78 times [2021-10-05 22:41:38,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:38,876 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859753597] [2021-10-05 22:41:38,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:38,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:39,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:39,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859753597] [2021-10-05 22:41:39,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859753597] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:39,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:39,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:41:39,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839437105] [2021-10-05 22:41:39,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:41:39,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:39,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:41:39,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:41:39,015 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 22:41:39,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:39,657 INFO L93 Difference]: Finished difference Result 4500 states and 12692 transitions. [2021-10-05 22:41:39,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-05 22:41:39,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 22:41:39,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:39,667 INFO L225 Difference]: With dead ends: 4500 [2021-10-05 22:41:39,667 INFO L226 Difference]: Without dead ends: 4492 [2021-10-05 22:41:39,667 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 228.2ms TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2021-10-05 22:41:39,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4492 states. [2021-10-05 22:41:39,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4492 to 3742. [2021-10-05 22:41:39,727 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 22:41:39,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 10770 transitions. [2021-10-05 22:41:39,739 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 10770 transitions. Word has length 38 [2021-10-05 22:41:39,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:39,739 INFO L470 AbstractCegarLoop]: Abstraction has 3742 states and 10770 transitions. [2021-10-05 22:41:39,739 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 22:41:39,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 10770 transitions. [2021-10-05 22:41:39,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:39,746 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:39,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 22:41:39,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-10-05 22:41:39,747 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 22:41:39,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:39,747 INFO L82 PathProgramCache]: Analyzing trace with hash 2064675135, now seen corresponding path program 79 times [2021-10-05 22:41:39,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:39,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712256234] [2021-10-05 22:41:39,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:39,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41: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 22:41:39,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:39,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712256234] [2021-10-05 22:41:39,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712256234] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:39,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:39,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:39,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063028015] [2021-10-05 22:41:39,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:39,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:39,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:39,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:39,867 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 22:41:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:40,616 INFO L93 Difference]: Finished difference Result 4536 states and 12777 transitions. [2021-10-05 22:41:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 22:41:40,617 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 22:41:40,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:40,630 INFO L225 Difference]: With dead ends: 4536 [2021-10-05 22:41:40,631 INFO L226 Difference]: Without dead ends: 4528 [2021-10-05 22:41:40,631 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 292.4ms TimeCoverageRelationStatistics Valid=236, Invalid=756, Unknown=0, NotChecked=0, Total=992 [2021-10-05 22:41:40,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4528 states. [2021-10-05 22:41:40,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4528 to 3740. [2021-10-05 22:41:40,718 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 22:41:40,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 10765 transitions. [2021-10-05 22:41:40,732 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 10765 transitions. Word has length 38 [2021-10-05 22:41:40,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:40,733 INFO L470 AbstractCegarLoop]: Abstraction has 3740 states and 10765 transitions. [2021-10-05 22:41:40,733 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 22:41:40,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 10765 transitions. [2021-10-05 22:41:40,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:40,740 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:40,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 22:41:40,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-10-05 22:41:40,741 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 22:41:40,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:40,742 INFO L82 PathProgramCache]: Analyzing trace with hash 216005263, now seen corresponding path program 80 times [2021-10-05 22:41:40,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:40,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189400368] [2021-10-05 22:41:40,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:40,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:40,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:40,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:40,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189400368] [2021-10-05 22:41:40,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189400368] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:40,857 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:40,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:41:40,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924916476] [2021-10-05 22:41:40,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:41:40,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:40,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:41:40,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:41:40,858 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 22:41:41,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:41,460 INFO L93 Difference]: Finished difference Result 4558 states and 12780 transitions. [2021-10-05 22:41:41,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-05 22:41:41,461 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 22:41:41,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:41,476 INFO L225 Difference]: With dead ends: 4558 [2021-10-05 22:41:41,476 INFO L226 Difference]: Without dead ends: 4550 [2021-10-05 22:41:41,477 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 206.2ms TimeCoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2021-10-05 22:41:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2021-10-05 22:41:41,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 3736. [2021-10-05 22:41:41,555 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 22:41:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3736 states to 3736 states and 10756 transitions. [2021-10-05 22:41:41,563 INFO L78 Accepts]: Start accepts. Automaton has 3736 states and 10756 transitions. Word has length 38 [2021-10-05 22:41:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:41,564 INFO L470 AbstractCegarLoop]: Abstraction has 3736 states and 10756 transitions. [2021-10-05 22:41:41,564 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 22:41:41,564 INFO L276 IsEmpty]: Start isEmpty. Operand 3736 states and 10756 transitions. [2021-10-05 22:41:41,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:41,570 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:41,570 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:41,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-10-05 22:41:41,571 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 22:41:41,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:41,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1593046721, now seen corresponding path program 81 times [2021-10-05 22:41:41,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:41,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75258974] [2021-10-05 22:41:41,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:41,572 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:41,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:41,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75258974] [2021-10-05 22:41:41,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75258974] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:41,698 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:41,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:41,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975373661] [2021-10-05 22:41:41,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:41,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:41,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:41,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:41,700 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 22:41:42,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:42,350 INFO L93 Difference]: Finished difference Result 4592 states and 12861 transitions. [2021-10-05 22:41:42,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-05 22:41:42,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 22:41:42,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:42,359 INFO L225 Difference]: With dead ends: 4592 [2021-10-05 22:41:42,360 INFO L226 Difference]: Without dead ends: 4564 [2021-10-05 22:41:42,360 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 226.2ms TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2021-10-05 22:41:42,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4564 states. [2021-10-05 22:41:42,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4564 to 3736. [2021-10-05 22:41:42,421 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 22:41:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3736 states to 3736 states and 10752 transitions. [2021-10-05 22:41:42,429 INFO L78 Accepts]: Start accepts. Automaton has 3736 states and 10752 transitions. Word has length 38 [2021-10-05 22:41:42,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:42,429 INFO L470 AbstractCegarLoop]: Abstraction has 3736 states and 10752 transitions. [2021-10-05 22:41:42,430 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 22:41:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3736 states and 10752 transitions. [2021-10-05 22:41:42,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:42,436 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:42,436 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:42,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-10-05 22:41:42,436 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 22:41:42,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:42,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1818638479, now seen corresponding path program 82 times [2021-10-05 22:41:42,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:42,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029454346] [2021-10-05 22:41:42,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:42,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:42,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:42,567 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029454346] [2021-10-05 22:41:42,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029454346] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:42,567 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:42,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:41:42,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131045674] [2021-10-05 22:41:42,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:41:42,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:42,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:41:42,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:41:42,569 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 22:41:43,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:43,433 INFO L93 Difference]: Finished difference Result 4562 states and 12836 transitions. [2021-10-05 22:41:43,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-05 22:41:43,433 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 22:41:43,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:43,442 INFO L225 Difference]: With dead ends: 4562 [2021-10-05 22:41:43,442 INFO L226 Difference]: Without dead ends: 4488 [2021-10-05 22:41:43,443 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 358.8ms TimeCoverageRelationStatistics Valid=257, Invalid=933, Unknown=0, NotChecked=0, Total=1190 [2021-10-05 22:41:43,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4488 states. [2021-10-05 22:41:43,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4488 to 3686. [2021-10-05 22:41:43,505 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 22:41:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 10631 transitions. [2021-10-05 22:41:43,514 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 10631 transitions. Word has length 38 [2021-10-05 22:41:43,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:43,514 INFO L470 AbstractCegarLoop]: Abstraction has 3686 states and 10631 transitions. [2021-10-05 22:41:43,514 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 22:41:43,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 10631 transitions. [2021-10-05 22:41:43,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:43,521 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:43,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 22:41:43,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-10-05 22:41:43,521 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 22:41:43,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:43,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1288228103, now seen corresponding path program 83 times [2021-10-05 22:41:43,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:43,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39298526] [2021-10-05 22:41:43,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:43,522 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:43,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 22:41:43,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:43,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39298526] [2021-10-05 22:41:43,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39298526] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:43,622 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:43,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:43,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715369870] [2021-10-05 22:41:43,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:43,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:43,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:43,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:43,623 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 22:41:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:44,273 INFO L93 Difference]: Finished difference Result 3858 states and 10993 transitions. [2021-10-05 22:41:44,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-05 22:41:44,273 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 22:41:44,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:44,281 INFO L225 Difference]: With dead ends: 3858 [2021-10-05 22:41:44,281 INFO L226 Difference]: Without dead ends: 3806 [2021-10-05 22:41:44,282 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 207.2ms TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2021-10-05 22:41:44,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3806 states. [2021-10-05 22:41:44,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3806 to 3686. [2021-10-05 22:41:44,337 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 22:41:44,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 10609 transitions. [2021-10-05 22:41:44,345 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 10609 transitions. Word has length 38 [2021-10-05 22:41:44,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:44,346 INFO L470 AbstractCegarLoop]: Abstraction has 3686 states and 10609 transitions. [2021-10-05 22:41:44,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 22:41:44,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 10609 transitions. [2021-10-05 22:41:44,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:44,352 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:44,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 22:41:44,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-10-05 22:41:44,353 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 22:41:44,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:44,353 INFO L82 PathProgramCache]: Analyzing trace with hash -82424179, now seen corresponding path program 84 times [2021-10-05 22:41:44,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:44,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367323652] [2021-10-05 22:41:44,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:44,354 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:44,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:44,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:44,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367323652] [2021-10-05 22:41:44,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367323652] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:44,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:44,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:44,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793787925] [2021-10-05 22:41:44,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:44,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:44,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:44,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:44,461 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 22:41:45,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:45,291 INFO L93 Difference]: Finished difference Result 4424 states and 12371 transitions. [2021-10-05 22:41:45,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-10-05 22:41:45,291 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 22:41:45,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:45,299 INFO L225 Difference]: With dead ends: 4424 [2021-10-05 22:41:45,299 INFO L226 Difference]: Without dead ends: 4354 [2021-10-05 22:41:45,299 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 266.0ms TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2021-10-05 22:41:45,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4354 states. [2021-10-05 22:41:45,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4354 to 3668. [2021-10-05 22:41:45,356 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 22:41:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 10536 transitions. [2021-10-05 22:41:45,364 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 10536 transitions. Word has length 38 [2021-10-05 22:41:45,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:45,365 INFO L470 AbstractCegarLoop]: Abstraction has 3668 states and 10536 transitions. [2021-10-05 22:41:45,365 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 22:41:45,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 10536 transitions. [2021-10-05 22:41:45,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:45,371 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:45,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 22:41:45,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-10-05 22:41:45,372 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 22:41:45,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:45,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1546346279, now seen corresponding path program 85 times [2021-10-05 22:41:45,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:45,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974516443] [2021-10-05 22:41:45,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:45,373 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:45,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:45,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:45,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974516443] [2021-10-05 22:41:45,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974516443] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:45,482 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:45,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:45,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274511639] [2021-10-05 22:41:45,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:45,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:45,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:45,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:45,486 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 22:41:46,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:46,257 INFO L93 Difference]: Finished difference Result 4828 states and 13445 transitions. [2021-10-05 22:41:46,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 22:41:46,258 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 22:41:46,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:46,266 INFO L225 Difference]: With dead ends: 4828 [2021-10-05 22:41:46,267 INFO L226 Difference]: Without dead ends: 4820 [2021-10-05 22:41:46,267 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 272.2ms TimeCoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2021-10-05 22:41:46,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4820 states. [2021-10-05 22:41:46,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4820 to 3670. [2021-10-05 22:41:46,327 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 22:41:46,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3670 states to 3670 states and 10535 transitions. [2021-10-05 22:41:46,336 INFO L78 Accepts]: Start accepts. Automaton has 3670 states and 10535 transitions. Word has length 38 [2021-10-05 22:41:46,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:46,336 INFO L470 AbstractCegarLoop]: Abstraction has 3670 states and 10535 transitions. [2021-10-05 22:41:46,336 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 22:41:46,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3670 states and 10535 transitions. [2021-10-05 22:41:46,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:46,343 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:46,343 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:46,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-10-05 22:41:46,343 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 22:41:46,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:46,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1351914315, now seen corresponding path program 86 times [2021-10-05 22:41:46,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:46,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404413811] [2021-10-05 22:41:46,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:46,344 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:46,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 22:41:46,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:46,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404413811] [2021-10-05 22:41:46,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404413811] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:46,458 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:46,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:46,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693987223] [2021-10-05 22:41:46,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:46,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:46,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:46,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:46,460 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 22:41:47,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:47,278 INFO L93 Difference]: Finished difference Result 4414 states and 12408 transitions. [2021-10-05 22:41:47,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 22:41:47,279 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 22:41:47,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:47,288 INFO L225 Difference]: With dead ends: 4414 [2021-10-05 22:41:47,288 INFO L226 Difference]: Without dead ends: 4356 [2021-10-05 22:41:47,288 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 297.0ms TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2021-10-05 22:41:47,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4356 states. [2021-10-05 22:41:47,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4356 to 3622. [2021-10-05 22:41:47,347 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 22:41:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 10423 transitions. [2021-10-05 22:41:47,356 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 10423 transitions. Word has length 38 [2021-10-05 22:41:47,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:47,356 INFO L470 AbstractCegarLoop]: Abstraction has 3622 states and 10423 transitions. [2021-10-05 22:41:47,356 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 22:41:47,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 10423 transitions. [2021-10-05 22:41:47,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:47,362 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:47,362 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:47,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-10-05 22:41:47,362 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 22:41:47,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:47,363 INFO L82 PathProgramCache]: Analyzing trace with hash 561007835, now seen corresponding path program 87 times [2021-10-05 22:41:47,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:47,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61170960] [2021-10-05 22:41:47,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:47,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:47,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:47,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61170960] [2021-10-05 22:41:47,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61170960] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:47,490 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:47,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:41:47,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335909173] [2021-10-05 22:41:47,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:41:47,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:47,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:41:47,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:41:47,491 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 22:41:48,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:48,345 INFO L93 Difference]: Finished difference Result 4364 states and 12167 transitions. [2021-10-05 22:41:48,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 22:41:48,345 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 22:41:48,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:48,354 INFO L225 Difference]: With dead ends: 4364 [2021-10-05 22:41:48,355 INFO L226 Difference]: Without dead ends: 4190 [2021-10-05 22:41:48,355 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 292.0ms TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2021-10-05 22:41:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2021-10-05 22:41:48,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 3730. [2021-10-05 22:41:48,409 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 22:41:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3730 states to 3730 states and 10668 transitions. [2021-10-05 22:41:48,417 INFO L78 Accepts]: Start accepts. Automaton has 3730 states and 10668 transitions. Word has length 38 [2021-10-05 22:41:48,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:48,417 INFO L470 AbstractCegarLoop]: Abstraction has 3730 states and 10668 transitions. [2021-10-05 22:41:48,417 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 22:41:48,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3730 states and 10668 transitions. [2021-10-05 22:41:48,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:48,423 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:48,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 22:41:48,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-10-05 22:41:48,424 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 22:41:48,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:48,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1470070587, now seen corresponding path program 88 times [2021-10-05 22:41:48,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:48,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249308902] [2021-10-05 22:41:48,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:48,425 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:48,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:48,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249308902] [2021-10-05 22:41:48,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249308902] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:48,549 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:48,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:41:48,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229491258] [2021-10-05 22:41:48,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:41:48,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:48,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:41:48,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:41:48,551 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 22:41:49,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:49,594 INFO L93 Difference]: Finished difference Result 4632 states and 12900 transitions. [2021-10-05 22:41:49,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-10-05 22:41:49,595 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 22:41:49,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:49,603 INFO L225 Difference]: With dead ends: 4632 [2021-10-05 22:41:49,603 INFO L226 Difference]: Without dead ends: 4452 [2021-10-05 22:41:49,604 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 361.4ms TimeCoverageRelationStatistics Valid=249, Invalid=941, Unknown=0, NotChecked=0, Total=1190 [2021-10-05 22:41:49,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4452 states. [2021-10-05 22:41:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4452 to 3696. [2021-10-05 22:41:49,659 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 22:41:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 10569 transitions. [2021-10-05 22:41:49,667 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 10569 transitions. Word has length 38 [2021-10-05 22:41:49,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:49,668 INFO L470 AbstractCegarLoop]: Abstraction has 3696 states and 10569 transitions. [2021-10-05 22:41:49,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 22:41:49,668 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 10569 transitions. [2021-10-05 22:41:49,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:49,674 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:49,674 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:49,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-10-05 22:41:49,674 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 22:41:49,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:49,674 INFO L82 PathProgramCache]: Analyzing trace with hash -397895175, now seen corresponding path program 89 times [2021-10-05 22:41:49,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:49,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724379845] [2021-10-05 22:41:49,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:49,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:49,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:49,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724379845] [2021-10-05 22:41:49,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724379845] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:49,802 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:49,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:41:49,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995070084] [2021-10-05 22:41:49,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:41:49,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:49,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:41:49,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:41:49,804 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 22:41:50,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:50,532 INFO L93 Difference]: Finished difference Result 4462 states and 12396 transitions. [2021-10-05 22:41:50,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-10-05 22:41:50,532 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 22:41:50,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:50,544 INFO L225 Difference]: With dead ends: 4462 [2021-10-05 22:41:50,544 INFO L226 Difference]: Without dead ends: 4382 [2021-10-05 22:41:50,545 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 241.5ms TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2021-10-05 22:41:50,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4382 states. [2021-10-05 22:41:50,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4382 to 3696. [2021-10-05 22:41:50,625 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 22:41:50,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 10539 transitions. [2021-10-05 22:41:50,637 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 10539 transitions. Word has length 38 [2021-10-05 22:41:50,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:50,637 INFO L470 AbstractCegarLoop]: Abstraction has 3696 states and 10539 transitions. [2021-10-05 22:41:50,638 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 22:41:50,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 10539 transitions. [2021-10-05 22:41:50,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:50,647 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:50,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 22:41:50,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-10-05 22:41:50,647 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 22:41:50,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:50,648 INFO L82 PathProgramCache]: Analyzing trace with hash -610538749, now seen corresponding path program 90 times [2021-10-05 22:41:50,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:50,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660676217] [2021-10-05 22:41:50,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:50,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:50,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:50,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660676217] [2021-10-05 22:41:50,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660676217] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:50,778 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:50,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:41:50,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106540168] [2021-10-05 22:41:50,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:41:50,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:50,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:41:50,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:41:50,780 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 22:41:51,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:51,723 INFO L93 Difference]: Finished difference Result 4572 states and 12691 transitions. [2021-10-05 22:41:51,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-10-05 22:41:51,723 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 22:41:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:51,732 INFO L225 Difference]: With dead ends: 4572 [2021-10-05 22:41:51,732 INFO L226 Difference]: Without dead ends: 4522 [2021-10-05 22:41:51,733 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 342.6ms TimeCoverageRelationStatistics Valid=251, Invalid=939, Unknown=0, NotChecked=0, Total=1190 [2021-10-05 22:41:51,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4522 states. [2021-10-05 22:41:51,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4522 to 3710. [2021-10-05 22:41:51,793 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 22:41:51,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 10564 transitions. [2021-10-05 22:41:51,802 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 10564 transitions. Word has length 38 [2021-10-05 22:41:51,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:51,802 INFO L470 AbstractCegarLoop]: Abstraction has 3710 states and 10564 transitions. [2021-10-05 22:41:51,802 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 22:41:51,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 10564 transitions. [2021-10-05 22:41:51,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:51,809 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:51,809 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:51,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-10-05 22:41:51,809 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 22:41:51,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:51,809 INFO L82 PathProgramCache]: Analyzing trace with hash -241352503, now seen corresponding path program 91 times [2021-10-05 22:41:51,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:51,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014859492] [2021-10-05 22:41:51,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:51,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:51,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 22:41:51,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:51,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014859492] [2021-10-05 22:41:51,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014859492] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:51,925 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:51,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:41:51,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679964159] [2021-10-05 22:41:51,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:41:51,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:51,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:41:51,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:41:51,927 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 22:41:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:52,722 INFO L93 Difference]: Finished difference Result 4886 states and 13501 transitions. [2021-10-05 22:41:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 22:41:52,723 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 22:41:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:52,734 INFO L225 Difference]: With dead ends: 4886 [2021-10-05 22:41:52,734 INFO L226 Difference]: Without dead ends: 4778 [2021-10-05 22:41:52,735 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 267.9ms TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2021-10-05 22:41:52,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4778 states. [2021-10-05 22:41:52,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4778 to 3656. [2021-10-05 22:41:52,793 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 22:41:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 10431 transitions. [2021-10-05 22:41:52,801 INFO L78 Accepts]: Start accepts. Automaton has 3656 states and 10431 transitions. Word has length 38 [2021-10-05 22:41:52,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:52,801 INFO L470 AbstractCegarLoop]: Abstraction has 3656 states and 10431 transitions. [2021-10-05 22:41:52,801 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 22:41:52,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3656 states and 10431 transitions. [2021-10-05 22:41:52,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:52,807 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:52,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 22:41:52,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-10-05 22:41:52,807 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 22:41:52,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:52,808 INFO L82 PathProgramCache]: Analyzing trace with hash 492027739, now seen corresponding path program 92 times [2021-10-05 22:41:52,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:52,808 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763001364] [2021-10-05 22:41:52,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:52,808 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:52,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 22:41:52,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:52,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763001364] [2021-10-05 22:41:52,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763001364] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:52,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:52,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:52,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901631195] [2021-10-05 22:41:52,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:52,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:52,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:52,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:52,946 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 22:41:53,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:53,752 INFO L93 Difference]: Finished difference Result 4108 states and 11691 transitions. [2021-10-05 22:41:53,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-10-05 22:41:53,752 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 22:41:53,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:53,761 INFO L225 Difference]: With dead ends: 4108 [2021-10-05 22:41:53,761 INFO L226 Difference]: Without dead ends: 4080 [2021-10-05 22:41:53,761 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 343.8ms TimeCoverageRelationStatistics Valid=220, Invalid=650, Unknown=0, NotChecked=0, Total=870 [2021-10-05 22:41:53,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4080 states. [2021-10-05 22:41:53,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4080 to 3648. [2021-10-05 22:41:53,815 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 22:41:53,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 10407 transitions. [2021-10-05 22:41:53,824 INFO L78 Accepts]: Start accepts. Automaton has 3648 states and 10407 transitions. Word has length 38 [2021-10-05 22:41:53,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:53,824 INFO L470 AbstractCegarLoop]: Abstraction has 3648 states and 10407 transitions. [2021-10-05 22:41:53,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 22:41:53,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3648 states and 10407 transitions. [2021-10-05 22:41:53,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:53,830 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:53,830 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:53,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-10-05 22:41:53,830 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 22:41:53,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:53,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1550112689, now seen corresponding path program 93 times [2021-10-05 22:41:53,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:53,831 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819465841] [2021-10-05 22:41:53,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:53,832 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:53,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 22:41:53,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:53,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819465841] [2021-10-05 22:41:53,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819465841] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:53,971 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:53,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:41:53,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518022783] [2021-10-05 22:41:53,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:41:53,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:53,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:41:53,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:41:53,972 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 22:41:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:54,872 INFO L93 Difference]: Finished difference Result 4470 states and 12563 transitions. [2021-10-05 22:41:54,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 22:41:54,873 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 22:41:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:54,881 INFO L225 Difference]: With dead ends: 4470 [2021-10-05 22:41:54,881 INFO L226 Difference]: Without dead ends: 4398 [2021-10-05 22:41:54,881 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 347.8ms TimeCoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2021-10-05 22:41:54,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4398 states. [2021-10-05 22:41:54,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4398 to 3572. [2021-10-05 22:41:54,968 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 22:41:54,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 10211 transitions. [2021-10-05 22:41:54,976 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 10211 transitions. Word has length 38 [2021-10-05 22:41:54,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:54,976 INFO L470 AbstractCegarLoop]: Abstraction has 3572 states and 10211 transitions. [2021-10-05 22:41:54,976 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 22:41:54,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 10211 transitions. [2021-10-05 22:41:54,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:54,982 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:54,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 22:41:54,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-10-05 22:41:54,982 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 22:41:54,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:54,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1298485897, now seen corresponding path program 94 times [2021-10-05 22:41:54,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:54,983 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589877012] [2021-10-05 22:41:54,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:54,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:55,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:55,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:55,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589877012] [2021-10-05 22:41:55,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589877012] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:55,094 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:55,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:41:55,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027639715] [2021-10-05 22:41:55,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:41:55,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:55,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:41:55,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:41:55,096 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 22:41:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:55,662 INFO L93 Difference]: Finished difference Result 4252 states and 11961 transitions. [2021-10-05 22:41:55,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-05 22:41:55,663 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 22:41:55,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:55,670 INFO L225 Difference]: With dead ends: 4252 [2021-10-05 22:41:55,671 INFO L226 Difference]: Without dead ends: 4244 [2021-10-05 22:41:55,671 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 191.2ms TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2021-10-05 22:41:55,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4244 states. [2021-10-05 22:41:55,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4244 to 3572. [2021-10-05 22:41:55,721 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 22:41:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 10209 transitions. [2021-10-05 22:41:55,730 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 10209 transitions. Word has length 38 [2021-10-05 22:41:55,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:55,730 INFO L470 AbstractCegarLoop]: Abstraction has 3572 states and 10209 transitions. [2021-10-05 22:41:55,730 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 22:41:55,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 10209 transitions. [2021-10-05 22:41:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:55,736 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:55,736 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:55,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-10-05 22:41:55,737 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 22:41:55,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:55,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1492917861, now seen corresponding path program 95 times [2021-10-05 22:41:55,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:55,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555779976] [2021-10-05 22:41:55,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:55,738 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:55,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:55,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555779976] [2021-10-05 22:41:55,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555779976] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:55,860 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:55,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:55,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218230273] [2021-10-05 22:41:55,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:55,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:55,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:55,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:55,862 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 22:41:56,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:56,541 INFO L93 Difference]: Finished difference Result 4282 states and 12030 transitions. [2021-10-05 22:41:56,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-10-05 22:41:56,542 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 22:41:56,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:56,550 INFO L225 Difference]: With dead ends: 4282 [2021-10-05 22:41:56,550 INFO L226 Difference]: Without dead ends: 4274 [2021-10-05 22:41:56,550 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 271.7ms TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2021-10-05 22:41:56,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4274 states. [2021-10-05 22:41:56,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4274 to 3570. [2021-10-05 22:41:56,606 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 22:41:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 3570 states and 10204 transitions. [2021-10-05 22:41:56,615 INFO L78 Accepts]: Start accepts. Automaton has 3570 states and 10204 transitions. Word has length 38 [2021-10-05 22:41:56,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:56,616 INFO L470 AbstractCegarLoop]: Abstraction has 3570 states and 10204 transitions. [2021-10-05 22:41:56,616 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 22:41:56,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3570 states and 10204 transitions. [2021-10-05 22:41:56,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:56,622 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:56,623 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:56,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-10-05 22:41:56,623 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 22:41:56,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:56,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1556353137, now seen corresponding path program 96 times [2021-10-05 22:41:56,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:56,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032138039] [2021-10-05 22:41:56,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:56,624 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:56,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 22:41:56,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:56,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032138039] [2021-10-05 22:41:56,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032138039] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:56,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:56,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:41:56,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096664597] [2021-10-05 22:41:56,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:41:56,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:56,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:41:56,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:41:56,728 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 22:41:57,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:57,301 INFO L93 Difference]: Finished difference Result 4296 states and 12024 transitions. [2021-10-05 22:41:57,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-05 22:41:57,301 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 22:41:57,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:57,309 INFO L225 Difference]: With dead ends: 4296 [2021-10-05 22:41:57,309 INFO L226 Difference]: Without dead ends: 4288 [2021-10-05 22:41:57,310 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 176.3ms TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2021-10-05 22:41:57,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2021-10-05 22:41:57,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 3572. [2021-10-05 22:41:57,361 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 22:41:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 10207 transitions. [2021-10-05 22:41:57,369 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 10207 transitions. Word has length 38 [2021-10-05 22:41:57,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:57,370 INFO L470 AbstractCegarLoop]: Abstraction has 3572 states and 10207 transitions. [2021-10-05 22:41:57,370 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 22:41:57,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 10207 transitions. [2021-10-05 22:41:57,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:57,375 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:57,375 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:57,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-10-05 22:41:57,376 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 22:41:57,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:57,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1731107419, now seen corresponding path program 97 times [2021-10-05 22:41:57,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:57,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186585752] [2021-10-05 22:41:57,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:57,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:57,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:57,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:57,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186585752] [2021-10-05 22:41:57,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186585752] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:57,487 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:57,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:41:57,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447551750] [2021-10-05 22:41:57,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:41:57,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:57,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:41:57,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:41:57,489 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 22:41:58,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:58,142 INFO L93 Difference]: Finished difference Result 4370 states and 12182 transitions. [2021-10-05 22:41:58,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-05 22:41:58,142 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 22:41:58,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:58,150 INFO L225 Difference]: With dead ends: 4370 [2021-10-05 22:41:58,150 INFO L226 Difference]: Without dead ends: 4350 [2021-10-05 22:41:58,151 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 204.7ms TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2021-10-05 22:41:58,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4350 states. [2021-10-05 22:41:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4350 to 3570. [2021-10-05 22:41:58,207 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 22:41:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 3570 states and 10202 transitions. [2021-10-05 22:41:58,215 INFO L78 Accepts]: Start accepts. Automaton has 3570 states and 10202 transitions. Word has length 38 [2021-10-05 22:41:58,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:58,215 INFO L470 AbstractCegarLoop]: Abstraction has 3570 states and 10202 transitions. [2021-10-05 22:41:58,215 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 22:41:58,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3570 states and 10202 transitions. [2021-10-05 22:41:58,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:58,221 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:58,221 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:58,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-10-05 22:41:58,221 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 22:41:58,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:58,221 INFO L82 PathProgramCache]: Analyzing trace with hash -370502415, now seen corresponding path program 98 times [2021-10-05 22:41:58,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:58,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872320892] [2021-10-05 22:41:58,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:58,222 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:58,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:58,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:58,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872320892] [2021-10-05 22:41:58,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872320892] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:58,345 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:58,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:41:58,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118123951] [2021-10-05 22:41:58,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:41:58,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:58,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:41:58,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:41:58,346 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 22:41:59,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:59,124 INFO L93 Difference]: Finished difference Result 4358 states and 12193 transitions. [2021-10-05 22:41:59,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 22:41:59,125 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 22:41:59,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:59,133 INFO L225 Difference]: With dead ends: 4358 [2021-10-05 22:41:59,133 INFO L226 Difference]: Without dead ends: 4296 [2021-10-05 22:41:59,134 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 306.4ms TimeCoverageRelationStatistics Valid=230, Invalid=826, Unknown=0, NotChecked=0, Total=1056 [2021-10-05 22:41:59,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2021-10-05 22:41:59,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 3526. [2021-10-05 22:41:59,190 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 22:41:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 10112 transitions. [2021-10-05 22:41:59,198 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 10112 transitions. Word has length 38 [2021-10-05 22:41:59,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:59,198 INFO L470 AbstractCegarLoop]: Abstraction has 3526 states and 10112 transitions. [2021-10-05 22:41:59,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 22:41:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 10112 transitions. [2021-10-05 22:41:59,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:59,206 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:59,206 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:41:59,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-10-05 22:41:59,206 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 22:41:59,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:59,207 INFO L82 PathProgramCache]: Analyzing trace with hash 935820881, now seen corresponding path program 99 times [2021-10-05 22:41:59,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:59,207 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146776195] [2021-10-05 22:41:59,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:59,207 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:41:59,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:59,324 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146776195] [2021-10-05 22:41:59,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146776195] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:59,324 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:59,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-05 22:41:59,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461341156] [2021-10-05 22:41:59,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-05 22:41:59,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:59,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-05 22:41:59,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-05 22:41:59,326 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 22:41:59,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:41:59,415 INFO L93 Difference]: Finished difference Result 4551 states and 13008 transitions. [2021-10-05 22:41:59,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-05 22:41:59,415 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 22:41:59,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:41:59,422 INFO L225 Difference]: With dead ends: 4551 [2021-10-05 22:41:59,423 INFO L226 Difference]: Without dead ends: 2894 [2021-10-05 22:41:59,423 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-05 22:41:59,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2021-10-05 22:41:59,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2894. [2021-10-05 22:41:59,477 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 22:41:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 7956 transitions. [2021-10-05 22:41:59,487 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 7956 transitions. Word has length 38 [2021-10-05 22:41:59,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:41:59,487 INFO L470 AbstractCegarLoop]: Abstraction has 2894 states and 7956 transitions. [2021-10-05 22:41:59,487 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 22:41:59,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 7956 transitions. [2021-10-05 22:41:59,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:41:59,494 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:41:59,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 22:41:59,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-10-05 22:41:59,494 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 22:41:59,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:41:59,495 INFO L82 PathProgramCache]: Analyzing trace with hash 452241967, now seen corresponding path program 100 times [2021-10-05 22:41:59,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:41:59,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711217636] [2021-10-05 22:41:59,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:41:59,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:41:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:41:59,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 22:41:59,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:41:59,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711217636] [2021-10-05 22:41:59,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711217636] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:41:59,614 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:41:59,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:41:59,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713937926] [2021-10-05 22:41:59,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:41:59,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:41:59,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:41:59,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:41:59,615 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 22:42:00,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:00,084 INFO L93 Difference]: Finished difference Result 3128 states and 8520 transitions. [2021-10-05 22:42:00,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 22:42:00,084 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 22:42:00,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:00,092 INFO L225 Difference]: With dead ends: 3128 [2021-10-05 22:42:00,092 INFO L226 Difference]: Without dead ends: 3006 [2021-10-05 22:42:00,092 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 147.1ms TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:42:00,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2021-10-05 22:42:00,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 2976. [2021-10-05 22:42:00,152 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 22:42:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 8145 transitions. [2021-10-05 22:42:00,161 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 8145 transitions. Word has length 38 [2021-10-05 22:42:00,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:00,162 INFO L470 AbstractCegarLoop]: Abstraction has 2976 states and 8145 transitions. [2021-10-05 22:42:00,162 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 22:42:00,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 8145 transitions. [2021-10-05 22:42:00,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:00,169 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:00,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 22:42:00,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-10-05 22:42:00,170 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 22:42:00,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:00,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1555325439, now seen corresponding path program 101 times [2021-10-05 22:42:00,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:00,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826688057] [2021-10-05 22:42:00,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:00,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:00,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 22:42:00,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:00,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826688057] [2021-10-05 22:42:00,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826688057] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:00,261 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:00,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-05 22:42:00,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994209994] [2021-10-05 22:42:00,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-05 22:42:00,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:00,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-05 22:42:00,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-05 22:42:00,262 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 22:42:00,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:00,450 INFO L93 Difference]: Finished difference Result 1576 states and 3966 transitions. [2021-10-05 22:42:00,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 22:42:00,450 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 22:42:00,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:00,452 INFO L225 Difference]: With dead ends: 1576 [2021-10-05 22:42:00,453 INFO L226 Difference]: Without dead ends: 1068 [2021-10-05 22:42:00,453 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 55.7ms TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:00,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2021-10-05 22:42:00,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1036. [2021-10-05 22:42:00,464 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 22:42:00,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 2619 transitions. [2021-10-05 22:42:00,466 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 2619 transitions. Word has length 38 [2021-10-05 22:42:00,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:00,467 INFO L470 AbstractCegarLoop]: Abstraction has 1036 states and 2619 transitions. [2021-10-05 22:42:00,467 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 22:42:00,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 2619 transitions. [2021-10-05 22:42:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:00,468 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:00,468 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:00,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-10-05 22:42:00,469 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 22:42:00,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:00,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1905128041, now seen corresponding path program 102 times [2021-10-05 22:42:00,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:00,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766470007] [2021-10-05 22:42:00,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:00,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:00,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:00,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766470007] [2021-10-05 22:42:00,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766470007] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:00,612 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:00,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:00,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503929180] [2021-10-05 22:42:00,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:00,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:00,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:00,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:00,613 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 22:42:00,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:00,988 INFO L93 Difference]: Finished difference Result 1202 states and 2921 transitions. [2021-10-05 22:42:00,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 22:42:00,989 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 22:42:00,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:00,991 INFO L225 Difference]: With dead ends: 1202 [2021-10-05 22:42:00,991 INFO L226 Difference]: Without dead ends: 1132 [2021-10-05 22:42:00,991 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 155.7ms TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:00,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2021-10-05 22:42:01,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1078. [2021-10-05 22:42:01,004 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 22:42:01,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 2693 transitions. [2021-10-05 22:42:01,006 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 2693 transitions. Word has length 38 [2021-10-05 22:42:01,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:01,006 INFO L470 AbstractCegarLoop]: Abstraction has 1078 states and 2693 transitions. [2021-10-05 22:42:01,006 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 22:42:01,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 2693 transitions. [2021-10-05 22:42:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:01,008 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:01,008 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:01,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-10-05 22:42:01,008 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 22:42:01,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:01,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1857730595, now seen corresponding path program 103 times [2021-10-05 22:42:01,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:01,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623069995] [2021-10-05 22:42:01,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:01,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:01,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:01,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623069995] [2021-10-05 22:42:01,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623069995] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:01,124 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:01,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:01,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697869109] [2021-10-05 22:42:01,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:01,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:01,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:01,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:01,126 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 22:42:01,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:01,580 INFO L93 Difference]: Finished difference Result 1308 states and 3145 transitions. [2021-10-05 22:42:01,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 22:42:01,581 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 22:42:01,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:01,583 INFO L225 Difference]: With dead ends: 1308 [2021-10-05 22:42:01,583 INFO L226 Difference]: Without dead ends: 1244 [2021-10-05 22:42:01,583 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 145.9ms TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:42:01,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2021-10-05 22:42:01,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1086. [2021-10-05 22:42:01,596 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 22:42:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 2709 transitions. [2021-10-05 22:42:01,598 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 2709 transitions. Word has length 38 [2021-10-05 22:42:01,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:01,598 INFO L470 AbstractCegarLoop]: Abstraction has 1086 states and 2709 transitions. [2021-10-05 22:42:01,599 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 22:42:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 2709 transitions. [2021-10-05 22:42:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:01,600 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:01,600 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:01,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-10-05 22:42:01,601 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 22:42:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash -239549283, now seen corresponding path program 104 times [2021-10-05 22:42:01,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:01,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10373786] [2021-10-05 22:42:01,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:01,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:01,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:01,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:01,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10373786] [2021-10-05 22:42:01,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10373786] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:01,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:01,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:01,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505850405] [2021-10-05 22:42:01,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:01,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:01,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:01,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:01,707 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 22:42:02,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:02,169 INFO L93 Difference]: Finished difference Result 1462 states and 3570 transitions. [2021-10-05 22:42:02,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 22:42:02,169 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 22:42:02,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:02,173 INFO L225 Difference]: With dead ends: 1462 [2021-10-05 22:42:02,173 INFO L226 Difference]: Without dead ends: 1400 [2021-10-05 22:42:02,173 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 132.7ms TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:42:02,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2021-10-05 22:42:02,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1146. [2021-10-05 22:42:02,188 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 22:42:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 2868 transitions. [2021-10-05 22:42:02,191 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 2868 transitions. Word has length 38 [2021-10-05 22:42:02,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:02,191 INFO L470 AbstractCegarLoop]: Abstraction has 1146 states and 2868 transitions. [2021-10-05 22:42:02,191 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 22:42:02,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 2868 transitions. [2021-10-05 22:42:02,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:02,193 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:02,193 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:02,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-10-05 22:42:02,193 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 22:42:02,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:02,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1655925631, now seen corresponding path program 105 times [2021-10-05 22:42:02,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:02,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121830126] [2021-10-05 22:42:02,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:02,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:02,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 22:42:02,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:02,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121830126] [2021-10-05 22:42:02,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121830126] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:02,335 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:02,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:02,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523296025] [2021-10-05 22:42:02,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:02,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:02,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:02,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:02,337 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 22:42:02,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:02,874 INFO L93 Difference]: Finished difference Result 1468 states and 3582 transitions. [2021-10-05 22:42:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 22:42:02,874 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 22:42:02,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:02,878 INFO L225 Difference]: With dead ends: 1468 [2021-10-05 22:42:02,878 INFO L226 Difference]: Without dead ends: 1418 [2021-10-05 22:42:02,879 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 185.9ms TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:42:02,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2021-10-05 22:42:02,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1180. [2021-10-05 22:42:02,903 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 22:42:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 2958 transitions. [2021-10-05 22:42:02,907 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 2958 transitions. Word has length 38 [2021-10-05 22:42:02,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:02,907 INFO L470 AbstractCegarLoop]: Abstraction has 1180 states and 2958 transitions. [2021-10-05 22:42:02,907 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 22:42:02,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 2958 transitions. [2021-10-05 22:42:02,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:02,910 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:02,910 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:02,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-10-05 22:42:02,911 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 22:42:02,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:02,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1109508985, now seen corresponding path program 106 times [2021-10-05 22:42:02,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:02,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378772468] [2021-10-05 22:42:02,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:02,912 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:03,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:03,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378772468] [2021-10-05 22:42:03,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378772468] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:03,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:03,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:03,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300387777] [2021-10-05 22:42:03,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:03,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:03,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:03,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:03,060 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 22:42:03,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:03,480 INFO L93 Difference]: Finished difference Result 1540 states and 3716 transitions. [2021-10-05 22:42:03,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 22:42:03,481 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 22:42:03,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:03,484 INFO L225 Difference]: With dead ends: 1540 [2021-10-05 22:42:03,484 INFO L226 Difference]: Without dead ends: 1420 [2021-10-05 22:42:03,484 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 158.9ms TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:42:03,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2021-10-05 22:42:03,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1136. [2021-10-05 22:42:03,507 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 22:42:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 2845 transitions. [2021-10-05 22:42:03,510 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 2845 transitions. Word has length 38 [2021-10-05 22:42:03,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:03,511 INFO L470 AbstractCegarLoop]: Abstraction has 1136 states and 2845 transitions. [2021-10-05 22:42:03,511 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 22:42:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 2845 transitions. [2021-10-05 22:42:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:03,514 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:03,514 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:03,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-10-05 22:42:03,514 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 22:42:03,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:03,515 INFO L82 PathProgramCache]: Analyzing trace with hash 957344373, now seen corresponding path program 107 times [2021-10-05 22:42:03,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:03,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250161160] [2021-10-05 22:42:03,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:03,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:03,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:03,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:03,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250161160] [2021-10-05 22:42:03,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250161160] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:03,659 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:03,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:03,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413921578] [2021-10-05 22:42:03,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:03,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:03,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:03,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:03,661 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 22:42:03,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:03,994 INFO L93 Difference]: Finished difference Result 1186 states and 2934 transitions. [2021-10-05 22:42:03,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:42:03,995 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 22:42:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:03,997 INFO L225 Difference]: With dead ends: 1186 [2021-10-05 22:42:03,998 INFO L226 Difference]: Without dead ends: 1158 [2021-10-05 22:42:03,998 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 140.8ms TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:42:04,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2021-10-05 22:42:04,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1146. [2021-10-05 22:42:04,019 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 22:42:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 2858 transitions. [2021-10-05 22:42:04,022 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 2858 transitions. Word has length 38 [2021-10-05 22:42:04,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:04,023 INFO L470 AbstractCegarLoop]: Abstraction has 1146 states and 2858 transitions. [2021-10-05 22:42:04,023 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 22:42:04,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 2858 transitions. [2021-10-05 22:42:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:04,025 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:04,026 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:04,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-10-05 22:42:04,026 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 22:42:04,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:04,027 INFO L82 PathProgramCache]: Analyzing trace with hash 415059757, now seen corresponding path program 108 times [2021-10-05 22:42:04,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:04,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879466163] [2021-10-05 22:42:04,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:04,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:04,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 22:42:04,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:04,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879466163] [2021-10-05 22:42:04,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879466163] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:04,131 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:04,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:04,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041287031] [2021-10-05 22:42:04,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:04,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:04,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:04,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:04,133 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 22:42:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:04,475 INFO L93 Difference]: Finished difference Result 1316 states and 3241 transitions. [2021-10-05 22:42:04,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 22:42:04,476 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 22:42:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:04,479 INFO L225 Difference]: With dead ends: 1316 [2021-10-05 22:42:04,479 INFO L226 Difference]: Without dead ends: 1296 [2021-10-05 22:42:04,480 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 124.6ms TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:04,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2021-10-05 22:42:04,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1168. [2021-10-05 22:42:04,500 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 22:42:04,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 2913 transitions. [2021-10-05 22:42:04,524 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 2913 transitions. Word has length 38 [2021-10-05 22:42:04,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:04,524 INFO L470 AbstractCegarLoop]: Abstraction has 1168 states and 2913 transitions. [2021-10-05 22:42:04,524 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 22:42:04,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 2913 transitions. [2021-10-05 22:42:04,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:04,527 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:04,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 22:42:04,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-10-05 22:42:04,527 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 22:42:04,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:04,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1811798207, now seen corresponding path program 109 times [2021-10-05 22:42:04,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:04,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441481394] [2021-10-05 22:42:04,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:04,528 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:04,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:04,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441481394] [2021-10-05 22:42:04,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441481394] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:04,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:04,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:04,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267610880] [2021-10-05 22:42:04,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:04,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:04,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:04,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:04,654 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 22:42:05,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:05,033 INFO L93 Difference]: Finished difference Result 1320 states and 3250 transitions. [2021-10-05 22:42:05,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:42:05,033 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 22:42:05,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:05,035 INFO L225 Difference]: With dead ends: 1320 [2021-10-05 22:42:05,035 INFO L226 Difference]: Without dead ends: 1310 [2021-10-05 22:42:05,036 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 151.1ms TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:42:05,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2021-10-05 22:42:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1174. [2021-10-05 22:42:05,050 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 22:42:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 2924 transitions. [2021-10-05 22:42:05,052 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 2924 transitions. Word has length 38 [2021-10-05 22:42:05,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:05,052 INFO L470 AbstractCegarLoop]: Abstraction has 1174 states and 2924 transitions. [2021-10-05 22:42:05,052 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 22:42:05,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 2924 transitions. [2021-10-05 22:42:05,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:05,054 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:05,054 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:05,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2021-10-05 22:42:05,054 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 22:42:05,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:05,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1220533751, now seen corresponding path program 110 times [2021-10-05 22:42:05,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:05,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276402836] [2021-10-05 22:42:05,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:05,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:05,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:05,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:05,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276402836] [2021-10-05 22:42:05,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276402836] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:05,181 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:05,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:05,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312005683] [2021-10-05 22:42:05,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:05,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:05,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:05,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:05,183 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 22:42:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:05,542 INFO L93 Difference]: Finished difference Result 1402 states and 3401 transitions. [2021-10-05 22:42:05,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:42:05,543 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 22:42:05,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:05,546 INFO L225 Difference]: With dead ends: 1402 [2021-10-05 22:42:05,546 INFO L226 Difference]: Without dead ends: 1378 [2021-10-05 22:42:05,546 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 139.5ms TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:42:05,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2021-10-05 22:42:05,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1158. [2021-10-05 22:42:05,560 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 22:42:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 2890 transitions. [2021-10-05 22:42:05,562 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 2890 transitions. Word has length 38 [2021-10-05 22:42:05,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:05,562 INFO L470 AbstractCegarLoop]: Abstraction has 1158 states and 2890 transitions. [2021-10-05 22:42:05,562 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 22:42:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 2890 transitions. [2021-10-05 22:42:05,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:05,564 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:05,564 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:05,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-10-05 22:42:05,564 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 22:42:05,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:05,565 INFO L82 PathProgramCache]: Analyzing trace with hash 628033821, now seen corresponding path program 111 times [2021-10-05 22:42:05,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:05,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345044956] [2021-10-05 22:42:05,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:05,565 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:05,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:05,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345044956] [2021-10-05 22:42:05,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345044956] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:05,664 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:05,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:05,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527074682] [2021-10-05 22:42:05,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:05,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:05,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:05,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:05,666 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 22:42:06,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:06,046 INFO L93 Difference]: Finished difference Result 1246 states and 3068 transitions. [2021-10-05 22:42:06,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:42:06,046 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 22:42:06,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:06,048 INFO L225 Difference]: With dead ends: 1246 [2021-10-05 22:42:06,048 INFO L226 Difference]: Without dead ends: 1216 [2021-10-05 22:42:06,049 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 132.7ms TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:42:06,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2021-10-05 22:42:06,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1150. [2021-10-05 22:42:06,062 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 22:42:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 2872 transitions. [2021-10-05 22:42:06,063 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 2872 transitions. Word has length 38 [2021-10-05 22:42:06,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:06,064 INFO L470 AbstractCegarLoop]: Abstraction has 1150 states and 2872 transitions. [2021-10-05 22:42:06,064 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 22:42:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 2872 transitions. [2021-10-05 22:42:06,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:06,065 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:06,066 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:06,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-10-05 22:42:06,066 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 22:42:06,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:06,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1884380583, now seen corresponding path program 112 times [2021-10-05 22:42:06,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:06,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290145101] [2021-10-05 22:42:06,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:06,067 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:06,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:06,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290145101] [2021-10-05 22:42:06,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290145101] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:06,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:06,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:06,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288303031] [2021-10-05 22:42:06,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:06,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:06,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:06,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:06,164 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 22:42:06,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:06,569 INFO L93 Difference]: Finished difference Result 1510 states and 3738 transitions. [2021-10-05 22:42:06,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 22:42:06,570 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 22:42:06,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:06,572 INFO L225 Difference]: With dead ends: 1510 [2021-10-05 22:42:06,572 INFO L226 Difference]: Without dead ends: 1490 [2021-10-05 22:42:06,573 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 163.2ms TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:42:06,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2021-10-05 22:42:06,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1178. [2021-10-05 22:42:06,588 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 22:42:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 2947 transitions. [2021-10-05 22:42:06,590 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 2947 transitions. Word has length 38 [2021-10-05 22:42:06,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:06,590 INFO L470 AbstractCegarLoop]: Abstraction has 1178 states and 2947 transitions. [2021-10-05 22:42:06,590 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 22:42:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 2947 transitions. [2021-10-05 22:42:06,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:06,592 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:06,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 22:42:06,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-10-05 22:42:06,592 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 22:42:06,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:06,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1013848263, now seen corresponding path program 113 times [2021-10-05 22:42:06,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:06,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884880030] [2021-10-05 22:42:06,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:06,593 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:06,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:06,682 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884880030] [2021-10-05 22:42:06,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884880030] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:06,682 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:06,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:06,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083515814] [2021-10-05 22:42:06,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:06,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:06,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:06,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:06,684 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 22:42:07,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:07,056 INFO L93 Difference]: Finished difference Result 1484 states and 3681 transitions. [2021-10-05 22:42:07,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:42:07,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 22:42:07,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:07,059 INFO L225 Difference]: With dead ends: 1484 [2021-10-05 22:42:07,059 INFO L226 Difference]: Without dead ends: 1474 [2021-10-05 22:42:07,059 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 127.5ms TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:42:07,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2021-10-05 22:42:07,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1184. [2021-10-05 22:42:07,074 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 22:42:07,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 2958 transitions. [2021-10-05 22:42:07,076 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 2958 transitions. Word has length 38 [2021-10-05 22:42:07,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:07,076 INFO L470 AbstractCegarLoop]: Abstraction has 1184 states and 2958 transitions. [2021-10-05 22:42:07,076 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 22:42:07,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 2958 transitions. [2021-10-05 22:42:07,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:07,078 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:07,078 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:07,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-10-05 22:42:07,082 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 22:42:07,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:07,084 INFO L82 PathProgramCache]: Analyzing trace with hash 248787075, now seen corresponding path program 114 times [2021-10-05 22:42:07,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:07,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212047425] [2021-10-05 22:42:07,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:07,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:07,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 22:42:07,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:07,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212047425] [2021-10-05 22:42:07,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212047425] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:07,177 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:07,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:07,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120295214] [2021-10-05 22:42:07,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:07,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:07,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:07,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:07,178 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 22:42:07,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:07,506 INFO L93 Difference]: Finished difference Result 1872 states and 4555 transitions. [2021-10-05 22:42:07,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:42:07,507 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 22:42:07,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:07,510 INFO L225 Difference]: With dead ends: 1872 [2021-10-05 22:42:07,510 INFO L226 Difference]: Without dead ends: 1848 [2021-10-05 22:42:07,510 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 109.5ms TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:42:07,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2021-10-05 22:42:07,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1200. [2021-10-05 22:42:07,527 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 22:42:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 3019 transitions. [2021-10-05 22:42:07,530 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 3019 transitions. Word has length 38 [2021-10-05 22:42:07,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:07,530 INFO L470 AbstractCegarLoop]: Abstraction has 1200 states and 3019 transitions. [2021-10-05 22:42:07,530 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 22:42:07,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 3019 transitions. [2021-10-05 22:42:07,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:07,532 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:07,532 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:07,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-10-05 22:42:07,532 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 22:42:07,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:07,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2097354647, now seen corresponding path program 115 times [2021-10-05 22:42:07,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:07,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4474191] [2021-10-05 22:42:07,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:07,533 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:07,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:07,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:07,635 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4474191] [2021-10-05 22:42:07,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4474191] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:07,636 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:07,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:07,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641400941] [2021-10-05 22:42:07,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:07,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:07,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:07,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:07,639 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 22:42:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:08,012 INFO L93 Difference]: Finished difference Result 1338 states and 3301 transitions. [2021-10-05 22:42:08,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 22:42:08,013 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 22:42:08,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:08,017 INFO L225 Difference]: With dead ends: 1338 [2021-10-05 22:42:08,017 INFO L226 Difference]: Without dead ends: 1314 [2021-10-05 22:42:08,017 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 165.0ms TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:42:08,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2021-10-05 22:42:08,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1196. [2021-10-05 22:42:08,042 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 22:42:08,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 3009 transitions. [2021-10-05 22:42:08,045 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 3009 transitions. Word has length 38 [2021-10-05 22:42:08,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:08,046 INFO L470 AbstractCegarLoop]: Abstraction has 1196 states and 3009 transitions. [2021-10-05 22:42:08,046 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 22:42:08,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 3009 transitions. [2021-10-05 22:42:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:08,048 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:08,048 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:08,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-10-05 22:42:08,048 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 22:42:08,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:08,049 INFO L82 PathProgramCache]: Analyzing trace with hash 508393703, now seen corresponding path program 116 times [2021-10-05 22:42:08,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:08,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937242624] [2021-10-05 22:42:08,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:08,049 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:08,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:08,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:08,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937242624] [2021-10-05 22:42:08,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937242624] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:08,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:08,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:08,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744237692] [2021-10-05 22:42:08,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:08,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:08,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:08,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:08,148 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 22:42:08,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:08,536 INFO L93 Difference]: Finished difference Result 1670 states and 4187 transitions. [2021-10-05 22:42:08,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 22:42:08,537 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 22:42:08,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:08,541 INFO L225 Difference]: With dead ends: 1670 [2021-10-05 22:42:08,542 INFO L226 Difference]: Without dead ends: 1650 [2021-10-05 22:42:08,542 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 126.1ms TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:08,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2021-10-05 22:42:08,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1196. [2021-10-05 22:42:08,569 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 22:42:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 2999 transitions. [2021-10-05 22:42:08,573 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 2999 transitions. Word has length 38 [2021-10-05 22:42:08,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:08,573 INFO L470 AbstractCegarLoop]: Abstraction has 1196 states and 2999 transitions. [2021-10-05 22:42:08,574 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 22:42:08,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 2999 transitions. [2021-10-05 22:42:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:08,577 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:08,577 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:08,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-10-05 22:42:08,578 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 22:42:08,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:08,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1905132153, now seen corresponding path program 117 times [2021-10-05 22:42:08,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:08,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128199124] [2021-10-05 22:42:08,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:08,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:08,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:08,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128199124] [2021-10-05 22:42:08,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128199124] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:08,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:08,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:08,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924650771] [2021-10-05 22:42:08,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:08,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:08,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:08,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:08,697 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 22:42:09,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:09,103 INFO L93 Difference]: Finished difference Result 1912 states and 4677 transitions. [2021-10-05 22:42:09,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:42:09,104 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 22:42:09,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:09,107 INFO L225 Difference]: With dead ends: 1912 [2021-10-05 22:42:09,107 INFO L226 Difference]: Without dead ends: 1886 [2021-10-05 22:42:09,107 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 149.5ms TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:09,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2021-10-05 22:42:09,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1172. [2021-10-05 22:42:09,123 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 22:42:09,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 2937 transitions. [2021-10-05 22:42:09,126 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 2937 transitions. Word has length 38 [2021-10-05 22:42:09,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:09,126 INFO L470 AbstractCegarLoop]: Abstraction has 1172 states and 2937 transitions. [2021-10-05 22:42:09,126 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 22:42:09,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 2937 transitions. [2021-10-05 22:42:09,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:09,128 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:09,128 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:09,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-10-05 22:42:09,128 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 22:42:09,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:09,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1955418217, now seen corresponding path program 118 times [2021-10-05 22:42:09,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:09,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862819594] [2021-10-05 22:42:09,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:09,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:09,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:09,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:09,232 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862819594] [2021-10-05 22:42:09,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862819594] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:09,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:09,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:09,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926119758] [2021-10-05 22:42:09,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:09,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:09,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:09,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:09,234 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 22:42:09,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:09,723 INFO L93 Difference]: Finished difference Result 1772 states and 4363 transitions. [2021-10-05 22:42:09,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 22:42:09,724 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 22:42:09,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:09,727 INFO L225 Difference]: With dead ends: 1772 [2021-10-05 22:42:09,727 INFO L226 Difference]: Without dead ends: 1710 [2021-10-05 22:42:09,727 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 151.6ms TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:42:09,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2021-10-05 22:42:09,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1248. [2021-10-05 22:42:09,744 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 22:42:09,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 3144 transitions. [2021-10-05 22:42:09,746 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 3144 transitions. Word has length 38 [2021-10-05 22:42:09,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:09,746 INFO L470 AbstractCegarLoop]: Abstraction has 1248 states and 3144 transitions. [2021-10-05 22:42:09,746 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 22:42:09,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 3144 transitions. [2021-10-05 22:42:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:09,748 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:09,748 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:09,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-10-05 22:42:09,748 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 22:42:09,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:09,749 INFO L82 PathProgramCache]: Analyzing trace with hash -59943303, now seen corresponding path program 119 times [2021-10-05 22:42:09,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:09,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405291844] [2021-10-05 22:42:09,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:09,749 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:09,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 22:42:09,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:09,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405291844] [2021-10-05 22:42:09,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405291844] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:09,847 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:09,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:09,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210222818] [2021-10-05 22:42:09,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:09,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:09,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:09,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:09,849 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 22:42:10,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:10,342 INFO L93 Difference]: Finished difference Result 1976 states and 4760 transitions. [2021-10-05 22:42:10,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 22:42:10,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 22:42:10,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:10,346 INFO L225 Difference]: With dead ends: 1976 [2021-10-05 22:42:10,346 INFO L226 Difference]: Without dead ends: 1830 [2021-10-05 22:42:10,346 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 152.2ms TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:42:10,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2021-10-05 22:42:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1188. [2021-10-05 22:42:10,362 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 22:42:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 2973 transitions. [2021-10-05 22:42:10,364 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 2973 transitions. Word has length 38 [2021-10-05 22:42:10,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:10,364 INFO L470 AbstractCegarLoop]: Abstraction has 1188 states and 2973 transitions. [2021-10-05 22:42:10,365 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 22:42:10,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 2973 transitions. [2021-10-05 22:42:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:10,366 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:10,366 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:10,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-10-05 22:42:10,367 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 22:42:10,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:10,367 INFO L82 PathProgramCache]: Analyzing trace with hash 535312343, now seen corresponding path program 120 times [2021-10-05 22:42:10,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:10,368 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321833934] [2021-10-05 22:42:10,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:10,368 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:10,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:10,469 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321833934] [2021-10-05 22:42:10,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321833934] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:10,470 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:10,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:10,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978230955] [2021-10-05 22:42:10,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:10,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:10,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:10,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:10,471 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 22:42:10,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:10,864 INFO L93 Difference]: Finished difference Result 1810 states and 4421 transitions. [2021-10-05 22:42:10,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 22:42:10,865 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 22:42:10,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:10,868 INFO L225 Difference]: With dead ends: 1810 [2021-10-05 22:42:10,868 INFO L226 Difference]: Without dead ends: 1794 [2021-10-05 22:42:10,868 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 125.7ms TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:42:10,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2021-10-05 22:42:10,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1192. [2021-10-05 22:42:10,884 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 22:42:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 2984 transitions. [2021-10-05 22:42:10,887 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 2984 transitions. Word has length 38 [2021-10-05 22:42:10,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:10,887 INFO L470 AbstractCegarLoop]: Abstraction has 1192 states and 2984 transitions. [2021-10-05 22:42:10,887 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 22:42:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 2984 transitions. [2021-10-05 22:42:10,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:10,889 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:10,892 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:10,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-10-05 22:42:10,892 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 22:42:10,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:10,893 INFO L82 PathProgramCache]: Analyzing trace with hash 289275687, now seen corresponding path program 121 times [2021-10-05 22:42:10,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:10,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452123795] [2021-10-05 22:42:10,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:10,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:11,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:11,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:11,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452123795] [2021-10-05 22:42:11,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452123795] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:11,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:11,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:11,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944556218] [2021-10-05 22:42:11,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:11,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:11,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:11,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:11,005 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 22:42:11,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:11,556 INFO L93 Difference]: Finished difference Result 1872 states and 4538 transitions. [2021-10-05 22:42:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 22:42:11,557 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 22:42:11,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:11,560 INFO L225 Difference]: With dead ends: 1872 [2021-10-05 22:42:11,560 INFO L226 Difference]: Without dead ends: 1830 [2021-10-05 22:42:11,560 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 179.7ms TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2021-10-05 22:42:11,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2021-10-05 22:42:11,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1192. [2021-10-05 22:42:11,576 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 22:42:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 2980 transitions. [2021-10-05 22:42:11,579 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 2980 transitions. Word has length 38 [2021-10-05 22:42:11,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:11,579 INFO L470 AbstractCegarLoop]: Abstraction has 1192 states and 2980 transitions. [2021-10-05 22:42:11,579 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 22:42:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 2980 transitions. [2021-10-05 22:42:11,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:11,581 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:11,581 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:11,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2021-10-05 22:42:11,581 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 22:42:11,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:11,581 INFO L82 PathProgramCache]: Analyzing trace with hash 229848855, now seen corresponding path program 122 times [2021-10-05 22:42:11,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:11,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060757053] [2021-10-05 22:42:11,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:11,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:11,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:11,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060757053] [2021-10-05 22:42:11,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060757053] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:11,681 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:11,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:11,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535170261] [2021-10-05 22:42:11,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:11,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:11,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:11,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:11,683 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 22:42:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:12,097 INFO L93 Difference]: Finished difference Result 1846 states and 4490 transitions. [2021-10-05 22:42:12,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 22:42:12,098 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 22:42:12,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:12,102 INFO L225 Difference]: With dead ends: 1846 [2021-10-05 22:42:12,102 INFO L226 Difference]: Without dead ends: 1802 [2021-10-05 22:42:12,103 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 120.0ms TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:12,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2021-10-05 22:42:12,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1176. [2021-10-05 22:42:12,128 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 22:42:12,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 2948 transitions. [2021-10-05 22:42:12,132 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 2948 transitions. Word has length 38 [2021-10-05 22:42:12,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:12,132 INFO L470 AbstractCegarLoop]: Abstraction has 1176 states and 2948 transitions. [2021-10-05 22:42:12,132 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 22:42:12,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 2948 transitions. [2021-10-05 22:42:12,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:12,135 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:12,136 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:12,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-10-05 22:42:12,136 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 22:42:12,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:12,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1266370841, now seen corresponding path program 123 times [2021-10-05 22:42:12,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:12,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239143143] [2021-10-05 22:42:12,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:12,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:12,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:12,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239143143] [2021-10-05 22:42:12,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239143143] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:12,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:12,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:12,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789690855] [2021-10-05 22:42:12,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:12,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:12,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:12,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:12,258 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 22:42:12,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:12,745 INFO L93 Difference]: Finished difference Result 1422 states and 3434 transitions. [2021-10-05 22:42:12,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 22:42:12,745 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 22:42:12,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:12,748 INFO L225 Difference]: With dead ends: 1422 [2021-10-05 22:42:12,748 INFO L226 Difference]: Without dead ends: 1358 [2021-10-05 22:42:12,749 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 197.2ms TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:42:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2021-10-05 22:42:12,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1184. [2021-10-05 22:42:12,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 22:42:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 2964 transitions. [2021-10-05 22:42:12,765 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 2964 transitions. Word has length 38 [2021-10-05 22:42:12,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:12,765 INFO L470 AbstractCegarLoop]: Abstraction has 1184 states and 2964 transitions. [2021-10-05 22:42:12,765 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 22:42:12,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 2964 transitions. [2021-10-05 22:42:12,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:12,766 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:12,767 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:12,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2021-10-05 22:42:12,768 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 22:42:12,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:12,768 INFO L82 PathProgramCache]: Analyzing trace with hash 351810471, now seen corresponding path program 124 times [2021-10-05 22:42:12,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:12,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559742561] [2021-10-05 22:42:12,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:12,768 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:12,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 22:42:12,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:12,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559742561] [2021-10-05 22:42:12,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559742561] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:12,878 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:12,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:12,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023871569] [2021-10-05 22:42:12,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:12,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:12,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:12,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:12,879 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 22:42:13,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:13,410 INFO L93 Difference]: Finished difference Result 1642 states and 3994 transitions. [2021-10-05 22:42:13,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 22:42:13,411 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 22:42:13,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:13,414 INFO L225 Difference]: With dead ends: 1642 [2021-10-05 22:42:13,414 INFO L226 Difference]: Without dead ends: 1580 [2021-10-05 22:42:13,415 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 196.2ms TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2021-10-05 22:42:13,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2021-10-05 22:42:13,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1244. [2021-10-05 22:42:13,432 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 22:42:13,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 3123 transitions. [2021-10-05 22:42:13,434 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 3123 transitions. Word has length 38 [2021-10-05 22:42:13,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:13,435 INFO L470 AbstractCegarLoop]: Abstraction has 1244 states and 3123 transitions. [2021-10-05 22:42:13,435 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 22:42:13,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 3123 transitions. [2021-10-05 22:42:13,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:13,437 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:13,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 22:42:13,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2021-10-05 22:42:13,438 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 22:42:13,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:13,438 INFO L82 PathProgramCache]: Analyzing trace with hash -2047681911, now seen corresponding path program 125 times [2021-10-05 22:42:13,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:13,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470681222] [2021-10-05 22:42:13,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:13,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:13,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:13,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470681222] [2021-10-05 22:42:13,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470681222] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:13,555 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:13,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:13,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853983700] [2021-10-05 22:42:13,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:13,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:13,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:13,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:13,558 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 22:42:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:14,072 INFO L93 Difference]: Finished difference Result 1586 states and 3866 transitions. [2021-10-05 22:42:14,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 22:42:14,073 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 22:42:14,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:14,075 INFO L225 Difference]: With dead ends: 1586 [2021-10-05 22:42:14,075 INFO L226 Difference]: Without dead ends: 1536 [2021-10-05 22:42:14,076 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 185.0ms TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:42:14,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2021-10-05 22:42:14,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1278. [2021-10-05 22:42:14,092 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 22:42:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 3213 transitions. [2021-10-05 22:42:14,094 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 3213 transitions. Word has length 38 [2021-10-05 22:42:14,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:14,095 INFO L470 AbstractCegarLoop]: Abstraction has 1278 states and 3213 transitions. [2021-10-05 22:42:14,095 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 22:42:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 3213 transitions. [2021-10-05 22:42:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:14,096 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:14,097 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:14,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2021-10-05 22:42:14,097 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 22:42:14,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:14,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1700868739, now seen corresponding path program 126 times [2021-10-05 22:42:14,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:14,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781437266] [2021-10-05 22:42:14,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:14,098 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:14,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:14,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781437266] [2021-10-05 22:42:14,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781437266] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:14,218 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:14,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:14,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532776639] [2021-10-05 22:42:14,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:14,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:14,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:14,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:14,220 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 22:42:14,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:14,673 INFO L93 Difference]: Finished difference Result 1842 states and 4449 transitions. [2021-10-05 22:42:14,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 22:42:14,674 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 22:42:14,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:14,676 INFO L225 Difference]: With dead ends: 1842 [2021-10-05 22:42:14,678 INFO L226 Difference]: Without dead ends: 1718 [2021-10-05 22:42:14,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 151.5ms TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:42:14,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2021-10-05 22:42:14,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1160. [2021-10-05 22:42:14,696 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 22:42:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 2908 transitions. [2021-10-05 22:42:14,698 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 2908 transitions. Word has length 38 [2021-10-05 22:42:14,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:14,698 INFO L470 AbstractCegarLoop]: Abstraction has 1160 states and 2908 transitions. [2021-10-05 22:42:14,699 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 22:42:14,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 2908 transitions. [2021-10-05 22:42:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:14,701 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:14,701 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:14,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-10-05 22:42:14,702 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 22:42:14,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:14,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1888551375, now seen corresponding path program 127 times [2021-10-05 22:42:14,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:14,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977067897] [2021-10-05 22:42:14,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:14,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:14,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:14,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:14,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977067897] [2021-10-05 22:42:14,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977067897] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:14,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:14,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:42:14,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75381799] [2021-10-05 22:42:14,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:42:14,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:14,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:42:14,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:42:14,819 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 22:42:15,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:15,032 INFO L93 Difference]: Finished difference Result 1270 states and 3138 transitions. [2021-10-05 22:42:15,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 22:42:15,033 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 22:42:15,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:15,035 INFO L225 Difference]: With dead ends: 1270 [2021-10-05 22:42:15,035 INFO L226 Difference]: Without dead ends: 1162 [2021-10-05 22:42:15,036 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 102.4ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-10-05 22:42:15,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2021-10-05 22:42:15,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1150. [2021-10-05 22:42:15,050 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 22:42:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 2876 transitions. [2021-10-05 22:42:15,053 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 2876 transitions. Word has length 38 [2021-10-05 22:42:15,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:15,053 INFO L470 AbstractCegarLoop]: Abstraction has 1150 states and 2876 transitions. [2021-10-05 22:42:15,054 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 22:42:15,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 2876 transitions. [2021-10-05 22:42:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:15,056 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:15,056 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:15,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2021-10-05 22:42:15,056 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 22:42:15,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:15,057 INFO L82 PathProgramCache]: Analyzing trace with hash 164952755, now seen corresponding path program 128 times [2021-10-05 22:42:15,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:15,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032755581] [2021-10-05 22:42:15,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:15,057 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:15,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:15,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032755581] [2021-10-05 22:42:15,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032755581] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:15,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:15,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:15,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224579477] [2021-10-05 22:42:15,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:15,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:15,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:15,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:15,165 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 22:42:15,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:15,473 INFO L93 Difference]: Finished difference Result 1266 states and 3118 transitions. [2021-10-05 22:42:15,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:42:15,474 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 22:42:15,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:15,476 INFO L225 Difference]: With dead ends: 1266 [2021-10-05 22:42:15,477 INFO L226 Difference]: Without dead ends: 1234 [2021-10-05 22:42:15,477 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 22:42:15,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2021-10-05 22:42:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1162. [2021-10-05 22:42:15,492 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 22:42:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 2904 transitions. [2021-10-05 22:42:15,494 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 2904 transitions. Word has length 38 [2021-10-05 22:42:15,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:15,495 INFO L470 AbstractCegarLoop]: Abstraction has 1162 states and 2904 transitions. [2021-10-05 22:42:15,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 22:42:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 2904 transitions. [2021-10-05 22:42:15,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:15,498 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:15,498 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:15,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2021-10-05 22:42:15,498 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 22:42:15,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:15,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1568387079, now seen corresponding path program 129 times [2021-10-05 22:42:15,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:15,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935545428] [2021-10-05 22:42:15,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:15,500 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:15,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 22:42:15,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:15,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935545428] [2021-10-05 22:42:15,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935545428] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:15,640 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:15,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:15,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349668709] [2021-10-05 22:42:15,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:15,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:15,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:15,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:15,641 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 22:42:15,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:15,925 INFO L93 Difference]: Finished difference Result 1200 states and 2969 transitions. [2021-10-05 22:42:15,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:42:15,925 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 22:42:15,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:15,927 INFO L225 Difference]: With dead ends: 1200 [2021-10-05 22:42:15,927 INFO L226 Difference]: Without dead ends: 1164 [2021-10-05 22:42:15,928 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 140.3ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-10-05 22:42:15,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2021-10-05 22:42:15,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1154. [2021-10-05 22:42:15,941 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 22:42:15,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 2886 transitions. [2021-10-05 22:42:15,943 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 2886 transitions. Word has length 38 [2021-10-05 22:42:15,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:15,943 INFO L470 AbstractCegarLoop]: Abstraction has 1154 states and 2886 transitions. [2021-10-05 22:42:15,943 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 22:42:15,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 2886 transitions. [2021-10-05 22:42:15,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:15,945 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:15,945 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:15,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2021-10-05 22:42:15,945 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 22:42:15,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:15,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1634273581, now seen corresponding path program 130 times [2021-10-05 22:42:15,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:15,946 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265834162] [2021-10-05 22:42:15,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:15,946 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:16,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:16,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265834162] [2021-10-05 22:42:16,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265834162] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:16,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:16,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:16,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963685051] [2021-10-05 22:42:16,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:16,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:16,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:16,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:16,075 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 22:42:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:16,413 INFO L93 Difference]: Finished difference Result 1376 states and 3399 transitions. [2021-10-05 22:42:16,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:42:16,413 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 22:42:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:16,416 INFO L225 Difference]: With dead ends: 1376 [2021-10-05 22:42:16,416 INFO L226 Difference]: Without dead ends: 1344 [2021-10-05 22:42:16,416 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 151.0ms TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:42:16,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2021-10-05 22:42:16,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1158. [2021-10-05 22:42:16,430 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 22:42:16,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 2894 transitions. [2021-10-05 22:42:16,432 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 2894 transitions. Word has length 38 [2021-10-05 22:42:16,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:16,432 INFO L470 AbstractCegarLoop]: Abstraction has 1158 states and 2894 transitions. [2021-10-05 22:42:16,432 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 22:42:16,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 2894 transitions. [2021-10-05 22:42:16,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:16,434 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:16,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 22:42:16,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2021-10-05 22:42:16,435 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 22:42:16,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:16,435 INFO L82 PathProgramCache]: Analyzing trace with hash -99066253, now seen corresponding path program 131 times [2021-10-05 22:42:16,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:16,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202220560] [2021-10-05 22:42:16,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:16,435 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:16,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 22:42:16,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:16,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202220560] [2021-10-05 22:42:16,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202220560] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:16,556 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:16,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:16,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419012581] [2021-10-05 22:42:16,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:16,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:16,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:16,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:16,558 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 22:42:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:16,865 INFO L93 Difference]: Finished difference Result 1198 states and 2962 transitions. [2021-10-05 22:42:16,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:42:16,866 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 22:42:16,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:16,868 INFO L225 Difference]: With dead ends: 1198 [2021-10-05 22:42:16,868 INFO L226 Difference]: Without dead ends: 1168 [2021-10-05 22:42:16,868 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 168.6ms TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:42:16,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2021-10-05 22:42:16,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1154. [2021-10-05 22:42:16,881 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 22:42:16,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 2884 transitions. [2021-10-05 22:42:16,883 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 2884 transitions. Word has length 38 [2021-10-05 22:42:16,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:16,883 INFO L470 AbstractCegarLoop]: Abstraction has 1154 states and 2884 transitions. [2021-10-05 22:42:16,883 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 22:42:16,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 2884 transitions. [2021-10-05 22:42:16,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:16,885 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:16,885 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:16,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2021-10-05 22:42:16,885 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 22:42:16,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:16,885 INFO L82 PathProgramCache]: Analyzing trace with hash 258286701, now seen corresponding path program 132 times [2021-10-05 22:42:16,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:16,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029126026] [2021-10-05 22:42:16,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:16,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:16,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:16,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029126026] [2021-10-05 22:42:16,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029126026] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:16,999 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:16,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:16,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275960469] [2021-10-05 22:42:16,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:16,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:17,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:17,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:17,000 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 22:42:17,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:17,312 INFO L93 Difference]: Finished difference Result 1334 states and 3314 transitions. [2021-10-05 22:42:17,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:42:17,313 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 22:42:17,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:17,315 INFO L225 Difference]: With dead ends: 1334 [2021-10-05 22:42:17,315 INFO L226 Difference]: Without dead ends: 1302 [2021-10-05 22:42:17,315 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 111.3ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-10-05 22:42:17,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2021-10-05 22:42:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1158. [2021-10-05 22:42:17,328 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 22:42:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 2892 transitions. [2021-10-05 22:42:17,330 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 2892 transitions. Word has length 38 [2021-10-05 22:42:17,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:17,330 INFO L470 AbstractCegarLoop]: Abstraction has 1158 states and 2892 transitions. [2021-10-05 22:42:17,330 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 22:42:17,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 2892 transitions. [2021-10-05 22:42:17,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:17,332 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:17,332 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:17,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2021-10-05 22:42:17,332 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 22:42:17,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:17,333 INFO L82 PathProgramCache]: Analyzing trace with hash 482003649, now seen corresponding path program 133 times [2021-10-05 22:42:17,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:17,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806499879] [2021-10-05 22:42:17,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:17,333 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:17,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:17,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806499879] [2021-10-05 22:42:17,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806499879] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:17,435 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:17,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:42:17,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390482634] [2021-10-05 22:42:17,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:42:17,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:17,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:42:17,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:42:17,436 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 22:42:17,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:17,714 INFO L93 Difference]: Finished difference Result 1258 states and 3112 transitions. [2021-10-05 22:42:17,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:42:17,715 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 22:42:17,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:17,717 INFO L225 Difference]: With dead ends: 1258 [2021-10-05 22:42:17,717 INFO L226 Difference]: Without dead ends: 1186 [2021-10-05 22:42:17,717 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 103.9ms TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-10-05 22:42:17,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2021-10-05 22:42:17,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1146. [2021-10-05 22:42:17,729 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 22:42:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 2859 transitions. [2021-10-05 22:42:17,731 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 2859 transitions. Word has length 38 [2021-10-05 22:42:17,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:17,731 INFO L470 AbstractCegarLoop]: Abstraction has 1146 states and 2859 transitions. [2021-10-05 22:42:17,732 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 22:42:17,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 2859 transitions. [2021-10-05 22:42:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:17,733 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:17,733 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:17,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2021-10-05 22:42:17,734 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 22:42:17,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:17,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1948652801, now seen corresponding path program 134 times [2021-10-05 22:42:17,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:17,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960835020] [2021-10-05 22:42:17,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:17,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:17,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:17,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960835020] [2021-10-05 22:42:17,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960835020] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:17,833 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:17,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:42:17,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117665823] [2021-10-05 22:42:17,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:42:17,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:17,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:42:17,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:42:17,834 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 22:42:18,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:18,088 INFO L93 Difference]: Finished difference Result 1116 states and 2758 transitions. [2021-10-05 22:42:18,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:42:18,089 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 22:42:18,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:18,090 INFO L225 Difference]: With dead ends: 1116 [2021-10-05 22:42:18,090 INFO L226 Difference]: Without dead ends: 1034 [2021-10-05 22:42:18,091 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 118.6ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-10-05 22:42:18,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2021-10-05 22:42:18,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1004. [2021-10-05 22:42:18,101 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 22:42:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 2515 transitions. [2021-10-05 22:42:18,103 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 2515 transitions. Word has length 38 [2021-10-05 22:42:18,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:18,104 INFO L470 AbstractCegarLoop]: Abstraction has 1004 states and 2515 transitions. [2021-10-05 22:42:18,104 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 22:42:18,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 2515 transitions. [2021-10-05 22:42:18,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:18,105 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:18,105 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:18,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2021-10-05 22:42:18,105 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 22:42:18,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:18,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1172592719, now seen corresponding path program 135 times [2021-10-05 22:42:18,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:18,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51028978] [2021-10-05 22:42:18,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:18,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:18,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 22:42:18,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:18,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51028978] [2021-10-05 22:42:18,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51028978] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:18,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:18,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:18,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594816647] [2021-10-05 22:42:18,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:18,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:18,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:18,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:18,249 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 22:42:18,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:18,488 INFO L93 Difference]: Finished difference Result 1030 states and 2552 transitions. [2021-10-05 22:42:18,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:42:18,489 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 22:42:18,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:18,491 INFO L225 Difference]: With dead ends: 1030 [2021-10-05 22:42:18,492 INFO L226 Difference]: Without dead ends: 1010 [2021-10-05 22:42:18,492 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 138.4ms TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:42:18,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2021-10-05 22:42:18,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1004. [2021-10-05 22:42:18,512 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 22:42:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 2509 transitions. [2021-10-05 22:42:18,516 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 2509 transitions. Word has length 38 [2021-10-05 22:42:18,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:18,517 INFO L470 AbstractCegarLoop]: Abstraction has 1004 states and 2509 transitions. [2021-10-05 22:42:18,517 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 22:42:18,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 2509 transitions. [2021-10-05 22:42:18,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:18,519 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:18,519 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:18,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2021-10-05 22:42:18,520 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 22:42:18,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:18,520 INFO L82 PathProgramCache]: Analyzing trace with hash 630308103, now seen corresponding path program 136 times [2021-10-05 22:42:18,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:18,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486402086] [2021-10-05 22:42:18,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:18,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:18,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:18,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:18,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486402086] [2021-10-05 22:42:18,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486402086] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:18,659 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:18,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:18,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443124406] [2021-10-05 22:42:18,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:18,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:18,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:18,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:18,661 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 22:42:18,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:18,979 INFO L93 Difference]: Finished difference Result 1048 states and 2593 transitions. [2021-10-05 22:42:18,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:42:18,979 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 22:42:18,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:18,982 INFO L225 Difference]: With dead ends: 1048 [2021-10-05 22:42:18,982 INFO L226 Difference]: Without dead ends: 1036 [2021-10-05 22:42:18,982 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 144.0ms TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:18,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2021-10-05 22:42:18,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1012. [2021-10-05 22:42:18,997 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 22:42:18,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 2523 transitions. [2021-10-05 22:42:18,998 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 2523 transitions. Word has length 38 [2021-10-05 22:42:18,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:18,999 INFO L470 AbstractCegarLoop]: Abstraction has 1012 states and 2523 transitions. [2021-10-05 22:42:18,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 22:42:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 2523 transitions. [2021-10-05 22:42:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:19,000 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:19,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 22:42:19,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2021-10-05 22:42:19,001 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 22:42:19,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:19,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1549911721, now seen corresponding path program 137 times [2021-10-05 22:42:19,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:19,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672271782] [2021-10-05 22:42:19,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:19,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:19,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:19,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672271782] [2021-10-05 22:42:19,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672271782] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:19,120 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:19,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:19,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314412507] [2021-10-05 22:42:19,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:19,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:19,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:19,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:19,122 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 22:42:19,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:19,511 INFO L93 Difference]: Finished difference Result 1492 states and 3725 transitions. [2021-10-05 22:42:19,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:42:19,512 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 22:42:19,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:19,514 INFO L225 Difference]: With dead ends: 1492 [2021-10-05 22:42:19,514 INFO L226 Difference]: Without dead ends: 1484 [2021-10-05 22:42:19,515 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 135.8ms TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:42:19,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2021-10-05 22:42:19,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1014. [2021-10-05 22:42:19,527 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 22:42:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 2526 transitions. [2021-10-05 22:42:19,529 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 2526 transitions. Word has length 38 [2021-10-05 22:42:19,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:19,529 INFO L470 AbstractCegarLoop]: Abstraction has 1014 states and 2526 transitions. [2021-10-05 22:42:19,529 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 22:42:19,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 2526 transitions. [2021-10-05 22:42:19,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:19,530 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:19,531 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:19,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2021-10-05 22:42:19,531 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 22:42:19,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:19,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1744343685, now seen corresponding path program 138 times [2021-10-05 22:42:19,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:19,531 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139964979] [2021-10-05 22:42:19,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:19,532 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:19,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 22:42:19,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:19,655 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139964979] [2021-10-05 22:42:19,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139964979] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:19,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:19,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:19,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298637689] [2021-10-05 22:42:19,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:19,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:19,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:19,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:19,657 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 22:42:19,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:19,953 INFO L93 Difference]: Finished difference Result 1040 states and 2573 transitions. [2021-10-05 22:42:19,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:42:19,953 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 22:42:19,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:19,955 INFO L225 Difference]: With dead ends: 1040 [2021-10-05 22:42:19,955 INFO L226 Difference]: Without dead ends: 1026 [2021-10-05 22:42:19,955 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 147.5ms TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:42:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2021-10-05 22:42:19,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1006. [2021-10-05 22:42:19,967 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 22:42:19,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 2512 transitions. [2021-10-05 22:42:19,969 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 2512 transitions. Word has length 38 [2021-10-05 22:42:19,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:19,969 INFO L470 AbstractCegarLoop]: Abstraction has 1006 states and 2512 transitions. [2021-10-05 22:42:19,969 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 22:42:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 2512 transitions. [2021-10-05 22:42:19,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:19,971 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:19,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 22:42:19,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2021-10-05 22:42:19,972 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 22:42:19,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:19,972 INFO L82 PathProgramCache]: Analyzing trace with hash 843282167, now seen corresponding path program 139 times [2021-10-05 22:42:19,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:19,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354798419] [2021-10-05 22:42:19,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:19,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:20,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:20,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354798419] [2021-10-05 22:42:20,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354798419] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:20,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:20,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:20,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527177831] [2021-10-05 22:42:20,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:20,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:20,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:20,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:20,100 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 22:42:20,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:20,439 INFO L93 Difference]: Finished difference Result 1040 states and 2571 transitions. [2021-10-05 22:42:20,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:42:20,440 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 22:42:20,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:20,441 INFO L225 Difference]: With dead ends: 1040 [2021-10-05 22:42:20,441 INFO L226 Difference]: Without dead ends: 1018 [2021-10-05 22:42:20,442 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 163.7ms TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:42:20,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2021-10-05 22:42:20,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 998. [2021-10-05 22:42:20,453 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 22:42:20,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 2494 transitions. [2021-10-05 22:42:20,455 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 2494 transitions. Word has length 38 [2021-10-05 22:42:20,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:20,455 INFO L470 AbstractCegarLoop]: Abstraction has 998 states and 2494 transitions. [2021-10-05 22:42:20,455 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 22:42:20,456 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 2494 transitions. [2021-10-05 22:42:20,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:20,457 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:20,457 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:20,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2021-10-05 22:42:20,457 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 22:42:20,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:20,458 INFO L82 PathProgramCache]: Analyzing trace with hash 752003313, now seen corresponding path program 140 times [2021-10-05 22:42:20,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:20,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656343264] [2021-10-05 22:42:20,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:20,458 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:20,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:20,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:20,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656343264] [2021-10-05 22:42:20,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656343264] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:20,600 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:20,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:20,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152130786] [2021-10-05 22:42:20,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:20,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:20,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:20,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:20,601 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 22:42:20,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:20,873 INFO L93 Difference]: Finished difference Result 1026 states and 2538 transitions. [2021-10-05 22:42:20,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:42:20,873 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 22:42:20,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:20,875 INFO L225 Difference]: With dead ends: 1026 [2021-10-05 22:42:20,875 INFO L226 Difference]: Without dead ends: 998 [2021-10-05 22:42:20,875 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 148.4ms TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:20,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2021-10-05 22:42:20,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 992. [2021-10-05 22:42:20,891 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 22:42:20,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 2479 transitions. [2021-10-05 22:42:20,895 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 2479 transitions. Word has length 38 [2021-10-05 22:42:20,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:20,895 INFO L470 AbstractCegarLoop]: Abstraction has 992 states and 2479 transitions. [2021-10-05 22:42:20,895 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 22:42:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 2479 transitions. [2021-10-05 22:42:20,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:20,898 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:20,898 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:20,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2021-10-05 22:42:20,898 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 22:42:20,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:20,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1307424425, now seen corresponding path program 141 times [2021-10-05 22:42:20,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:20,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737127823] [2021-10-05 22:42:20,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:20,900 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:21,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:21,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737127823] [2021-10-05 22:42:21,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737127823] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:21,008 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:21,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:21,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678521283] [2021-10-05 22:42:21,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:21,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:21,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:21,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:21,010 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 22:42:21,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:21,365 INFO L93 Difference]: Finished difference Result 1106 states and 2712 transitions. [2021-10-05 22:42:21,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 22:42:21,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 22:42:21,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:21,368 INFO L225 Difference]: With dead ends: 1106 [2021-10-05 22:42:21,368 INFO L226 Difference]: Without dead ends: 1022 [2021-10-05 22:42:21,368 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 132.1ms TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:42:21,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2021-10-05 22:42:21,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1008. [2021-10-05 22:42:21,390 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 22:42:21,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 2497 transitions. [2021-10-05 22:42:21,393 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 2497 transitions. Word has length 38 [2021-10-05 22:42:21,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:21,394 INFO L470 AbstractCegarLoop]: Abstraction has 1008 states and 2497 transitions. [2021-10-05 22:42:21,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 22:42:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 2497 transitions. [2021-10-05 22:42:21,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:21,396 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:21,397 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:21,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2021-10-05 22:42:21,397 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 22:42:21,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:21,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1536914695, now seen corresponding path program 142 times [2021-10-05 22:42:21,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:21,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315391532] [2021-10-05 22:42:21,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:21,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:21,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 22:42:21,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:21,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315391532] [2021-10-05 22:42:21,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315391532] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:21,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:21,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:21,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499722440] [2021-10-05 22:42:21,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:21,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:21,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:21,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:21,536 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 22:42:21,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:21,869 INFO L93 Difference]: Finished difference Result 1034 states and 2540 transitions. [2021-10-05 22:42:21,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:42:21,870 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 22:42:21,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:21,872 INFO L225 Difference]: With dead ends: 1034 [2021-10-05 22:42:21,872 INFO L226 Difference]: Without dead ends: 1020 [2021-10-05 22:42:21,872 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 167.1ms TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2021-10-05 22:42:21,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1010. [2021-10-05 22:42:21,884 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 22:42:21,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 2500 transitions. [2021-10-05 22:42:21,886 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 2500 transitions. Word has length 38 [2021-10-05 22:42:21,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:21,887 INFO L470 AbstractCegarLoop]: Abstraction has 1010 states and 2500 transitions. [2021-10-05 22:42:21,887 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 22:42:21,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 2500 transitions. [2021-10-05 22:42:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:21,888 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:21,889 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:21,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2021-10-05 22:42:21,889 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 22:42:21,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:21,889 INFO L82 PathProgramCache]: Analyzing trace with hash 124690559, now seen corresponding path program 143 times [2021-10-05 22:42:21,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:21,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304919694] [2021-10-05 22:42:21,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:21,890 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:22,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:22,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304919694] [2021-10-05 22:42:22,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304919694] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:22,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:22,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:22,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532026448] [2021-10-05 22:42:22,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:22,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:22,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:22,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:22,040 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 22:42:22,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:22,465 INFO L93 Difference]: Finished difference Result 1436 states and 3521 transitions. [2021-10-05 22:42:22,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 22:42:22,466 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 22:42:22,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:22,468 INFO L225 Difference]: With dead ends: 1436 [2021-10-05 22:42:22,468 INFO L226 Difference]: Without dead ends: 1344 [2021-10-05 22:42:22,468 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 169.6ms TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:42:22,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2021-10-05 22:42:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1026. [2021-10-05 22:42:22,482 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 22:42:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 2554 transitions. [2021-10-05 22:42:22,484 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 2554 transitions. Word has length 38 [2021-10-05 22:42:22,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:22,484 INFO L470 AbstractCegarLoop]: Abstraction has 1026 states and 2554 transitions. [2021-10-05 22:42:22,484 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 22:42:22,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 2554 transitions. [2021-10-05 22:42:22,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:22,486 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:22,486 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:22,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2021-10-05 22:42:22,486 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 22:42:22,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:22,486 INFO L82 PathProgramCache]: Analyzing trace with hash 235249013, now seen corresponding path program 144 times [2021-10-05 22:42:22,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:22,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775750779] [2021-10-05 22:42:22,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:22,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:22,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:22,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775750779] [2021-10-05 22:42:22,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775750779] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:22,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:22,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:22,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916824008] [2021-10-05 22:42:22,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:22,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:22,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:22,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:22,602 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 22:42:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:22,945 INFO L93 Difference]: Finished difference Result 1064 states and 2621 transitions. [2021-10-05 22:42:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:42:22,945 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 22:42:22,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:22,947 INFO L225 Difference]: With dead ends: 1064 [2021-10-05 22:42:22,947 INFO L226 Difference]: Without dead ends: 1034 [2021-10-05 22:42:22,948 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 131.5ms TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:22,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2021-10-05 22:42:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1018. [2021-10-05 22:42:22,959 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 22:42:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 2536 transitions. [2021-10-05 22:42:22,961 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 2536 transitions. Word has length 38 [2021-10-05 22:42:22,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:22,961 INFO L470 AbstractCegarLoop]: Abstraction has 1018 states and 2536 transitions. [2021-10-05 22:42:22,962 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 22:42:22,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 2536 transitions. [2021-10-05 22:42:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:22,964 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:22,964 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:22,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2021-10-05 22:42:22,965 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 22:42:22,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:22,965 INFO L82 PathProgramCache]: Analyzing trace with hash 391321037, now seen corresponding path program 145 times [2021-10-05 22:42:22,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:22,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088809332] [2021-10-05 22:42:22,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:22,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:23,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:23,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088809332] [2021-10-05 22:42:23,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088809332] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:23,092 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:23,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:23,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615846823] [2021-10-05 22:42:23,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:23,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:23,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:23,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:23,094 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 22:42:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:23,452 INFO L93 Difference]: Finished difference Result 1122 states and 2742 transitions. [2021-10-05 22:42:23,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:42:23,453 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 22:42:23,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:23,455 INFO L225 Difference]: With dead ends: 1122 [2021-10-05 22:42:23,455 INFO L226 Difference]: Without dead ends: 1110 [2021-10-05 22:42:23,455 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 168.2ms TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:23,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2021-10-05 22:42:23,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1024. [2021-10-05 22:42:23,468 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 22:42:23,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 2545 transitions. [2021-10-05 22:42:23,470 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 2545 transitions. Word has length 38 [2021-10-05 22:42:23,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:23,470 INFO L470 AbstractCegarLoop]: Abstraction has 1024 states and 2545 transitions. [2021-10-05 22:42:23,470 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 22:42:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 2545 transitions. [2021-10-05 22:42:23,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:23,472 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:23,472 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:23,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2021-10-05 22:42:23,472 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 22:42:23,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:23,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1788898787, now seen corresponding path program 146 times [2021-10-05 22:42:23,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:23,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481161628] [2021-10-05 22:42:23,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:23,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:23,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:23,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481161628] [2021-10-05 22:42:23,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481161628] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:23,593 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:23,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:23,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815923680] [2021-10-05 22:42:23,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:23,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:23,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:23,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:23,595 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 22:42:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:23,967 INFO L93 Difference]: Finished difference Result 1412 states and 3445 transitions. [2021-10-05 22:42:23,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:42:23,968 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 22:42:23,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:23,970 INFO L225 Difference]: With dead ends: 1412 [2021-10-05 22:42:23,970 INFO L226 Difference]: Without dead ends: 1404 [2021-10-05 22:42:23,970 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 138.2ms TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:42:23,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2021-10-05 22:42:23,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1026. [2021-10-05 22:42:23,987 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 22:42:23,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 2548 transitions. [2021-10-05 22:42:23,989 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 2548 transitions. Word has length 38 [2021-10-05 22:42:23,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:23,989 INFO L470 AbstractCegarLoop]: Abstraction has 1026 states and 2548 transitions. [2021-10-05 22:42:23,989 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 22:42:23,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 2548 transitions. [2021-10-05 22:42:23,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:23,992 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:23,992 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:23,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2021-10-05 22:42:23,993 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 22:42:23,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:23,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1983330751, now seen corresponding path program 147 times [2021-10-05 22:42:23,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:23,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529073443] [2021-10-05 22:42:23,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:23,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:24,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:24,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:24,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529073443] [2021-10-05 22:42:24,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529073443] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:24,124 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:24,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:24,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080026286] [2021-10-05 22:42:24,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:24,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:24,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:24,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:24,126 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 22:42:24,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:24,584 INFO L93 Difference]: Finished difference Result 1476 states and 3573 transitions. [2021-10-05 22:42:24,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:42:24,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 22:42:24,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:24,586 INFO L225 Difference]: With dead ends: 1476 [2021-10-05 22:42:24,586 INFO L226 Difference]: Without dead ends: 1462 [2021-10-05 22:42:24,587 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 170.4ms TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:24,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2021-10-05 22:42:24,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1018. [2021-10-05 22:42:24,602 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 22:42:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 2530 transitions. [2021-10-05 22:42:24,603 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 2530 transitions. Word has length 38 [2021-10-05 22:42:24,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:24,604 INFO L470 AbstractCegarLoop]: Abstraction has 1018 states and 2530 transitions. [2021-10-05 22:42:24,604 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 22:42:24,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 2530 transitions. [2021-10-05 22:42:24,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:24,605 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:24,605 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:24,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2021-10-05 22:42:24,606 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 22:42:24,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:24,606 INFO L82 PathProgramCache]: Analyzing trace with hash 230901709, now seen corresponding path program 148 times [2021-10-05 22:42:24,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:24,606 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033992301] [2021-10-05 22:42:24,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:24,606 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:24,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:24,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033992301] [2021-10-05 22:42:24,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033992301] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:24,724 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:24,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:24,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117242933] [2021-10-05 22:42:24,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:24,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:24,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:24,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:24,725 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 22:42:25,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:25,082 INFO L93 Difference]: Finished difference Result 1338 states and 3310 transitions. [2021-10-05 22:42:25,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:42:25,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 22:42:25,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:25,085 INFO L225 Difference]: With dead ends: 1338 [2021-10-05 22:42:25,085 INFO L226 Difference]: Without dead ends: 1330 [2021-10-05 22:42:25,085 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 157.8ms TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:42:25,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2021-10-05 22:42:25,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1020. [2021-10-05 22:42:25,097 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 22:42:25,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2533 transitions. [2021-10-05 22:42:25,099 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2533 transitions. Word has length 38 [2021-10-05 22:42:25,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:25,099 INFO L470 AbstractCegarLoop]: Abstraction has 1020 states and 2533 transitions. [2021-10-05 22:42:25,099 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 22:42:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2533 transitions. [2021-10-05 22:42:25,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:25,101 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:25,101 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:25,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2021-10-05 22:42:25,101 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 22:42:25,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:25,101 INFO L82 PathProgramCache]: Analyzing trace with hash 36469745, now seen corresponding path program 149 times [2021-10-05 22:42:25,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:25,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713989781] [2021-10-05 22:42:25,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:25,102 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:25,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 22:42:25,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:25,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713989781] [2021-10-05 22:42:25,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713989781] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:25,222 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:25,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:25,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918163202] [2021-10-05 22:42:25,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:25,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:25,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:25,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:25,223 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 22:42:25,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:25,622 INFO L93 Difference]: Finished difference Result 1334 states and 3294 transitions. [2021-10-05 22:42:25,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:42:25,623 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 22:42:25,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:25,625 INFO L225 Difference]: With dead ends: 1334 [2021-10-05 22:42:25,625 INFO L226 Difference]: Without dead ends: 1326 [2021-10-05 22:42:25,625 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 173.8ms TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:42:25,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2021-10-05 22:42:25,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1018. [2021-10-05 22:42:25,639 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 22:42:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 2528 transitions. [2021-10-05 22:42:25,640 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 2528 transitions. Word has length 38 [2021-10-05 22:42:25,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:25,641 INFO L470 AbstractCegarLoop]: Abstraction has 1018 states and 2528 transitions. [2021-10-05 22:42:25,641 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 22:42:25,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 2528 transitions. [2021-10-05 22:42:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:25,642 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:25,642 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:25,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2021-10-05 22:42:25,643 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 22:42:25,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:25,643 INFO L82 PathProgramCache]: Analyzing trace with hash 159225549, now seen corresponding path program 150 times [2021-10-05 22:42:25,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:25,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248304686] [2021-10-05 22:42:25,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:25,643 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:25,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:25,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:25,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248304686] [2021-10-05 22:42:25,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248304686] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:25,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:25,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:25,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146637259] [2021-10-05 22:42:25,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:25,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:25,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:25,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:25,768 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 22:42:26,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:26,094 INFO L93 Difference]: Finished difference Result 1368 states and 3371 transitions. [2021-10-05 22:42:26,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:42:26,095 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 22:42:26,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:26,097 INFO L225 Difference]: With dead ends: 1368 [2021-10-05 22:42:26,097 INFO L226 Difference]: Without dead ends: 1360 [2021-10-05 22:42:26,097 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 138.6ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:42:26,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2021-10-05 22:42:26,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1020. [2021-10-05 22:42:26,112 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 22:42:26,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2531 transitions. [2021-10-05 22:42:26,114 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2531 transitions. Word has length 38 [2021-10-05 22:42:26,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:26,115 INFO L470 AbstractCegarLoop]: Abstraction has 1020 states and 2531 transitions. [2021-10-05 22:42:26,115 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 22:42:26,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2531 transitions. [2021-10-05 22:42:26,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:26,117 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:26,117 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:26,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2021-10-05 22:42:26,117 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 22:42:26,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:26,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1626398839, now seen corresponding path program 151 times [2021-10-05 22:42:26,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:26,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647210262] [2021-10-05 22:42:26,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:26,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:26,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:26,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:26,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647210262] [2021-10-05 22:42:26,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647210262] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:26,250 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:26,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:26,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103772000] [2021-10-05 22:42:26,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:26,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:26,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:26,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:26,251 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 22:42:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:26,650 INFO L93 Difference]: Finished difference Result 1380 states and 3395 transitions. [2021-10-05 22:42:26,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:42:26,651 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 22:42:26,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:26,653 INFO L225 Difference]: With dead ends: 1380 [2021-10-05 22:42:26,653 INFO L226 Difference]: Without dead ends: 1300 [2021-10-05 22:42:26,654 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 157.1ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:42:26,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2021-10-05 22:42:26,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1018. [2021-10-05 22:42:26,668 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 22:42:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 2518 transitions. [2021-10-05 22:42:26,670 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 2518 transitions. Word has length 38 [2021-10-05 22:42:26,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:26,670 INFO L470 AbstractCegarLoop]: Abstraction has 1018 states and 2518 transitions. [2021-10-05 22:42:26,671 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 22:42:26,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 2518 transitions. [2021-10-05 22:42:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:26,673 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:26,673 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:26,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2021-10-05 22:42:26,674 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 22:42:26,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:26,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1767630003, now seen corresponding path program 152 times [2021-10-05 22:42:26,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:26,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640942559] [2021-10-05 22:42:26,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:26,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:26,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 22:42:26,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:26,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640942559] [2021-10-05 22:42:26,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640942559] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:26,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:26,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:26,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450278861] [2021-10-05 22:42:26,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:26,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:26,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:26,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:26,811 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 22:42:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:27,272 INFO L93 Difference]: Finished difference Result 1218 states and 2942 transitions. [2021-10-05 22:42:27,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 22:42:27,273 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 22:42:27,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:27,275 INFO L225 Difference]: With dead ends: 1218 [2021-10-05 22:42:27,275 INFO L226 Difference]: Without dead ends: 1124 [2021-10-05 22:42:27,275 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 192.1ms TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:42:27,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2021-10-05 22:42:27,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 984. [2021-10-05 22:42:27,288 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 22:42:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 2423 transitions. [2021-10-05 22:42:27,289 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 2423 transitions. Word has length 38 [2021-10-05 22:42:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:27,290 INFO L470 AbstractCegarLoop]: Abstraction has 984 states and 2423 transitions. [2021-10-05 22:42:27,290 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 22:42:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 2423 transitions. [2021-10-05 22:42:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:27,291 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:27,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 22:42:27,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2021-10-05 22:42:27,292 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 22:42:27,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:27,292 INFO L82 PathProgramCache]: Analyzing trace with hash 896583665, now seen corresponding path program 153 times [2021-10-05 22:42:27,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:27,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569318754] [2021-10-05 22:42:27,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:27,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:27,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:27,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:27,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569318754] [2021-10-05 22:42:27,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569318754] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:27,431 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:27,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:27,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212895355] [2021-10-05 22:42:27,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:27,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:27,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:27,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:27,433 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 22:42:27,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:27,811 INFO L93 Difference]: Finished difference Result 1042 states and 2530 transitions. [2021-10-05 22:42:27,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 22:42:27,812 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 22:42:27,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:27,814 INFO L225 Difference]: With dead ends: 1042 [2021-10-05 22:42:27,814 INFO L226 Difference]: Without dead ends: 1022 [2021-10-05 22:42:27,814 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 161.1ms TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:42:27,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2021-10-05 22:42:27,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 990. [2021-10-05 22:42:27,825 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 22:42:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 2432 transitions. [2021-10-05 22:42:27,827 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 2432 transitions. Word has length 38 [2021-10-05 22:42:27,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:27,827 INFO L470 AbstractCegarLoop]: Abstraction has 990 states and 2432 transitions. [2021-10-05 22:42:27,827 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 22:42:27,827 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 2432 transitions. [2021-10-05 22:42:27,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:27,828 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:27,828 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:27,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2021-10-05 22:42:27,829 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 22:42:27,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:27,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1471265555, now seen corresponding path program 154 times [2021-10-05 22:42:27,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:27,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804933135] [2021-10-05 22:42:27,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:27,829 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:27,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:27,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:27,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804933135] [2021-10-05 22:42:27,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804933135] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:27,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:27,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:27,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778092647] [2021-10-05 22:42:27,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:27,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:27,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:27,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:27,954 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 22:42:28,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:28,456 INFO L93 Difference]: Finished difference Result 1108 states and 2577 transitions. [2021-10-05 22:42:28,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 22:42:28,456 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 22:42:28,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:28,459 INFO L225 Difference]: With dead ends: 1108 [2021-10-05 22:42:28,459 INFO L226 Difference]: Without dead ends: 974 [2021-10-05 22:42:28,459 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 179.9ms TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:42:28,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2021-10-05 22:42:28,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 754. [2021-10-05 22:42:28,474 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 22:42:28,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1828 transitions. [2021-10-05 22:42:28,477 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1828 transitions. Word has length 38 [2021-10-05 22:42:28,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:28,477 INFO L470 AbstractCegarLoop]: Abstraction has 754 states and 1828 transitions. [2021-10-05 22:42:28,477 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 22:42:28,478 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1828 transitions. [2021-10-05 22:42:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:28,479 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:28,479 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:28,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2021-10-05 22:42:28,480 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 22:42:28,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:28,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1513621633, now seen corresponding path program 155 times [2021-10-05 22:42:28,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:28,481 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742536980] [2021-10-05 22:42:28,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:28,481 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:28,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:28,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:28,608 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742536980] [2021-10-05 22:42:28,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742536980] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:28,609 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:28,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:28,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523437192] [2021-10-05 22:42:28,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:28,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:28,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:28,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:28,610 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 22:42:28,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:28,924 INFO L93 Difference]: Finished difference Result 768 states and 1847 transitions. [2021-10-05 22:42:28,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:42:28,925 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 22:42:28,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:28,926 INFO L225 Difference]: With dead ends: 768 [2021-10-05 22:42:28,926 INFO L226 Difference]: Without dead ends: 756 [2021-10-05 22:42:28,926 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 163.9ms TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:28,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2021-10-05 22:42:28,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 754. [2021-10-05 22:42:28,934 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 22:42:28,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1822 transitions. [2021-10-05 22:42:28,935 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1822 transitions. Word has length 38 [2021-10-05 22:42:28,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:28,936 INFO L470 AbstractCegarLoop]: Abstraction has 754 states and 1822 transitions. [2021-10-05 22:42:28,936 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 22:42:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1822 transitions. [2021-10-05 22:42:28,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:28,937 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:28,937 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:28,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2021-10-05 22:42:28,937 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 22:42:28,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:28,938 INFO L82 PathProgramCache]: Analyzing trace with hash -666598191, now seen corresponding path program 156 times [2021-10-05 22:42:28,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:28,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107373251] [2021-10-05 22:42:28,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:28,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:29,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:29,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107373251] [2021-10-05 22:42:29,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107373251] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:29,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:29,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:29,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68552618] [2021-10-05 22:42:29,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:29,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:29,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:29,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:29,060 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 22:42:29,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:29,468 INFO L93 Difference]: Finished difference Result 962 states and 2282 transitions. [2021-10-05 22:42:29,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:42:29,469 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 22:42:29,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:29,471 INFO L225 Difference]: With dead ends: 962 [2021-10-05 22:42:29,471 INFO L226 Difference]: Without dead ends: 954 [2021-10-05 22:42:29,471 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 157.8ms TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:42:29,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2021-10-05 22:42:29,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 754. [2021-10-05 22:42:29,480 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 22:42:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1820 transitions. [2021-10-05 22:42:29,482 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1820 transitions. Word has length 38 [2021-10-05 22:42:29,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:29,482 INFO L470 AbstractCegarLoop]: Abstraction has 754 states and 1820 transitions. [2021-10-05 22:42:29,482 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 22:42:29,482 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1820 transitions. [2021-10-05 22:42:29,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:29,483 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:29,483 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:29,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2021-10-05 22:42:29,484 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 22:42:29,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:29,484 INFO L82 PathProgramCache]: Analyzing trace with hash -861030155, now seen corresponding path program 157 times [2021-10-05 22:42:29,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:29,484 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304032575] [2021-10-05 22:42:29,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:29,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:29,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:29,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:29,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304032575] [2021-10-05 22:42:29,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304032575] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:29,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:29,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:29,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169539270] [2021-10-05 22:42:29,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:29,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:29,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:29,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:29,608 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 22:42:29,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:29,917 INFO L93 Difference]: Finished difference Result 760 states and 1827 transitions. [2021-10-05 22:42:29,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:42:29,918 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 22:42:29,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:29,919 INFO L225 Difference]: With dead ends: 760 [2021-10-05 22:42:29,920 INFO L226 Difference]: Without dead ends: 746 [2021-10-05 22:42:29,920 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 150.9ms TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:42:29,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2021-10-05 22:42:29,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2021-10-05 22:42:29,929 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 22:42:29,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1806 transitions. [2021-10-05 22:42:29,930 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1806 transitions. Word has length 38 [2021-10-05 22:42:29,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:29,930 INFO L470 AbstractCegarLoop]: Abstraction has 746 states and 1806 transitions. [2021-10-05 22:42:29,930 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 22:42:29,930 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1806 transitions. [2021-10-05 22:42:29,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:29,931 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:29,931 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:29,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2021-10-05 22:42:29,932 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 22:42:29,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:29,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1726595697, now seen corresponding path program 158 times [2021-10-05 22:42:29,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:29,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388778668] [2021-10-05 22:42:29,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:29,933 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:30,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:30,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:30,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388778668] [2021-10-05 22:42:30,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388778668] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:30,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:30,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:30,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921548417] [2021-10-05 22:42:30,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:30,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:30,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:30,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:30,061 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 22:42:30,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:30,355 INFO L93 Difference]: Finished difference Result 760 states and 1825 transitions. [2021-10-05 22:42:30,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:42:30,355 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 22:42:30,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:30,357 INFO L225 Difference]: With dead ends: 760 [2021-10-05 22:42:30,357 INFO L226 Difference]: Without dead ends: 744 [2021-10-05 22:42:30,357 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 165.8ms TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:42:30,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2021-10-05 22:42:30,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2021-10-05 22:42:30,366 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 22:42:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1801 transitions. [2021-10-05 22:42:30,367 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1801 transitions. Word has length 38 [2021-10-05 22:42:30,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:30,367 INFO L470 AbstractCegarLoop]: Abstraction has 744 states and 1801 transitions. [2021-10-05 22:42:30,367 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 22:42:30,367 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1801 transitions. [2021-10-05 22:42:30,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:30,368 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:30,368 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:30,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2021-10-05 22:42:30,369 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 22:42:30,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:30,369 INFO L82 PathProgramCache]: Analyzing trace with hash -311268095, now seen corresponding path program 159 times [2021-10-05 22:42:30,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:30,369 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209773582] [2021-10-05 22:42:30,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:30,369 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:30,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 22:42:30,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:30,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209773582] [2021-10-05 22:42:30,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209773582] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:30,505 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:30,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:30,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122601217] [2021-10-05 22:42:30,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:30,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:30,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:30,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:30,506 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 22:42:30,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:30,834 INFO L93 Difference]: Finished difference Result 766 states and 1836 transitions. [2021-10-05 22:42:30,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:42:30,835 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 22:42:30,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:30,836 INFO L225 Difference]: With dead ends: 766 [2021-10-05 22:42:30,836 INFO L226 Difference]: Without dead ends: 746 [2021-10-05 22:42:30,837 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 186.5ms TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:42:30,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2021-10-05 22:42:30,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2021-10-05 22:42:30,845 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 22:42:30,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1795 transitions. [2021-10-05 22:42:30,846 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1795 transitions. Word has length 38 [2021-10-05 22:42:30,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:30,847 INFO L470 AbstractCegarLoop]: Abstraction has 744 states and 1795 transitions. [2021-10-05 22:42:30,847 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 22:42:30,847 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1795 transitions. [2021-10-05 22:42:30,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:30,848 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:30,848 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:30,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2021-10-05 22:42:30,848 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 22:42:30,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:30,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1139360081, now seen corresponding path program 160 times [2021-10-05 22:42:30,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:30,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993198237] [2021-10-05 22:42:30,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:30,849 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:30,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:30,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993198237] [2021-10-05 22:42:30,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993198237] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:30,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:30,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:30,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697202685] [2021-10-05 22:42:30,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:30,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:30,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:30,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:30,992 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 22:42:31,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:31,277 INFO L93 Difference]: Finished difference Result 758 states and 1818 transitions. [2021-10-05 22:42:31,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:42:31,278 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 22:42:31,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:31,280 INFO L225 Difference]: With dead ends: 758 [2021-10-05 22:42:31,280 INFO L226 Difference]: Without dead ends: 744 [2021-10-05 22:42:31,280 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 175.4ms TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:31,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2021-10-05 22:42:31,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2021-10-05 22:42:31,288 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 22:42:31,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1793 transitions. [2021-10-05 22:42:31,289 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1793 transitions. Word has length 38 [2021-10-05 22:42:31,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:31,290 INFO L470 AbstractCegarLoop]: Abstraction has 744 states and 1793 transitions. [2021-10-05 22:42:31,290 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 22:42:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1793 transitions. [2021-10-05 22:42:31,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:31,291 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:31,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 22:42:31,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2021-10-05 22:42:31,291 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 22:42:31,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:31,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1494001961, now seen corresponding path program 161 times [2021-10-05 22:42:31,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:31,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132790491] [2021-10-05 22:42:31,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:31,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:31,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:31,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132790491] [2021-10-05 22:42:31,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132790491] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:31,429 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:31,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:31,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401222975] [2021-10-05 22:42:31,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:31,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:31,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:31,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:31,431 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 22:42:31,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:31,856 INFO L93 Difference]: Finished difference Result 922 states and 2194 transitions. [2021-10-05 22:42:31,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:42:31,856 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 22:42:31,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:31,858 INFO L225 Difference]: With dead ends: 922 [2021-10-05 22:42:31,859 INFO L226 Difference]: Without dead ends: 896 [2021-10-05 22:42:31,859 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 175.8ms TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:42:31,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2021-10-05 22:42:31,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 736. [2021-10-05 22:42:31,868 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 22:42:31,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1779 transitions. [2021-10-05 22:42:31,869 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1779 transitions. Word has length 38 [2021-10-05 22:42:31,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:31,869 INFO L470 AbstractCegarLoop]: Abstraction has 736 states and 1779 transitions. [2021-10-05 22:42:31,870 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 22:42:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1779 transitions. [2021-10-05 22:42:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:31,871 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:31,871 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:31,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2021-10-05 22:42:31,871 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 22:42:31,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:31,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1383443507, now seen corresponding path program 162 times [2021-10-05 22:42:31,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:31,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249404517] [2021-10-05 22:42:31,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:31,872 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:32,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:32,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249404517] [2021-10-05 22:42:32,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249404517] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:32,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:32,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:32,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644798990] [2021-10-05 22:42:32,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:32,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:32,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:32,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:32,014 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 22:42:32,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:32,298 INFO L93 Difference]: Finished difference Result 748 states and 1799 transitions. [2021-10-05 22:42:32,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:42:32,299 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 22:42:32,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:32,300 INFO L225 Difference]: With dead ends: 748 [2021-10-05 22:42:32,300 INFO L226 Difference]: Without dead ends: 716 [2021-10-05 22:42:32,301 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 182.8ms TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:32,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-10-05 22:42:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2021-10-05 22:42:32,308 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 22:42:32,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1743 transitions. [2021-10-05 22:42:32,309 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1743 transitions. Word has length 38 [2021-10-05 22:42:32,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:32,310 INFO L470 AbstractCegarLoop]: Abstraction has 716 states and 1743 transitions. [2021-10-05 22:42:32,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 22:42:32,310 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1743 transitions. [2021-10-05 22:42:32,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:32,311 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:32,311 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:32,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2021-10-05 22:42:32,311 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 22:42:32,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:32,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1304373613, now seen corresponding path program 163 times [2021-10-05 22:42:32,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:32,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955588420] [2021-10-05 22:42:32,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:32,312 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:32,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:32,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:32,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955588420] [2021-10-05 22:42:32,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955588420] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:32,429 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:32,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:32,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304981234] [2021-10-05 22:42:32,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:32,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:32,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:32,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:32,431 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 22:42:32,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:32,912 INFO L93 Difference]: Finished difference Result 1220 states and 3020 transitions. [2021-10-05 22:42:32,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 22:42:32,912 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 22:42:32,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:32,915 INFO L225 Difference]: With dead ends: 1220 [2021-10-05 22:42:32,915 INFO L226 Difference]: Without dead ends: 1208 [2021-10-05 22:42:32,915 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 230.4ms TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:42:32,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2021-10-05 22:42:32,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 742. [2021-10-05 22:42:32,925 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 22:42:32,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1816 transitions. [2021-10-05 22:42:32,926 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1816 transitions. Word has length 38 [2021-10-05 22:42:32,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:32,926 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 1816 transitions. [2021-10-05 22:42:32,926 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 22:42:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1816 transitions. [2021-10-05 22:42:32,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:32,927 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:32,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 22:42:32,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2021-10-05 22:42:32,928 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 22:42:32,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:32,928 INFO L82 PathProgramCache]: Analyzing trace with hash 378487811, now seen corresponding path program 164 times [2021-10-05 22:42:32,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:32,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518419916] [2021-10-05 22:42:32,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:32,929 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:33,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:33,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518419916] [2021-10-05 22:42:33,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518419916] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:33,027 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:33,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:42:33,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420010859] [2021-10-05 22:42:33,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:42:33,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:33,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:42:33,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:42:33,028 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 22:42:33,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:33,294 INFO L93 Difference]: Finished difference Result 1022 states and 2511 transitions. [2021-10-05 22:42:33,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:42:33,295 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 22:42:33,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:33,296 INFO L225 Difference]: With dead ends: 1022 [2021-10-05 22:42:33,296 INFO L226 Difference]: Without dead ends: 936 [2021-10-05 22:42:33,297 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 128.2ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-10-05 22:42:33,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2021-10-05 22:42:33,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 748. [2021-10-05 22:42:33,305 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 22:42:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1811 transitions. [2021-10-05 22:42:33,307 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1811 transitions. Word has length 38 [2021-10-05 22:42:33,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:33,307 INFO L470 AbstractCegarLoop]: Abstraction has 748 states and 1811 transitions. [2021-10-05 22:42:33,307 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 22:42:33,307 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1811 transitions. [2021-10-05 22:42:33,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:33,308 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:33,308 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:33,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2021-10-05 22:42:33,309 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 22:42:33,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:33,309 INFO L82 PathProgramCache]: Analyzing trace with hash 810373859, now seen corresponding path program 165 times [2021-10-05 22:42:33,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:33,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480620253] [2021-10-05 22:42:33,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:33,309 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:33,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 22:42:33,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:33,417 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480620253] [2021-10-05 22:42:33,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480620253] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:33,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:33,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:33,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025374409] [2021-10-05 22:42:33,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:33,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:33,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:33,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:33,419 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 22:42:33,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:33,836 INFO L93 Difference]: Finished difference Result 1270 states and 3034 transitions. [2021-10-05 22:42:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 22:42:33,836 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 22:42:33,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:33,839 INFO L225 Difference]: With dead ends: 1270 [2021-10-05 22:42:33,839 INFO L226 Difference]: Without dead ends: 1262 [2021-10-05 22:42:33,839 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 197.7ms TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:42:33,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2021-10-05 22:42:33,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 750. [2021-10-05 22:42:33,850 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 22:42:33,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1814 transitions. [2021-10-05 22:42:33,851 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1814 transitions. Word has length 38 [2021-10-05 22:42:33,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:33,852 INFO L470 AbstractCegarLoop]: Abstraction has 750 states and 1814 transitions. [2021-10-05 22:42:33,852 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 22:42:33,852 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1814 transitions. [2021-10-05 22:42:33,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:33,853 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:33,853 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:33,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2021-10-05 22:42:33,853 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 22:42:33,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:33,854 INFO L82 PathProgramCache]: Analyzing trace with hash 615941895, now seen corresponding path program 166 times [2021-10-05 22:42:33,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:33,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175245088] [2021-10-05 22:42:33,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:33,854 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:33,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:33,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175245088] [2021-10-05 22:42:33,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175245088] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:33,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:33,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:33,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183721923] [2021-10-05 22:42:33,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:33,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:33,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:33,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:33,971 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 22:42:34,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:34,488 INFO L93 Difference]: Finished difference Result 1308 states and 3107 transitions. [2021-10-05 22:42:34,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 22:42:34,489 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 22:42:34,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:34,491 INFO L225 Difference]: With dead ends: 1308 [2021-10-05 22:42:34,491 INFO L226 Difference]: Without dead ends: 1294 [2021-10-05 22:42:34,492 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 260.5ms TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2021-10-05 22:42:34,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2021-10-05 22:42:34,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 742. [2021-10-05 22:42:34,503 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 22:42:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1796 transitions. [2021-10-05 22:42:34,504 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1796 transitions. Word has length 38 [2021-10-05 22:42:34,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:34,504 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 1796 transitions. [2021-10-05 22:42:34,504 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 22:42:34,505 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1796 transitions. [2021-10-05 22:42:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:34,505 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:34,506 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:34,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2021-10-05 22:42:34,506 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 22:42:34,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:34,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1464792941, now seen corresponding path program 167 times [2021-10-05 22:42:34,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:34,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593100915] [2021-10-05 22:42:34,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:34,507 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:34,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 22:42:34,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:34,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593100915] [2021-10-05 22:42:34,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593100915] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:34,611 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:34,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:34,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145079531] [2021-10-05 22:42:34,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:34,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:34,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:34,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:34,613 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 22:42:35,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:35,011 INFO L93 Difference]: Finished difference Result 1154 states and 2784 transitions. [2021-10-05 22:42:35,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 22:42:35,012 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 22:42:35,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:35,015 INFO L225 Difference]: With dead ends: 1154 [2021-10-05 22:42:35,015 INFO L226 Difference]: Without dead ends: 1146 [2021-10-05 22:42:35,015 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 186.3ms TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2021-10-05 22:42:35,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2021-10-05 22:42:35,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 742. [2021-10-05 22:42:35,031 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 22:42:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1794 transitions. [2021-10-05 22:42:35,034 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1794 transitions. Word has length 38 [2021-10-05 22:42:35,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:35,034 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 1794 transitions. [2021-10-05 22:42:35,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 22:42:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1794 transitions. [2021-10-05 22:42:35,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:35,036 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:35,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 22:42:35,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2021-10-05 22:42:35,037 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 22:42:35,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:35,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1659224905, now seen corresponding path program 168 times [2021-10-05 22:42:35,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:35,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250976468] [2021-10-05 22:42:35,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:35,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42: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 22:42:35,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:35,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250976468] [2021-10-05 22:42:35,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250976468] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:35,165 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:35,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:35,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653575710] [2021-10-05 22:42:35,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:35,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:35,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:35,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:35,167 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 22:42:35,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:35,683 INFO L93 Difference]: Finished difference Result 1160 states and 2793 transitions. [2021-10-05 22:42:35,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 22:42:35,684 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 22:42:35,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:35,687 INFO L225 Difference]: With dead ends: 1160 [2021-10-05 22:42:35,687 INFO L226 Difference]: Without dead ends: 1152 [2021-10-05 22:42:35,687 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 257.1ms TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2021-10-05 22:42:35,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2021-10-05 22:42:35,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 740. [2021-10-05 22:42:35,697 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 22:42:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1789 transitions. [2021-10-05 22:42:35,698 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1789 transitions. Word has length 38 [2021-10-05 22:42:35,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:35,698 INFO L470 AbstractCegarLoop]: Abstraction has 740 states and 1789 transitions. [2021-10-05 22:42:35,699 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 22:42:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1789 transitions. [2021-10-05 22:42:35,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:35,700 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:35,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 22:42:35,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2021-10-05 22:42:35,700 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 22:42:35,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:35,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1536469101, now seen corresponding path program 169 times [2021-10-05 22:42:35,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:35,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851627258] [2021-10-05 22:42:35,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:35,701 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:35,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:35,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:35,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851627258] [2021-10-05 22:42:35,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851627258] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:35,802 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:35,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:35,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696459355] [2021-10-05 22:42:35,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:35,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:35,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:35,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:35,804 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 22:42:36,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:36,192 INFO L93 Difference]: Finished difference Result 974 states and 2300 transitions. [2021-10-05 22:42:36,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:42:36,193 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 22:42:36,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:36,195 INFO L225 Difference]: With dead ends: 974 [2021-10-05 22:42:36,195 INFO L226 Difference]: Without dead ends: 966 [2021-10-05 22:42:36,195 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 157.5ms TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:36,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2021-10-05 22:42:36,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 742. [2021-10-05 22:42:36,204 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 22:42:36,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1792 transitions. [2021-10-05 22:42:36,205 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1792 transitions. Word has length 38 [2021-10-05 22:42:36,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:36,205 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 1792 transitions. [2021-10-05 22:42:36,205 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 22:42:36,206 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1792 transitions. [2021-10-05 22:42:36,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:36,207 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:36,207 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:36,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2021-10-05 22:42:36,207 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 22:42:36,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:36,208 INFO L82 PathProgramCache]: Analyzing trace with hash -69295811, now seen corresponding path program 170 times [2021-10-05 22:42:36,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:36,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659598574] [2021-10-05 22:42:36,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:36,208 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:36,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:36,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659598574] [2021-10-05 22:42:36,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659598574] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:36,324 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:36,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:36,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341768248] [2021-10-05 22:42:36,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:36,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:36,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:36,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:36,327 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 22:42:36,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:36,767 INFO L93 Difference]: Finished difference Result 980 states and 2317 transitions. [2021-10-05 22:42:36,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 22:42:36,768 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 22:42:36,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:36,770 INFO L225 Difference]: With dead ends: 980 [2021-10-05 22:42:36,770 INFO L226 Difference]: Without dead ends: 876 [2021-10-05 22:42:36,771 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 207.1ms TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2021-10-05 22:42:36,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2021-10-05 22:42:36,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 722. [2021-10-05 22:42:36,779 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 22:42:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1733 transitions. [2021-10-05 22:42:36,780 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1733 transitions. Word has length 38 [2021-10-05 22:42:36,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:36,781 INFO L470 AbstractCegarLoop]: Abstraction has 722 states and 1733 transitions. [2021-10-05 22:42:36,781 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 22:42:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1733 transitions. [2021-10-05 22:42:36,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:36,782 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:36,782 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:36,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2021-10-05 22:42:36,782 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 22:42:36,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:36,783 INFO L82 PathProgramCache]: Analyzing trace with hash 831642643, now seen corresponding path program 171 times [2021-10-05 22:42:36,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:36,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647969696] [2021-10-05 22:42:36,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:36,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:36,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:36,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:36,915 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647969696] [2021-10-05 22:42:36,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647969696] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:36,916 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:36,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:36,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050640116] [2021-10-05 22:42:36,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:36,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:36,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:36,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:36,918 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 22:42:37,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:37,435 INFO L93 Difference]: Finished difference Result 922 states and 2177 transitions. [2021-10-05 22:42:37,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-05 22:42:37,436 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 22:42:37,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:37,437 INFO L225 Difference]: With dead ends: 922 [2021-10-05 22:42:37,437 INFO L226 Difference]: Without dead ends: 898 [2021-10-05 22:42:37,438 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 292.4ms TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2021-10-05 22:42:37,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2021-10-05 22:42:37,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 720. [2021-10-05 22:42:37,446 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 22:42:37,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1728 transitions. [2021-10-05 22:42:37,448 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1728 transitions. Word has length 38 [2021-10-05 22:42:37,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:37,448 INFO L470 AbstractCegarLoop]: Abstraction has 720 states and 1728 transitions. [2021-10-05 22:42:37,448 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 22:42:37,448 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1728 transitions. [2021-10-05 22:42:37,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:37,449 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:37,449 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:37,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2021-10-05 22:42:37,450 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 22:42:37,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:37,450 INFO L82 PathProgramCache]: Analyzing trace with hash -799110985, now seen corresponding path program 172 times [2021-10-05 22:42:37,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:37,450 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440447534] [2021-10-05 22:42:37,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:37,450 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:37,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:37,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440447534] [2021-10-05 22:42:37,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440447534] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:37,586 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:37,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:37,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013697488] [2021-10-05 22:42:37,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:37,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:37,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:37,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:37,588 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 22:42:38,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:38,174 INFO L93 Difference]: Finished difference Result 704 states and 1561 transitions. [2021-10-05 22:42:38,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-05 22:42:38,175 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 22:42:38,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:38,176 INFO L225 Difference]: With dead ends: 704 [2021-10-05 22:42:38,176 INFO L226 Difference]: Without dead ends: 592 [2021-10-05 22:42:38,176 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 303.1ms TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2021-10-05 22:42:38,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2021-10-05 22:42:38,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 464. [2021-10-05 22:42:38,182 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 22:42:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1059 transitions. [2021-10-05 22:42:38,183 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1059 transitions. Word has length 38 [2021-10-05 22:42:38,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:38,184 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 1059 transitions. [2021-10-05 22:42:38,184 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 22:42:38,184 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1059 transitions. [2021-10-05 22:42:38,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:38,184 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:38,184 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:38,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2021-10-05 22:42:38,185 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 22:42:38,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:38,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1128007091, now seen corresponding path program 173 times [2021-10-05 22:42:38,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:38,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348995699] [2021-10-05 22:42:38,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:38,185 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42: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 22:42:38,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:38,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348995699] [2021-10-05 22:42:38,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348995699] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:38,320 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:38,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:38,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491670338] [2021-10-05 22:42:38,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:38,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:38,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:38,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:38,321 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 22:42:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:38,923 INFO L93 Difference]: Finished difference Result 786 states and 1746 transitions. [2021-10-05 22:42:38,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-05 22:42:38,923 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 22:42:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:38,925 INFO L225 Difference]: With dead ends: 786 [2021-10-05 22:42:38,925 INFO L226 Difference]: Without dead ends: 740 [2021-10-05 22:42:38,925 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 313.5ms TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2021-10-05 22:42:38,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-10-05 22:42:38,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 452. [2021-10-05 22:42:38,931 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 22:42:38,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1035 transitions. [2021-10-05 22:42:38,932 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1035 transitions. Word has length 38 [2021-10-05 22:42:38,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:38,932 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 1035 transitions. [2021-10-05 22:42:38,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 22:42:38,933 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1035 transitions. [2021-10-05 22:42:38,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:38,933 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:38,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 22:42:38,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2021-10-05 22:42:38,934 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 22:42:38,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:38,934 INFO L82 PathProgramCache]: Analyzing trace with hash -182073017, now seen corresponding path program 174 times [2021-10-05 22:42:38,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:38,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135199944] [2021-10-05 22:42:38,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:38,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:39,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:39,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135199944] [2021-10-05 22:42:39,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135199944] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:39,061 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:39,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:39,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455957772] [2021-10-05 22:42:39,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:39,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:39,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:39,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:39,062 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 22:42:39,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:39,475 INFO L93 Difference]: Finished difference Result 570 states and 1266 transitions. [2021-10-05 22:42:39,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 22:42:39,476 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 22:42:39,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:39,477 INFO L225 Difference]: With dead ends: 570 [2021-10-05 22:42:39,477 INFO L226 Difference]: Without dead ends: 558 [2021-10-05 22:42:39,478 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 228.7ms TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:42:39,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-10-05 22:42:39,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 458. [2021-10-05 22:42:39,483 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 22:42:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1044 transitions. [2021-10-05 22:42:39,484 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1044 transitions. Word has length 38 [2021-10-05 22:42:39,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:39,484 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 1044 transitions. [2021-10-05 22:42:39,484 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 22:42:39,484 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1044 transitions. [2021-10-05 22:42:39,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:39,485 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:39,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 22:42:39,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2021-10-05 22:42:39,485 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 22:42:39,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:39,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1932674455, now seen corresponding path program 175 times [2021-10-05 22:42:39,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:39,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569236613] [2021-10-05 22:42:39,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:39,486 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:39,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:39,596 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569236613] [2021-10-05 22:42:39,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569236613] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:39,597 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:39,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:39,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712208269] [2021-10-05 22:42:39,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:39,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:39,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:39,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:39,598 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 22:42:40,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:40,032 INFO L93 Difference]: Finished difference Result 740 states and 1657 transitions. [2021-10-05 22:42:40,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 22:42:40,033 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 22:42:40,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:40,034 INFO L225 Difference]: With dead ends: 740 [2021-10-05 22:42:40,034 INFO L226 Difference]: Without dead ends: 732 [2021-10-05 22:42:40,035 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 221.3ms TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:42:40,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2021-10-05 22:42:40,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 460. [2021-10-05 22:42:40,041 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 22:42:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1047 transitions. [2021-10-05 22:42:40,041 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 1047 transitions. Word has length 38 [2021-10-05 22:42:40,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:40,042 INFO L470 AbstractCegarLoop]: Abstraction has 460 states and 1047 transitions. [2021-10-05 22:42:40,042 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 22:42:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1047 transitions. [2021-10-05 22:42:40,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:40,043 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:40,043 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:40,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2021-10-05 22:42:40,043 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 22:42:40,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:40,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1738242491, now seen corresponding path program 176 times [2021-10-05 22:42:40,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:40,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557794871] [2021-10-05 22:42:40,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:40,044 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:40,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 22:42:40,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:40,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557794871] [2021-10-05 22:42:40,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557794871] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:40,155 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:40,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:40,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863883674] [2021-10-05 22:42:40,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:40,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:40,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:40,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:40,157 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 22:42:40,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:40,652 INFO L93 Difference]: Finished difference Result 578 states and 1286 transitions. [2021-10-05 22:42:40,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 22:42:40,653 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 22:42:40,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:40,654 INFO L225 Difference]: With dead ends: 578 [2021-10-05 22:42:40,654 INFO L226 Difference]: Without dead ends: 564 [2021-10-05 22:42:40,654 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 255.4ms TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2021-10-05 22:42:40,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2021-10-05 22:42:40,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 452. [2021-10-05 22:42:40,675 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 22:42:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1033 transitions. [2021-10-05 22:42:40,675 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1033 transitions. Word has length 38 [2021-10-05 22:42:40,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:40,676 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 1033 transitions. [2021-10-05 22:42:40,676 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 22:42:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1033 transitions. [2021-10-05 22:42:40,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:40,677 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:40,677 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:40,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2021-10-05 22:42:40,677 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 22:42:40,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:40,678 INFO L82 PathProgramCache]: Analyzing trace with hash 30901047, now seen corresponding path program 177 times [2021-10-05 22:42:40,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:40,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621223099] [2021-10-05 22:42:40,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:40,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:40,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:40,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:40,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621223099] [2021-10-05 22:42:40,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621223099] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:40,795 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:40,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:40,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118108279] [2021-10-05 22:42:40,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:40,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:40,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:40,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:40,796 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 22:42:41,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:41,103 INFO L93 Difference]: Finished difference Result 516 states and 1147 transitions. [2021-10-05 22:42:41,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:42:41,104 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 22:42:41,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:41,105 INFO L225 Difference]: With dead ends: 516 [2021-10-05 22:42:41,106 INFO L226 Difference]: Without dead ends: 500 [2021-10-05 22:42:41,106 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 178.4ms TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:42:41,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2021-10-05 22:42:41,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 450. [2021-10-05 22:42:41,112 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 22:42:41,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1028 transitions. [2021-10-05 22:42:41,112 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1028 transitions. Word has length 38 [2021-10-05 22:42:41,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:41,113 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 1028 transitions. [2021-10-05 22:42:41,113 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 22:42:41,113 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1028 transitions. [2021-10-05 22:42:41,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:41,114 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:41,114 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:41,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2021-10-05 22:42:41,114 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 22:42:41,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:41,114 INFO L82 PathProgramCache]: Analyzing trace with hash -2006962745, now seen corresponding path program 178 times [2021-10-05 22:42:41,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:41,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365939726] [2021-10-05 22:42:41,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:41,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:41,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:41,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365939726] [2021-10-05 22:42:41,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365939726] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:41,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:41,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:41,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995147016] [2021-10-05 22:42:41,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:41,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:41,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:41,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:41,243 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 22:42:41,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:41,737 INFO L93 Difference]: Finished difference Result 540 states and 1203 transitions. [2021-10-05 22:42:41,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 22:42:41,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 22:42:41,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:41,739 INFO L225 Difference]: With dead ends: 540 [2021-10-05 22:42:41,739 INFO L226 Difference]: Without dead ends: 520 [2021-10-05 22:42:41,740 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 303.9ms TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2021-10-05 22:42:41,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-10-05 22:42:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 456. [2021-10-05 22:42:41,745 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 22:42:41,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1037 transitions. [2021-10-05 22:42:41,746 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1037 transitions. Word has length 38 [2021-10-05 22:42:41,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:41,746 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 1037 transitions. [2021-10-05 22:42:41,746 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 22:42:41,746 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1037 transitions. [2021-10-05 22:42:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:41,747 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:41,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 22:42:41,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2021-10-05 22:42:41,747 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 22:42:41,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:41,747 INFO L82 PathProgramCache]: Analyzing trace with hash -556334569, now seen corresponding path program 179 times [2021-10-05 22:42:41,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:41,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083190712] [2021-10-05 22:42:41,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:41,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:41,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:41,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:41,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083190712] [2021-10-05 22:42:41,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083190712] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:41,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:41,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:41,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788775808] [2021-10-05 22:42:41,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:41,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:41,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:41,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:41,884 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 22:42:42,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:42,410 INFO L93 Difference]: Finished difference Result 548 states and 1225 transitions. [2021-10-05 22:42:42,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 22:42:42,410 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 22:42:42,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:42,412 INFO L225 Difference]: With dead ends: 548 [2021-10-05 22:42:42,412 INFO L226 Difference]: Without dead ends: 534 [2021-10-05 22:42:42,412 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 296.7ms TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2021-10-05 22:42:42,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2021-10-05 22:42:42,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 458. [2021-10-05 22:42:42,417 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 22:42:42,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1040 transitions. [2021-10-05 22:42:42,418 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1040 transitions. Word has length 38 [2021-10-05 22:42:42,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:42,418 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 1040 transitions. [2021-10-05 22:42:42,419 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 22:42:42,419 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1040 transitions. [2021-10-05 22:42:42,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:42,419 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:42,419 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:42,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2021-10-05 22:42:42,420 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 22:42:42,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:42,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1105270685, now seen corresponding path program 180 times [2021-10-05 22:42:42,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:42,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70737936] [2021-10-05 22:42:42,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:42,420 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:42,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:42,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:42,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70737936] [2021-10-05 22:42:42,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70737936] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:42,551 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:42,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:42,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18973122] [2021-10-05 22:42:42,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:42,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:42,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:42,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:42,553 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 22:42:43,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:43,039 INFO L93 Difference]: Finished difference Result 676 states and 1521 transitions. [2021-10-05 22:42:43,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 22:42:43,039 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 22:42:43,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:43,041 INFO L225 Difference]: With dead ends: 676 [2021-10-05 22:42:43,041 INFO L226 Difference]: Without dead ends: 650 [2021-10-05 22:42:43,041 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 265.1ms TimeCoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2021-10-05 22:42:43,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2021-10-05 22:42:43,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 450. [2021-10-05 22:42:43,046 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 22:42:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1026 transitions. [2021-10-05 22:42:43,047 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1026 transitions. Word has length 38 [2021-10-05 22:42:43,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:43,047 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 1026 transitions. [2021-10-05 22:42:43,047 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 22:42:43,047 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1026 transitions. [2021-10-05 22:42:43,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:43,048 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:43,048 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:43,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2021-10-05 22:42:43,048 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 22:42:43,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:43,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1215829139, now seen corresponding path program 181 times [2021-10-05 22:42:43,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:43,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12193087] [2021-10-05 22:42:43,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:43,049 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:43,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 22:42:43,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:43,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12193087] [2021-10-05 22:42:43,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12193087] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:43,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:43,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:43,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781292100] [2021-10-05 22:42:43,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:43,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:43,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:43,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:43,174 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 22:42:43,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:43,512 INFO L93 Difference]: Finished difference Result 470 states and 1058 transitions. [2021-10-05 22:42:43,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:42:43,513 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 22:42:43,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:43,513 INFO L225 Difference]: With dead ends: 470 [2021-10-05 22:42:43,514 INFO L226 Difference]: Without dead ends: 444 [2021-10-05 22:42:43,514 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 211.0ms TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:42:43,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-10-05 22:42:43,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2021-10-05 22:42:43,518 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 22:42:43,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1015 transitions. [2021-10-05 22:42:43,519 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1015 transitions. Word has length 38 [2021-10-05 22:42:43,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:43,519 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 1015 transitions. [2021-10-05 22:42:43,519 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 22:42:43,519 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1015 transitions. [2021-10-05 22:42:43,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:43,520 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:43,520 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:43,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2021-10-05 22:42:43,520 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 22:42:43,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:43,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1010293933, now seen corresponding path program 182 times [2021-10-05 22:42:43,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:43,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814669077] [2021-10-05 22:42:43,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:43,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:43,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 22:42:43,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:43,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814669077] [2021-10-05 22:42:43,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814669077] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:43,611 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:43,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:43,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755253409] [2021-10-05 22:42:43,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:43,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:43,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:43,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:43,613 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 22:42:43,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:43,972 INFO L93 Difference]: Finished difference Result 538 states and 1194 transitions. [2021-10-05 22:42:43,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 22:42:43,973 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 22:42:43,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:43,974 INFO L225 Difference]: With dead ends: 538 [2021-10-05 22:42:43,974 INFO L226 Difference]: Without dead ends: 526 [2021-10-05 22:42:43,974 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 170.1ms TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:42:43,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-10-05 22:42:43,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 444. [2021-10-05 22:42:43,979 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 22:42:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1009 transitions. [2021-10-05 22:42:43,980 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1009 transitions. Word has length 38 [2021-10-05 22:42:43,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:43,980 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 1009 transitions. [2021-10-05 22:42:43,980 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 22:42:43,980 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1009 transitions. [2021-10-05 22:42:43,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:43,981 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:43,981 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:43,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2021-10-05 22:42:43,981 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 22:42:43,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:43,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1104453539, now seen corresponding path program 183 times [2021-10-05 22:42:43,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:43,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826923593] [2021-10-05 22:42:43,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:43,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:44,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:44,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:44,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826923593] [2021-10-05 22:42:44,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826923593] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:44,060 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:44,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:42:44,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429068051] [2021-10-05 22:42:44,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:42:44,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:44,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:42:44,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:42:44,062 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 22:42:44,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:44,437 INFO L93 Difference]: Finished difference Result 696 states and 1559 transitions. [2021-10-05 22:42:44,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 22:42:44,437 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 22:42:44,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:44,439 INFO L225 Difference]: With dead ends: 696 [2021-10-05 22:42:44,439 INFO L226 Difference]: Without dead ends: 688 [2021-10-05 22:42:44,439 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 157.7ms TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:44,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2021-10-05 22:42:44,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 446. [2021-10-05 22:42:44,446 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 22:42:44,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1012 transitions. [2021-10-05 22:42:44,446 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1012 transitions. Word has length 38 [2021-10-05 22:42:44,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:44,447 INFO L470 AbstractCegarLoop]: Abstraction has 446 states and 1012 transitions. [2021-10-05 22:42:44,447 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 22:42:44,447 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1012 transitions. [2021-10-05 22:42:44,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:44,448 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:44,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 22:42:44,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2021-10-05 22:42:44,448 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 22:42:44,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:44,448 INFO L82 PathProgramCache]: Analyzing trace with hash 910021575, now seen corresponding path program 184 times [2021-10-05 22:42:44,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:44,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606893101] [2021-10-05 22:42:44,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:44,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:44,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:44,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606893101] [2021-10-05 22:42:44,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606893101] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:44,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:44,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:44,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279776126] [2021-10-05 22:42:44,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:44,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:44,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:44,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:44,536 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 22:42:45,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:45,005 INFO L93 Difference]: Finished difference Result 734 states and 1632 transitions. [2021-10-05 22:42:45,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 22:42:45,005 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 22:42:45,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:45,007 INFO L225 Difference]: With dead ends: 734 [2021-10-05 22:42:45,007 INFO L226 Difference]: Without dead ends: 720 [2021-10-05 22:42:45,008 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 213.7ms TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2021-10-05 22:42:45,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2021-10-05 22:42:45,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 438. [2021-10-05 22:42:45,014 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 22:42:45,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 994 transitions. [2021-10-05 22:42:45,015 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 994 transitions. Word has length 38 [2021-10-05 22:42:45,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:45,015 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 994 transitions. [2021-10-05 22:42:45,015 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 22:42:45,015 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 994 transitions. [2021-10-05 22:42:45,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:45,016 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:45,016 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:45,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2021-10-05 22:42:45,016 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 22:42:45,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:45,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1170713261, now seen corresponding path program 185 times [2021-10-05 22:42:45,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:45,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027818019] [2021-10-05 22:42:45,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:45,017 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:45,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:45,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:45,118 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027818019] [2021-10-05 22:42:45,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027818019] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:45,119 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:45,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:45,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268954992] [2021-10-05 22:42:45,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:45,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:45,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:45,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:45,121 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 22:42:45,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:45,506 INFO L93 Difference]: Finished difference Result 678 states and 1524 transitions. [2021-10-05 22:42:45,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 22:42:45,507 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 22:42:45,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:45,508 INFO L225 Difference]: With dead ends: 678 [2021-10-05 22:42:45,508 INFO L226 Difference]: Without dead ends: 670 [2021-10-05 22:42:45,509 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 190.6ms TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:42:45,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2021-10-05 22:42:45,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 438. [2021-10-05 22:42:45,515 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 22:42:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 992 transitions. [2021-10-05 22:42:45,516 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 992 transitions. Word has length 38 [2021-10-05 22:42:45,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:45,516 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 992 transitions. [2021-10-05 22:42:45,516 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 22:42:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 992 transitions. [2021-10-05 22:42:45,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:45,517 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:45,517 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:45,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2021-10-05 22:42:45,517 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 22:42:45,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:45,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1365145225, now seen corresponding path program 186 times [2021-10-05 22:42:45,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:45,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388759856] [2021-10-05 22:42:45,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:45,518 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:45,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 22:42:45,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:45,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388759856] [2021-10-05 22:42:45,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388759856] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:45,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:45,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:45,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772811110] [2021-10-05 22:42:45,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:45,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:45,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:45,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:45,628 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 22:42:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:46,080 INFO L93 Difference]: Finished difference Result 684 states and 1533 transitions. [2021-10-05 22:42:46,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 22:42:46,080 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 22:42:46,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:46,082 INFO L225 Difference]: With dead ends: 684 [2021-10-05 22:42:46,082 INFO L226 Difference]: Without dead ends: 676 [2021-10-05 22:42:46,082 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 234.1ms TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2021-10-05 22:42:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2021-10-05 22:42:46,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 436. [2021-10-05 22:42:46,088 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 22:42:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 987 transitions. [2021-10-05 22:42:46,089 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 987 transitions. Word has length 38 [2021-10-05 22:42:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:46,089 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 987 transitions. [2021-10-05 22:42:46,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 22:42:46,089 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 987 transitions. [2021-10-05 22:42:46,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:46,090 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:46,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 22:42:46,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2021-10-05 22:42:46,090 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 22:42:46,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:46,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1125722323, now seen corresponding path program 187 times [2021-10-05 22:42:46,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:46,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072534812] [2021-10-05 22:42:46,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:46,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:46,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:46,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072534812] [2021-10-05 22:42:46,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072534812] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:46,216 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:46,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:46,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069344486] [2021-10-05 22:42:46,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:46,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:46,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:46,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:46,218 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 22:42:46,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:46,716 INFO L93 Difference]: Finished difference Result 646 states and 1456 transitions. [2021-10-05 22:42:46,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-05 22:42:46,717 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 22:42:46,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:46,718 INFO L225 Difference]: With dead ends: 646 [2021-10-05 22:42:46,718 INFO L226 Difference]: Without dead ends: 622 [2021-10-05 22:42:46,718 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 267.1ms TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2021-10-05 22:42:46,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2021-10-05 22:42:46,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 434. [2021-10-05 22:42:46,724 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 22:42:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 982 transitions. [2021-10-05 22:42:46,724 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 982 transitions. Word has length 38 [2021-10-05 22:42:46,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:46,725 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 982 transitions. [2021-10-05 22:42:46,725 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 22:42:46,725 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 982 transitions. [2021-10-05 22:42:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:46,726 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:46,726 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:46,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2021-10-05 22:42:46,726 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 22:42:46,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:46,726 INFO L82 PathProgramCache]: Analyzing trace with hash -505031305, now seen corresponding path program 188 times [2021-10-05 22:42:46,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:46,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799553697] [2021-10-05 22:42:46,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:46,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:46,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 22:42:46,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:46,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799553697] [2021-10-05 22:42:46,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799553697] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:46,850 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:46,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:46,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083290153] [2021-10-05 22:42:46,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:46,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:46,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:46,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:46,852 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 22:42:47,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:47,265 INFO L93 Difference]: Finished difference Result 500 states and 1113 transitions. [2021-10-05 22:42:47,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 22:42:47,266 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 22:42:47,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:47,267 INFO L225 Difference]: With dead ends: 500 [2021-10-05 22:42:47,268 INFO L226 Difference]: Without dead ends: 480 [2021-10-05 22:42:47,268 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 205.2ms TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:42:47,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-10-05 22:42:47,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 428. [2021-10-05 22:42:47,273 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 22:42:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 967 transitions. [2021-10-05 22:42:47,274 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 967 transitions. Word has length 38 [2021-10-05 22:42:47,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:47,274 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 967 transitions. [2021-10-05 22:42:47,274 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 22:42:47,274 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 967 transitions. [2021-10-05 22:42:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:47,275 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:47,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 22:42:47,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2021-10-05 22:42:47,276 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 22:42:47,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:47,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1422086771, now seen corresponding path program 189 times [2021-10-05 22:42:47,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:47,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403917406] [2021-10-05 22:42:47,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:47,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:47,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:47,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:47,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403917406] [2021-10-05 22:42:47,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403917406] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:47,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:47,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:47,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207451351] [2021-10-05 22:42:47,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:47,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:47,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:47,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:47,408 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 22:42:47,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:47,929 INFO L93 Difference]: Finished difference Result 646 states and 1444 transitions. [2021-10-05 22:42:47,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 22:42:47,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 22:42:47,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:47,931 INFO L225 Difference]: With dead ends: 646 [2021-10-05 22:42:47,931 INFO L226 Difference]: Without dead ends: 600 [2021-10-05 22:42:47,931 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 271.5ms TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2021-10-05 22:42:47,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2021-10-05 22:42:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 412. [2021-10-05 22:42:47,936 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 22:42:47,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 935 transitions. [2021-10-05 22:42:47,937 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 935 transitions. Word has length 38 [2021-10-05 22:42:47,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:47,937 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 935 transitions. [2021-10-05 22:42:47,937 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 22:42:47,938 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 935 transitions. [2021-10-05 22:42:47,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:47,938 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:47,938 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:47,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2021-10-05 22:42:47,938 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 22:42:47,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:47,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1596705233, now seen corresponding path program 190 times [2021-10-05 22:42:47,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:47,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693136700] [2021-10-05 22:42:47,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:47,939 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:48,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:48,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693136700] [2021-10-05 22:42:48,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693136700] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:48,026 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:48,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:48,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270114801] [2021-10-05 22:42:48,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:48,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:48,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:48,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:48,028 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 22:42:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:48,350 INFO L93 Difference]: Finished difference Result 458 states and 1022 transitions. [2021-10-05 22:42:48,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 22:42:48,351 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 22:42:48,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:48,352 INFO L225 Difference]: With dead ends: 458 [2021-10-05 22:42:48,352 INFO L226 Difference]: Without dead ends: 446 [2021-10-05 22:42:48,352 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 144.5ms TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:48,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2021-10-05 22:42:48,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 418. [2021-10-05 22:42:48,357 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 22:42:48,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 944 transitions. [2021-10-05 22:42:48,358 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 944 transitions. Word has length 38 [2021-10-05 22:42:48,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:48,358 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 944 transitions. [2021-10-05 22:42:48,358 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 22:42:48,358 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 944 transitions. [2021-10-05 22:42:48,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:48,359 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:48,359 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:48,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2021-10-05 22:42:48,360 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 22:42:48,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:48,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1301523613, now seen corresponding path program 191 times [2021-10-05 22:42:48,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:48,361 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172005237] [2021-10-05 22:42:48,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:48,362 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:48,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:48,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:48,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172005237] [2021-10-05 22:42:48,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172005237] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:48,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:48,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:42:48,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775360883] [2021-10-05 22:42:48,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:42:48,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:48,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:42:48,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:42:48,461 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 22:42:48,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:48,794 INFO L93 Difference]: Finished difference Result 536 states and 1175 transitions. [2021-10-05 22:42:48,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 22:42:48,795 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 22:42:48,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:48,796 INFO L225 Difference]: With dead ends: 536 [2021-10-05 22:42:48,796 INFO L226 Difference]: Without dead ends: 514 [2021-10-05 22:42:48,796 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 166.8ms TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:42:48,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-10-05 22:42:48,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 412. [2021-10-05 22:42:48,801 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 22:42:48,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 923 transitions. [2021-10-05 22:42:48,802 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 923 transitions. Word has length 38 [2021-10-05 22:42:48,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:48,802 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 923 transitions. [2021-10-05 22:42:48,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 22:42:48,803 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 923 transitions. [2021-10-05 22:42:48,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:48,804 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:48,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 22:42:48,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2021-10-05 22:42:48,804 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 22:42:48,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:48,805 INFO L82 PathProgramCache]: Analyzing trace with hash -867106687, now seen corresponding path program 192 times [2021-10-05 22:42:48,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:48,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629782059] [2021-10-05 22:42:48,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:48,806 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:48,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:48,914 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629782059] [2021-10-05 22:42:48,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629782059] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:48,915 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:48,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:48,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048291133] [2021-10-05 22:42:48,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:48,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:48,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:48,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:48,916 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 22:42:49,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:49,294 INFO L93 Difference]: Finished difference Result 460 states and 1011 transitions. [2021-10-05 22:42:49,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 22:42:49,295 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 22:42:49,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:49,296 INFO L225 Difference]: With dead ends: 460 [2021-10-05 22:42:49,296 INFO L226 Difference]: Without dead ends: 440 [2021-10-05 22:42:49,297 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 181.3ms TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:42:49,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-10-05 22:42:49,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 424. [2021-10-05 22:42:49,302 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 22:42:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 944 transitions. [2021-10-05 22:42:49,303 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 944 transitions. Word has length 38 [2021-10-05 22:42:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:49,303 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 944 transitions. [2021-10-05 22:42:49,303 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 22:42:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 944 transitions. [2021-10-05 22:42:49,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:49,304 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:49,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 22:42:49,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2021-10-05 22:42:49,304 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 22:42:49,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:49,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1028368227, now seen corresponding path program 193 times [2021-10-05 22:42:49,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:49,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781230414] [2021-10-05 22:42:49,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:49,305 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:49,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:49,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781230414] [2021-10-05 22:42:49,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781230414] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:49,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:49,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:49,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274985161] [2021-10-05 22:42:49,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:49,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:49,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:49,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:49,435 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 22:42:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:49,851 INFO L93 Difference]: Finished difference Result 516 states and 1115 transitions. [2021-10-05 22:42:49,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 22:42:49,852 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 22:42:49,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:49,853 INFO L225 Difference]: With dead ends: 516 [2021-10-05 22:42:49,853 INFO L226 Difference]: Without dead ends: 462 [2021-10-05 22:42:49,853 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 225.0ms TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2021-10-05 22:42:49,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-10-05 22:42:49,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 412. [2021-10-05 22:42:49,858 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 22:42:49,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 899 transitions. [2021-10-05 22:42:49,858 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 899 transitions. Word has length 38 [2021-10-05 22:42:49,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:49,859 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 899 transitions. [2021-10-05 22:42:49,859 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 22:42:49,859 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 899 transitions. [2021-10-05 22:42:49,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:49,859 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:49,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 22:42:49,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2021-10-05 22:42:49,860 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 22:42:49,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:49,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1623623873, now seen corresponding path program 194 times [2021-10-05 22:42:49,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:49,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161950034] [2021-10-05 22:42:49,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:49,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:49,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 22:42:49,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:49,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161950034] [2021-10-05 22:42:49,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161950034] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:49,981 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:49,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:49,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132160692] [2021-10-05 22:42:49,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:49,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:49,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:49,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:49,982 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 22:42:50,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:50,275 INFO L93 Difference]: Finished difference Result 508 states and 1090 transitions. [2021-10-05 22:42:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:42:50,275 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 22:42:50,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:50,277 INFO L225 Difference]: With dead ends: 508 [2021-10-05 22:42:50,277 INFO L226 Difference]: Without dead ends: 496 [2021-10-05 22:42:50,277 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 163.3ms TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:50,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-10-05 22:42:50,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 412. [2021-10-05 22:42:50,281 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 22:42:50,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 897 transitions. [2021-10-05 22:42:50,282 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 897 transitions. Word has length 38 [2021-10-05 22:42:50,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:50,283 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 897 transitions. [2021-10-05 22:42:50,283 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 22:42:50,283 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 897 transitions. [2021-10-05 22:42:50,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:50,283 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:50,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 22:42:50,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2021-10-05 22:42:50,284 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 22:42:50,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:50,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1377587217, now seen corresponding path program 195 times [2021-10-05 22:42:50,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:50,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403282170] [2021-10-05 22:42:50,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:50,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:50,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:50,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403282170] [2021-10-05 22:42:50,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403282170] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:50,407 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:50,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:50,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520909357] [2021-10-05 22:42:50,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:50,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:50,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:50,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:50,409 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 22:42:50,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:50,686 INFO L93 Difference]: Finished difference Result 484 states and 1036 transitions. [2021-10-05 22:42:50,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:42:50,686 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 22:42:50,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:50,688 INFO L225 Difference]: With dead ends: 484 [2021-10-05 22:42:50,688 INFO L226 Difference]: Without dead ends: 434 [2021-10-05 22:42:50,688 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 165.4ms TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:50,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-10-05 22:42:50,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 392. [2021-10-05 22:42:50,693 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 22:42:50,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 858 transitions. [2021-10-05 22:42:50,694 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 858 transitions. Word has length 38 [2021-10-05 22:42:50,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:50,694 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 858 transitions. [2021-10-05 22:42:50,694 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 22:42:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 858 transitions. [2021-10-05 22:42:50,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:50,695 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:50,695 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:50,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2021-10-05 22:42:50,695 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 22:42:50,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:50,696 INFO L82 PathProgramCache]: Analyzing trace with hash -890695075, now seen corresponding path program 196 times [2021-10-05 22:42:50,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:50,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693017217] [2021-10-05 22:42:50,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:50,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:50,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:50,818 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693017217] [2021-10-05 22:42:50,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693017217] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:50,818 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:50,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:50,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698456766] [2021-10-05 22:42:50,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:50,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:50,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:50,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:50,820 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 22:42:51,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:51,154 INFO L93 Difference]: Finished difference Result 414 states and 894 transitions. [2021-10-05 22:42:51,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:42:51,155 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 22:42:51,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:51,156 INFO L225 Difference]: With dead ends: 414 [2021-10-05 22:42:51,156 INFO L226 Difference]: Without dead ends: 402 [2021-10-05 22:42:51,156 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 206.9ms TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:42:51,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2021-10-05 22:42:51,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 392. [2021-10-05 22:42:51,160 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 22:42:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 852 transitions. [2021-10-05 22:42:51,161 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 852 transitions. Word has length 38 [2021-10-05 22:42:51,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:51,161 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 852 transitions. [2021-10-05 22:42:51,161 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 22:42:51,162 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 852 transitions. [2021-10-05 22:42:51,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:51,162 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:51,162 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:51,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2021-10-05 22:42:51,163 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 22:42:51,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:51,163 INFO L82 PathProgramCache]: Analyzing trace with hash 506043375, now seen corresponding path program 197 times [2021-10-05 22:42:51,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:51,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52584007] [2021-10-05 22:42:51,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:51,163 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:51,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:51,291 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52584007] [2021-10-05 22:42:51,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52584007] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:51,292 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:51,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:51,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131251738] [2021-10-05 22:42:51,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:51,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:51,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:51,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:51,294 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 22:42:51,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:51,638 INFO L93 Difference]: Finished difference Result 406 states and 876 transitions. [2021-10-05 22:42:51,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:42:51,639 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 22:42:51,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:51,640 INFO L225 Difference]: With dead ends: 406 [2021-10-05 22:42:51,640 INFO L226 Difference]: Without dead ends: 400 [2021-10-05 22:42:51,641 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 198.8ms TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:51,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-10-05 22:42:51,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 394. [2021-10-05 22:42:51,644 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 22:42:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 855 transitions. [2021-10-05 22:42:51,645 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 855 transitions. Word has length 38 [2021-10-05 22:42:51,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:51,645 INFO L470 AbstractCegarLoop]: Abstraction has 394 states and 855 transitions. [2021-10-05 22:42:51,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 22:42:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 855 transitions. [2021-10-05 22:42:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:51,646 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:51,646 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:51,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197 [2021-10-05 22:42:51,647 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 22:42:51,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:51,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1768678713, now seen corresponding path program 198 times [2021-10-05 22:42:51,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:51,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621614315] [2021-10-05 22:42:51,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:51,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:51,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:51,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621614315] [2021-10-05 22:42:51,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621614315] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:51,781 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:51,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:51,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122300477] [2021-10-05 22:42:51,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:51,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:51,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:51,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:51,782 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 22:42:52,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:52,118 INFO L93 Difference]: Finished difference Result 468 states and 1006 transitions. [2021-10-05 22:42:52,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:42:52,119 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 22:42:52,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:52,120 INFO L225 Difference]: With dead ends: 468 [2021-10-05 22:42:52,120 INFO L226 Difference]: Without dead ends: 452 [2021-10-05 22:42:52,120 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 193.9ms TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:52,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-10-05 22:42:52,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 386. [2021-10-05 22:42:52,126 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 22:42:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 841 transitions. [2021-10-05 22:42:52,127 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 841 transitions. Word has length 38 [2021-10-05 22:42:52,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:52,127 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 841 transitions. [2021-10-05 22:42:52,127 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 22:42:52,127 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 841 transitions. [2021-10-05 22:42:52,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:52,128 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:52,128 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:52,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2021-10-05 22:42:52,128 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 22:42:52,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:52,128 INFO L82 PathProgramCache]: Analyzing trace with hash -677721011, now seen corresponding path program 199 times [2021-10-05 22:42:52,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:52,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918574678] [2021-10-05 22:42:52,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:52,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:52,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:52,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:52,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918574678] [2021-10-05 22:42:52,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918574678] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:52,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:52,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:52,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731075497] [2021-10-05 22:42:52,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:52,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:52,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:52,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:52,267 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 22:42:52,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:52,572 INFO L93 Difference]: Finished difference Result 406 states and 872 transitions. [2021-10-05 22:42:52,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:42:52,573 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 22:42:52,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:52,574 INFO L225 Difference]: With dead ends: 406 [2021-10-05 22:42:52,574 INFO L226 Difference]: Without dead ends: 390 [2021-10-05 22:42:52,574 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 186.9ms TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:42:52,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-10-05 22:42:52,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 384. [2021-10-05 22:42:52,579 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 22:42:52,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 836 transitions. [2021-10-05 22:42:52,580 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 836 transitions. Word has length 38 [2021-10-05 22:42:52,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:52,580 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 836 transitions. [2021-10-05 22:42:52,580 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 22:42:52,580 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 836 transitions. [2021-10-05 22:42:52,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:52,581 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:52,581 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:52,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable199 [2021-10-05 22:42:52,581 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 22:42:52,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:52,581 INFO L82 PathProgramCache]: Analyzing trace with hash 2055203981, now seen corresponding path program 200 times [2021-10-05 22:42:52,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:52,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622741172] [2021-10-05 22:42:52,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:52,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:52,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:52,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622741172] [2021-10-05 22:42:52,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622741172] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:52,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:52,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:52,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658364680] [2021-10-05 22:42:52,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:52,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:52,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:52,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:52,707 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 22:42:53,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:53,035 INFO L93 Difference]: Finished difference Result 434 states and 933 transitions. [2021-10-05 22:42:53,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:42:53,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 22:42:53,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:53,037 INFO L225 Difference]: With dead ends: 434 [2021-10-05 22:42:53,037 INFO L226 Difference]: Without dead ends: 422 [2021-10-05 22:42:53,037 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 189.0ms TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:42:53,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-10-05 22:42:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 378. [2021-10-05 22:42:53,041 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 22:42:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 821 transitions. [2021-10-05 22:42:53,042 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 821 transitions. Word has length 38 [2021-10-05 22:42:53,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:53,042 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 821 transitions. [2021-10-05 22:42:53,042 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 22:42:53,042 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 821 transitions. [2021-10-05 22:42:53,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:53,043 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:53,043 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:53,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2021-10-05 22:42:53,043 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 22:42:53,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:53,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1809167325, now seen corresponding path program 201 times [2021-10-05 22:42:53,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:53,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498739430] [2021-10-05 22:42:53,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:53,044 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:53,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 22:42:53,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:53,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498739430] [2021-10-05 22:42:53,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498739430] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:53,177 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:53,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:53,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061643252] [2021-10-05 22:42:53,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:53,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:53,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:53,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:53,178 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 22:42:53,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:53,539 INFO L93 Difference]: Finished difference Result 442 states and 943 transitions. [2021-10-05 22:42:53,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:42:53,539 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 22:42:53,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:53,540 INFO L225 Difference]: With dead ends: 442 [2021-10-05 22:42:53,540 INFO L226 Difference]: Without dead ends: 412 [2021-10-05 22:42:53,541 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 217.6ms TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:42:53,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2021-10-05 22:42:53,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 378. [2021-10-05 22:42:53,544 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 22:42:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 817 transitions. [2021-10-05 22:42:53,545 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 817 transitions. Word has length 38 [2021-10-05 22:42:53,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:53,545 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 817 transitions. [2021-10-05 22:42:53,545 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 22:42:53,545 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 817 transitions. [2021-10-05 22:42:53,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:53,546 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:53,546 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:53,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2021-10-05 22:42:53,546 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 22:42:53,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:53,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1749740493, now seen corresponding path program 202 times [2021-10-05 22:42:53,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:53,547 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617606324] [2021-10-05 22:42:53,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:53,547 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:53,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:53,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617606324] [2021-10-05 22:42:53,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617606324] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:53,671 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:53,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:53,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804132320] [2021-10-05 22:42:53,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:53,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:53,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:53,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:53,673 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 22:42:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:53,940 INFO L93 Difference]: Finished difference Result 434 states and 924 transitions. [2021-10-05 22:42:53,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:42:53,945 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 22:42:53,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:53,947 INFO L225 Difference]: With dead ends: 434 [2021-10-05 22:42:53,947 INFO L226 Difference]: Without dead ends: 390 [2021-10-05 22:42:53,947 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 162.5ms TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:42:53,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-10-05 22:42:53,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 358. [2021-10-05 22:42:53,953 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 22:42:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 778 transitions. [2021-10-05 22:42:53,954 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 778 transitions. Word has length 38 [2021-10-05 22:42:53,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:53,954 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 778 transitions. [2021-10-05 22:42:53,954 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 22:42:53,954 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 778 transitions. [2021-10-05 22:42:53,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:53,955 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:53,955 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:53,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2021-10-05 22:42:53,956 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 22:42:53,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:53,956 INFO L82 PathProgramCache]: Analyzing trace with hash 253520797, now seen corresponding path program 203 times [2021-10-05 22:42:53,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:53,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572997376] [2021-10-05 22:42:53,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:53,957 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:54,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 22:42:54,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:54,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572997376] [2021-10-05 22:42:54,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572997376] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:54,101 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:54,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:54,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012034621] [2021-10-05 22:42:54,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:54,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:54,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:54,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:54,103 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 22:42:54,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:54,345 INFO L93 Difference]: Finished difference Result 378 states and 810 transitions. [2021-10-05 22:42:54,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:42:54,346 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 22:42:54,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:54,347 INFO L225 Difference]: With dead ends: 378 [2021-10-05 22:42:54,347 INFO L226 Difference]: Without dead ends: 356 [2021-10-05 22:42:54,347 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 176.2ms TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:42:54,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-10-05 22:42:54,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2021-10-05 22:42:54,352 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 22:42:54,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 773 transitions. [2021-10-05 22:42:54,352 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 773 transitions. Word has length 38 [2021-10-05 22:42:54,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:54,352 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 773 transitions. [2021-10-05 22:42:54,353 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 22:42:54,353 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 773 transitions. [2021-10-05 22:42:54,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:54,353 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:54,353 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:54,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2021-10-05 22:42:54,354 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 22:42:54,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:54,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1871702109, now seen corresponding path program 204 times [2021-10-05 22:42:54,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:54,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516853913] [2021-10-05 22:42:54,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:54,354 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:54,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:54,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516853913] [2021-10-05 22:42:54,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516853913] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:54,489 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:54,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:54,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169778015] [2021-10-05 22:42:54,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:54,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:54,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:54,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:54,491 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 22:42:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:54,756 INFO L93 Difference]: Finished difference Result 370 states and 796 transitions. [2021-10-05 22:42:54,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:42:54,771 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 22:42:54,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:54,772 INFO L225 Difference]: With dead ends: 370 [2021-10-05 22:42:54,773 INFO L226 Difference]: Without dead ends: 350 [2021-10-05 22:42:54,773 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 179.8ms TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:54,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2021-10-05 22:42:54,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2021-10-05 22:42:54,776 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 22:42:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 758 transitions. [2021-10-05 22:42:54,777 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 758 transitions. Word has length 38 [2021-10-05 22:42:54,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:54,777 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 758 transitions. [2021-10-05 22:42:54,777 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 22:42:54,778 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 758 transitions. [2021-10-05 22:42:54,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:54,778 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:54,778 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:54,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2021-10-05 22:42:54,778 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 22:42:54,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:54,779 INFO L82 PathProgramCache]: Analyzing trace with hash -527790273, now seen corresponding path program 205 times [2021-10-05 22:42:54,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:54,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730814063] [2021-10-05 22:42:54,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:54,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:54,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:54,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730814063] [2021-10-05 22:42:54,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730814063] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:54,912 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:54,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:54,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555887436] [2021-10-05 22:42:54,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:54,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:54,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:54,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:54,914 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 22:42:55,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:55,206 INFO L93 Difference]: Finished difference Result 362 states and 778 transitions. [2021-10-05 22:42:55,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:42:55,206 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 22:42:55,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:55,207 INFO L225 Difference]: With dead ends: 362 [2021-10-05 22:42:55,207 INFO L226 Difference]: Without dead ends: 348 [2021-10-05 22:42:55,208 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 177.1ms TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:55,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-10-05 22:42:55,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2021-10-05 22:42:55,212 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 22:42:55,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 753 transitions. [2021-10-05 22:42:55,212 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 753 transitions. Word has length 38 [2021-10-05 22:42:55,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:55,213 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 753 transitions. [2021-10-05 22:42:55,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 22:42:55,213 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 753 transitions. [2021-10-05 22:42:55,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:55,213 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:55,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 22:42:55,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable205 [2021-10-05 22:42:55,214 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 22:42:55,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:55,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1074206919, now seen corresponding path program 206 times [2021-10-05 22:42:55,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:55,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022128062] [2021-10-05 22:42:55,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:55,214 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:55,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:55,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:55,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022128062] [2021-10-05 22:42:55,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022128062] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:55,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:55,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:42:55,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487387] [2021-10-05 22:42:55,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:42:55,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:55,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:42:55,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:42:55,347 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 22:42:55,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:55,611 INFO L93 Difference]: Finished difference Result 320 states and 691 transitions. [2021-10-05 22:42:55,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:42:55,612 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 22:42:55,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:55,612 INFO L225 Difference]: With dead ends: 320 [2021-10-05 22:42:55,612 INFO L226 Difference]: Without dead ends: 256 [2021-10-05 22:42:55,613 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 169.5ms TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:55,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-10-05 22:42:55,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-10-05 22:42:55,616 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 22:42:55,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 574 transitions. [2021-10-05 22:42:55,617 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 574 transitions. Word has length 38 [2021-10-05 22:42:55,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:55,617 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 574 transitions. [2021-10-05 22:42:55,617 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 22:42:55,617 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 574 transitions. [2021-10-05 22:42:55,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:55,618 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:55,618 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:55,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2021-10-05 22:42:55,618 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 22:42:55,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:55,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1513261835, now seen corresponding path program 207 times [2021-10-05 22:42:55,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:55,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689306318] [2021-10-05 22:42:55,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:55,619 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:55,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:55,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:55,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689306318] [2021-10-05 22:42:55,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689306318] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:55,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:55,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:55,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987356710] [2021-10-05 22:42:55,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:55,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:55,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:55,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:55,723 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 22:42:56,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:56,002 INFO L93 Difference]: Finished difference Result 354 states and 759 transitions. [2021-10-05 22:42:56,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:42:56,003 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 22:42:56,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:56,004 INFO L225 Difference]: With dead ends: 354 [2021-10-05 22:42:56,004 INFO L226 Difference]: Without dead ends: 342 [2021-10-05 22:42:56,005 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 99.6ms TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:42:56,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-10-05 22:42:56,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 264. [2021-10-05 22:42:56,009 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 22:42:56,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 588 transitions. [2021-10-05 22:42:56,009 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 588 transitions. Word has length 38 [2021-10-05 22:42:56,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:56,009 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 588 transitions. [2021-10-05 22:42:56,010 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 22:42:56,010 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 588 transitions. [2021-10-05 22:42:56,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:56,010 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:56,010 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:56,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2021-10-05 22:42:56,010 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 22:42:56,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:56,011 INFO L82 PathProgramCache]: Analyzing trace with hash 899282349, now seen corresponding path program 208 times [2021-10-05 22:42:56,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:56,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868132102] [2021-10-05 22:42:56,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:56,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:56,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:56,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:56,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868132102] [2021-10-05 22:42:56,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868132102] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:56,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:56,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:56,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582652246] [2021-10-05 22:42:56,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:56,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:56,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:56,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:56,125 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 22:42:56,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:56,392 INFO L93 Difference]: Finished difference Result 388 states and 842 transitions. [2021-10-05 22:42:56,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:42:56,392 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 22:42:56,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:56,393 INFO L225 Difference]: With dead ends: 388 [2021-10-05 22:42:56,393 INFO L226 Difference]: Without dead ends: 380 [2021-10-05 22:42:56,394 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 123.3ms TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:42:56,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-10-05 22:42:56,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 266. [2021-10-05 22:42:56,397 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 22:42:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 591 transitions. [2021-10-05 22:42:56,398 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 591 transitions. Word has length 38 [2021-10-05 22:42:56,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:56,398 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 591 transitions. [2021-10-05 22:42:56,398 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 22:42:56,398 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 591 transitions. [2021-10-05 22:42:56,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:56,399 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:56,399 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:56,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2021-10-05 22:42:56,399 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 22:42:56,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:56,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1620453277, now seen corresponding path program 209 times [2021-10-05 22:42:56,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:56,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159269846] [2021-10-05 22:42:56,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:56,400 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:56,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 22:42:56,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:56,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159269846] [2021-10-05 22:42:56,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159269846] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:56,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:56,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:56,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899721623] [2021-10-05 22:42:56,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:56,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:56,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:56,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:56,523 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 22:42:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:56,830 INFO L93 Difference]: Finished difference Result 330 states and 715 transitions. [2021-10-05 22:42:56,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:42:56,830 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 22:42:56,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:56,831 INFO L225 Difference]: With dead ends: 330 [2021-10-05 22:42:56,831 INFO L226 Difference]: Without dead ends: 316 [2021-10-05 22:42:56,832 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 146.9ms TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:42:56,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-10-05 22:42:56,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 258. [2021-10-05 22:42:56,835 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 22:42:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 577 transitions. [2021-10-05 22:42:56,835 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 577 transitions. Word has length 38 [2021-10-05 22:42:56,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:56,835 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 577 transitions. [2021-10-05 22:42:56,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 22:42:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 577 transitions. [2021-10-05 22:42:56,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:56,836 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:56,836 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:56,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable209 [2021-10-05 22:42:56,836 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 22:42:56,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:56,837 INFO L82 PathProgramCache]: Analyzing trace with hash 477624089, now seen corresponding path program 210 times [2021-10-05 22:42:56,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:56,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628900556] [2021-10-05 22:42:56,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:56,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:56,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:56,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628900556] [2021-10-05 22:42:56,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628900556] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:56,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:56,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:56,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983590694] [2021-10-05 22:42:56,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:56,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:56,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:56,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:56,934 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 22:42:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:57,198 INFO L93 Difference]: Finished difference Result 292 states and 632 transitions. [2021-10-05 22:42:57,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:42:57,199 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 22:42:57,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:57,200 INFO L225 Difference]: With dead ends: 292 [2021-10-05 22:42:57,200 INFO L226 Difference]: Without dead ends: 276 [2021-10-05 22:42:57,200 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 100.5ms TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:42:57,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-10-05 22:42:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 256. [2021-10-05 22:42:57,204 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 22:42:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 572 transitions. [2021-10-05 22:42:57,205 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 572 transitions. Word has length 38 [2021-10-05 22:42:57,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:57,205 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 572 transitions. [2021-10-05 22:42:57,205 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 22:42:57,205 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 572 transitions. [2021-10-05 22:42:57,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:57,205 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:57,206 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:57,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2021-10-05 22:42:57,206 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 22:42:57,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:57,206 INFO L82 PathProgramCache]: Analyzing trace with hash -981866119, now seen corresponding path program 211 times [2021-10-05 22:42:57,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:57,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35227074] [2021-10-05 22:42:57,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:57,207 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:57,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 22:42:57,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:57,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35227074] [2021-10-05 22:42:57,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35227074] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:57,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:57,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:57,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917082391] [2021-10-05 22:42:57,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:57,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:57,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:57,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:57,314 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 22:42:57,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:57,542 INFO L93 Difference]: Finished difference Result 296 states and 630 transitions. [2021-10-05 22:42:57,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:42:57,543 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 22:42:57,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:57,544 INFO L225 Difference]: With dead ends: 296 [2021-10-05 22:42:57,544 INFO L226 Difference]: Without dead ends: 270 [2021-10-05 22:42:57,544 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 98.3ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-10-05 22:42:57,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-10-05 22:42:57,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 250. [2021-10-05 22:42:57,548 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 22:42:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 553 transitions. [2021-10-05 22:42:57,549 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 553 transitions. Word has length 38 [2021-10-05 22:42:57,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:57,549 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 553 transitions. [2021-10-05 22:42:57,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 22:42:57,549 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 553 transitions. [2021-10-05 22:42:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:57,549 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:57,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 22:42:57,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211 [2021-10-05 22:42:57,550 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 22:42:57,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:57,550 INFO L82 PathProgramCache]: Analyzing trace with hash 611942947, now seen corresponding path program 212 times [2021-10-05 22:42:57,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:57,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154423394] [2021-10-05 22:42:57,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:57,551 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:57,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:57,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:57,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154423394] [2021-10-05 22:42:57,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154423394] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:57,675 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:57,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:57,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814450688] [2021-10-05 22:42:57,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:57,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:57,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:57,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:57,677 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 22:42:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:58,036 INFO L93 Difference]: Finished difference Result 378 states and 813 transitions. [2021-10-05 22:42:58,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:42:58,036 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 22:42:58,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:58,037 INFO L225 Difference]: With dead ends: 378 [2021-10-05 22:42:58,037 INFO L226 Difference]: Without dead ends: 366 [2021-10-05 22:42:58,038 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 173.3ms TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:58,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-10-05 22:42:58,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 260. [2021-10-05 22:42:58,041 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 22:42:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 574 transitions. [2021-10-05 22:42:58,042 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 574 transitions. Word has length 38 [2021-10-05 22:42:58,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:58,042 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 574 transitions. [2021-10-05 22:42:58,042 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 22:42:58,042 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 574 transitions. [2021-10-05 22:42:58,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:58,043 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:58,043 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:58,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable212 [2021-10-05 22:42:58,044 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 22:42:58,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:58,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1270480165, now seen corresponding path program 213 times [2021-10-05 22:42:58,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:58,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850715543] [2021-10-05 22:42:58,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:58,044 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:58,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:58,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:58,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850715543] [2021-10-05 22:42:58,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850715543] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:58,175 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:58,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:58,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950124880] [2021-10-05 22:42:58,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:58,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:58,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:58,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:58,177 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 22:42:58,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:58,512 INFO L93 Difference]: Finished difference Result 488 states and 1076 transitions. [2021-10-05 22:42:58,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:42:58,513 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 22:42:58,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:58,514 INFO L225 Difference]: With dead ends: 488 [2021-10-05 22:42:58,514 INFO L226 Difference]: Without dead ends: 480 [2021-10-05 22:42:58,515 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 177.6ms TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-10-05 22:42:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 274. [2021-10-05 22:42:58,518 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 22:42:58,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 613 transitions. [2021-10-05 22:42:58,519 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 613 transitions. Word has length 38 [2021-10-05 22:42:58,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:58,519 INFO L470 AbstractCegarLoop]: Abstraction has 274 states and 613 transitions. [2021-10-05 22:42:58,519 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 22:42:58,519 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 613 transitions. [2021-10-05 22:42:58,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:58,520 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:58,520 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:58,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable213 [2021-10-05 22:42:58,520 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 22:42:58,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:58,521 INFO L82 PathProgramCache]: Analyzing trace with hash -549309237, now seen corresponding path program 214 times [2021-10-05 22:42:58,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:58,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803083738] [2021-10-05 22:42:58,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:58,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:58,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:58,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803083738] [2021-10-05 22:42:58,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803083738] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:58,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:58,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:58,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954757955] [2021-10-05 22:42:58,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:58,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:58,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:58,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:58,647 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 22:42:58,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:58,965 INFO L93 Difference]: Finished difference Result 352 states and 768 transitions. [2021-10-05 22:42:58,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:42:58,966 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 22:42:58,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:58,967 INFO L225 Difference]: With dead ends: 352 [2021-10-05 22:42:58,967 INFO L226 Difference]: Without dead ends: 338 [2021-10-05 22:42:58,967 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 178.6ms TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:42:58,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-10-05 22:42:58,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 268. [2021-10-05 22:42:58,971 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 22:42:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 602 transitions. [2021-10-05 22:42:58,971 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 602 transitions. Word has length 38 [2021-10-05 22:42:58,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:58,972 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 602 transitions. [2021-10-05 22:42:58,972 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 22:42:58,972 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 602 transitions. [2021-10-05 22:42:58,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:58,972 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:58,972 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:58,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable214 [2021-10-05 22:42:58,973 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 22:42:58,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:58,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1692138425, now seen corresponding path program 215 times [2021-10-05 22:42:58,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:58,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395966428] [2021-10-05 22:42:58,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:58,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:59,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:59,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395966428] [2021-10-05 22:42:59,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395966428] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:59,100 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:59,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:59,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822534131] [2021-10-05 22:42:59,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:59,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:59,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:59,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:59,102 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 22:42:59,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:59,426 INFO L93 Difference]: Finished difference Result 346 states and 749 transitions. [2021-10-05 22:42:59,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:42:59,426 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 22:42:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:59,427 INFO L225 Difference]: With dead ends: 346 [2021-10-05 22:42:59,427 INFO L226 Difference]: Without dead ends: 330 [2021-10-05 22:42:59,427 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 184.5ms TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:42:59,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-10-05 22:42:59,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 266. [2021-10-05 22:42:59,431 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 22:42:59,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 597 transitions. [2021-10-05 22:42:59,431 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 597 transitions. Word has length 38 [2021-10-05 22:42:59,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:59,431 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 597 transitions. [2021-10-05 22:42:59,431 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 22:42:59,432 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 597 transitions. [2021-10-05 22:42:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:59,432 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:59,432 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:59,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215 [2021-10-05 22:42:59,432 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 22:42:59,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:59,433 INFO L82 PathProgramCache]: Analyzing trace with hash 208949539, now seen corresponding path program 216 times [2021-10-05 22:42:59,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:59,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924762555] [2021-10-05 22:42:59,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:59,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:42:59,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:42:59,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:42:59,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924762555] [2021-10-05 22:42:59,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924762555] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:42:59,555 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:42:59,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:42:59,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243677462] [2021-10-05 22:42:59,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:42:59,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:42:59,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:42:59,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:42:59,558 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 22:42:59,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:42:59,874 INFO L93 Difference]: Finished difference Result 392 states and 864 transitions. [2021-10-05 22:42:59,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:42:59,874 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 22:42:59,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:42:59,875 INFO L225 Difference]: With dead ends: 392 [2021-10-05 22:42:59,876 INFO L226 Difference]: Without dead ends: 380 [2021-10-05 22:42:59,876 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 149.9ms TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:42:59,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-10-05 22:42:59,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 266. [2021-10-05 22:42:59,879 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 22:42:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 591 transitions. [2021-10-05 22:42:59,880 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 591 transitions. Word has length 38 [2021-10-05 22:42:59,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:42:59,880 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 591 transitions. [2021-10-05 22:42:59,880 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 22:42:59,880 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 591 transitions. [2021-10-05 22:42:59,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:42:59,881 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:42:59,881 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:42:59,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable216 [2021-10-05 22:42:59,881 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 22:42:59,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:42:59,882 INFO L82 PathProgramCache]: Analyzing trace with hash -952302645, now seen corresponding path program 217 times [2021-10-05 22:42:59,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:42:59,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315271905] [2021-10-05 22:42:59,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:42:59,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:42:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:00,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:00,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315271905] [2021-10-05 22:43:00,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315271905] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:00,005 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:00,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:00,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692528896] [2021-10-05 22:43:00,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:00,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:00,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:00,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:00,006 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 22:43:00,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:00,307 INFO L93 Difference]: Finished difference Result 452 states and 986 transitions. [2021-10-05 22:43:00,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:43:00,307 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 22:43:00,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:00,308 INFO L225 Difference]: With dead ends: 452 [2021-10-05 22:43:00,309 INFO L226 Difference]: Without dead ends: 438 [2021-10-05 22:43:00,309 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 150.6ms TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:43:00,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-10-05 22:43:00,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 258. [2021-10-05 22:43:00,313 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 22:43:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 573 transitions. [2021-10-05 22:43:00,313 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 573 transitions. Word has length 38 [2021-10-05 22:43:00,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:00,313 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 573 transitions. [2021-10-05 22:43:00,314 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 22:43:00,314 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 573 transitions. [2021-10-05 22:43:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:00,314 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:00,314 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:00,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable217 [2021-10-05 22:43:00,314 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 22:43:00,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:00,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1494099015, now seen corresponding path program 218 times [2021-10-05 22:43:00,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:00,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181235866] [2021-10-05 22:43:00,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:00,315 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:00,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 22:43:00,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:00,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181235866] [2021-10-05 22:43:00,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181235866] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:00,444 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:00,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:00,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238773067] [2021-10-05 22:43:00,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:00,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:00,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:00,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:00,445 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 22:43:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:00,867 INFO L93 Difference]: Finished difference Result 384 states and 844 transitions. [2021-10-05 22:43:00,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 22:43:00,868 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 22:43:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:00,869 INFO L225 Difference]: With dead ends: 384 [2021-10-05 22:43:00,869 INFO L226 Difference]: Without dead ends: 364 [2021-10-05 22:43:00,869 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 200.1ms TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:43:00,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-10-05 22:43:00,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 264. [2021-10-05 22:43:00,873 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 22:43:00,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 582 transitions. [2021-10-05 22:43:00,874 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 582 transitions. Word has length 38 [2021-10-05 22:43:00,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:00,874 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 582 transitions. [2021-10-05 22:43:00,874 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 22:43:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 582 transitions. [2021-10-05 22:43:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:00,875 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:00,875 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:00,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable218 [2021-10-05 22:43:00,875 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 22:43:00,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:00,875 INFO L82 PathProgramCache]: Analyzing trace with hash 609161861, now seen corresponding path program 219 times [2021-10-05 22:43:00,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:00,875 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787825745] [2021-10-05 22:43:00,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:00,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:00,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:00,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:00,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787825745] [2021-10-05 22:43:00,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787825745] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:00,973 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:00,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:43:00,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817033487] [2021-10-05 22:43:00,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:43:00,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:00,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:43:00,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:43:00,974 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 22:43:01,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:01,267 INFO L93 Difference]: Finished difference Result 408 states and 896 transitions. [2021-10-05 22:43:01,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:43:01,268 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 22:43:01,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:01,269 INFO L225 Difference]: With dead ends: 408 [2021-10-05 22:43:01,269 INFO L226 Difference]: Without dead ends: 390 [2021-10-05 22:43:01,269 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 113.0ms TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:43:01,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-10-05 22:43:01,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 266. [2021-10-05 22:43:01,273 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 22:43:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 585 transitions. [2021-10-05 22:43:01,273 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 585 transitions. Word has length 38 [2021-10-05 22:43:01,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:01,274 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 585 transitions. [2021-10-05 22:43:01,274 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 22:43:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 585 transitions. [2021-10-05 22:43:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:01,274 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:01,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 22:43:01,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable219 [2021-10-05 22:43:01,275 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 22:43:01,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:01,275 INFO L82 PathProgramCache]: Analyzing trace with hash -136840501, now seen corresponding path program 220 times [2021-10-05 22:43:01,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:01,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780621900] [2021-10-05 22:43:01,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:01,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:01,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:01,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780621900] [2021-10-05 22:43:01,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780621900] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:01,382 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:01,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:01,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834891579] [2021-10-05 22:43:01,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:01,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:01,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:01,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:01,383 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 22:43:01,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:01,719 INFO L93 Difference]: Finished difference Result 404 states and 884 transitions. [2021-10-05 22:43:01,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:43:01,720 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 22:43:01,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:01,721 INFO L225 Difference]: With dead ends: 404 [2021-10-05 22:43:01,721 INFO L226 Difference]: Without dead ends: 382 [2021-10-05 22:43:01,721 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 153.5ms TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:43:01,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-10-05 22:43:01,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 258. [2021-10-05 22:43:01,725 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 22:43:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 567 transitions. [2021-10-05 22:43:01,725 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 567 transitions. Word has length 38 [2021-10-05 22:43:01,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:01,726 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 567 transitions. [2021-10-05 22:43:01,726 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 22:43:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 567 transitions. [2021-10-05 22:43:01,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:01,726 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:01,726 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:01,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220 [2021-10-05 22:43:01,727 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 22:43:01,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:01,727 INFO L82 PathProgramCache]: Analyzing trace with hash 916414243, now seen corresponding path program 221 times [2021-10-05 22:43:01,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:01,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291228995] [2021-10-05 22:43:01,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:01,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:01,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 22:43:01,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:01,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291228995] [2021-10-05 22:43:01,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291228995] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:01,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:01,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:43:01,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848094740] [2021-10-05 22:43:01,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:43:01,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:01,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:43:01,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:43:01,843 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 22:43:02,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:02,100 INFO L93 Difference]: Finished difference Result 416 states and 914 transitions. [2021-10-05 22:43:02,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:43:02,101 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 22:43:02,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:02,102 INFO L225 Difference]: With dead ends: 416 [2021-10-05 22:43:02,102 INFO L226 Difference]: Without dead ends: 408 [2021-10-05 22:43:02,102 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 126.8ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:43:02,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-10-05 22:43:02,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 262. [2021-10-05 22:43:02,105 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 22:43:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 577 transitions. [2021-10-05 22:43:02,106 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 577 transitions. Word has length 38 [2021-10-05 22:43:02,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:02,106 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 577 transitions. [2021-10-05 22:43:02,106 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 22:43:02,106 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 577 transitions. [2021-10-05 22:43:02,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:02,107 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:02,107 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:02,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable221 [2021-10-05 22:43:02,107 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 22:43:02,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:02,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1911379763, now seen corresponding path program 222 times [2021-10-05 22:43:02,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:02,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452499252] [2021-10-05 22:43:02,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:02,108 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:02,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:02,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452499252] [2021-10-05 22:43:02,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452499252] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:02,217 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:02,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:02,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270383836] [2021-10-05 22:43:02,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:02,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:02,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:02,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:02,218 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 22:43:02,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:02,469 INFO L93 Difference]: Finished difference Result 408 states and 892 transitions. [2021-10-05 22:43:02,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:43:02,469 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 22:43:02,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:02,470 INFO L225 Difference]: With dead ends: 408 [2021-10-05 22:43:02,470 INFO L226 Difference]: Without dead ends: 388 [2021-10-05 22:43:02,471 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 124.7ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:43:02,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-10-05 22:43:02,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 260. [2021-10-05 22:43:02,474 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 22:43:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 572 transitions. [2021-10-05 22:43:02,474 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 572 transitions. Word has length 38 [2021-10-05 22:43:02,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:02,475 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 572 transitions. [2021-10-05 22:43:02,475 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 22:43:02,475 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 572 transitions. [2021-10-05 22:43:02,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:02,475 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:02,476 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:02,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable222 [2021-10-05 22:43:02,476 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 22:43:02,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:02,476 INFO L82 PathProgramCache]: Analyzing trace with hash -692991017, now seen corresponding path program 223 times [2021-10-05 22:43:02,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:02,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308218583] [2021-10-05 22:43:02,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:02,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:02,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:02,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:02,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308218583] [2021-10-05 22:43:02,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308218583] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:02,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:02,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:43:02,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232931870] [2021-10-05 22:43:02,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:43:02,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:02,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:43:02,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:43:02,585 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 22:43:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:02,829 INFO L93 Difference]: Finished difference Result 382 states and 837 transitions. [2021-10-05 22:43:02,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:43:02,830 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 22:43:02,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:02,831 INFO L225 Difference]: With dead ends: 382 [2021-10-05 22:43:02,831 INFO L226 Difference]: Without dead ends: 374 [2021-10-05 22:43:02,831 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 116.3ms TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:43:02,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-10-05 22:43:02,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 262. [2021-10-05 22:43:02,836 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 22:43:02,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 575 transitions. [2021-10-05 22:43:02,837 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 575 transitions. Word has length 38 [2021-10-05 22:43:02,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:02,837 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 575 transitions. [2021-10-05 22:43:02,837 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 22:43:02,838 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 575 transitions. [2021-10-05 22:43:02,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:02,838 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:02,839 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:02,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable223 [2021-10-05 22:43:02,839 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 22:43:02,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:02,839 INFO L82 PathProgramCache]: Analyzing trace with hash 28179911, now seen corresponding path program 224 times [2021-10-05 22:43:02,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:02,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506861141] [2021-10-05 22:43:02,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:02,840 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:02,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:02,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:02,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506861141] [2021-10-05 22:43:02,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506861141] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:02,965 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:02,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:02,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056413512] [2021-10-05 22:43:02,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:02,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:02,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:02,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:02,966 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 22:43:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:03,265 INFO L93 Difference]: Finished difference Result 380 states and 830 transitions. [2021-10-05 22:43:03,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:43:03,265 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 22:43:03,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:03,266 INFO L225 Difference]: With dead ends: 380 [2021-10-05 22:43:03,267 INFO L226 Difference]: Without dead ends: 372 [2021-10-05 22:43:03,267 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 140.5ms TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:43:03,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-10-05 22:43:03,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 260. [2021-10-05 22:43:03,270 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 22:43:03,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 570 transitions. [2021-10-05 22:43:03,270 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 570 transitions. Word has length 38 [2021-10-05 22:43:03,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:03,271 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 570 transitions. [2021-10-05 22:43:03,271 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 22:43:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 570 transitions. [2021-10-05 22:43:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:03,271 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:03,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 22:43:03,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable224 [2021-10-05 22:43:03,272 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 22:43:03,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:03,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1029917475, now seen corresponding path program 225 times [2021-10-05 22:43:03,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:03,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737980337] [2021-10-05 22:43:03,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:03,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:03,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:03,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737980337] [2021-10-05 22:43:03,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737980337] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:03,401 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:03,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:03,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170866467] [2021-10-05 22:43:03,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:03,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:03,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:03,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:03,402 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 22:43:03,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:03,711 INFO L93 Difference]: Finished difference Result 374 states and 815 transitions. [2021-10-05 22:43:03,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:43:03,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 22:43:03,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:03,712 INFO L225 Difference]: With dead ends: 374 [2021-10-05 22:43:03,712 INFO L226 Difference]: Without dead ends: 356 [2021-10-05 22:43:03,713 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 180.1ms TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:43:03,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-10-05 22:43:03,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 262. [2021-10-05 22:43:03,716 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 22:43:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 573 transitions. [2021-10-05 22:43:03,717 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 573 transitions. Word has length 38 [2021-10-05 22:43:03,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:03,717 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 573 transitions. [2021-10-05 22:43:03,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 22:43:03,717 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 573 transitions. [2021-10-05 22:43:03,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:03,718 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:03,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 22:43:03,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable225 [2021-10-05 22:43:03,718 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 22:43:03,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:03,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1775919837, now seen corresponding path program 226 times [2021-10-05 22:43:03,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:03,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738787215] [2021-10-05 22:43:03,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:03,719 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:03,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:03,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:03,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738787215] [2021-10-05 22:43:03,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738787215] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:03,846 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:03,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:03,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253976997] [2021-10-05 22:43:03,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:03,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:03,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:03,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:03,847 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 22:43:04,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:04,176 INFO L93 Difference]: Finished difference Result 370 states and 803 transitions. [2021-10-05 22:43:04,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:43:04,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 22:43:04,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:04,177 INFO L225 Difference]: With dead ends: 370 [2021-10-05 22:43:04,177 INFO L226 Difference]: Without dead ends: 346 [2021-10-05 22:43:04,177 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 172.6ms TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:43:04,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-10-05 22:43:04,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 252. [2021-10-05 22:43:04,181 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 22:43:04,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 556 transitions. [2021-10-05 22:43:04,182 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 556 transitions. Word has length 38 [2021-10-05 22:43:04,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:04,182 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 556 transitions. [2021-10-05 22:43:04,182 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 22:43:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 556 transitions. [2021-10-05 22:43:04,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:04,183 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:04,183 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:04,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2021-10-05 22:43:04,184 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 22:43:04,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:04,184 INFO L82 PathProgramCache]: Analyzing trace with hash -507210333, now seen corresponding path program 227 times [2021-10-05 22:43:04,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:04,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57533692] [2021-10-05 22:43:04,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:04,185 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:04,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 22:43:04,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:04,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57533692] [2021-10-05 22:43:04,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57533692] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:04,327 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:04,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:04,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480270274] [2021-10-05 22:43:04,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:04,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:04,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:04,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:04,329 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 22:43:04,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:04,688 INFO L93 Difference]: Finished difference Result 304 states and 652 transitions. [2021-10-05 22:43:04,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 22:43:04,688 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 22:43:04,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:04,689 INFO L225 Difference]: With dead ends: 304 [2021-10-05 22:43:04,689 INFO L226 Difference]: Without dead ends: 282 [2021-10-05 22:43:04,690 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 229.8ms TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2021-10-05 22:43:04,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-10-05 22:43:04,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 254. [2021-10-05 22:43:04,694 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 22:43:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 559 transitions. [2021-10-05 22:43:04,695 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 559 transitions. Word has length 38 [2021-10-05 22:43:04,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:04,696 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 559 transitions. [2021-10-05 22:43:04,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 22:43:04,696 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 559 transitions. [2021-10-05 22:43:04,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:04,697 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:04,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 22:43:04,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable227 [2021-10-05 22:43:04,697 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 22:43:04,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:04,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1212946781, now seen corresponding path program 228 times [2021-10-05 22:43:04,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:04,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656687040] [2021-10-05 22:43:04,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:04,699 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:04,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 22:43:04,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:04,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656687040] [2021-10-05 22:43:04,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656687040] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:04,839 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:04,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:04,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051141634] [2021-10-05 22:43:04,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:04,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:04,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:04,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:04,840 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 22:43:05,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:05,291 INFO L93 Difference]: Finished difference Result 344 states and 734 transitions. [2021-10-05 22:43:05,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 22:43:05,292 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 22:43:05,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:05,293 INFO L225 Difference]: With dead ends: 344 [2021-10-05 22:43:05,293 INFO L226 Difference]: Without dead ends: 324 [2021-10-05 22:43:05,293 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 252.6ms TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2021-10-05 22:43:05,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-10-05 22:43:05,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 260. [2021-10-05 22:43:05,296 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 22:43:05,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 568 transitions. [2021-10-05 22:43:05,297 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 568 transitions. Word has length 38 [2021-10-05 22:43:05,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:05,297 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 568 transitions. [2021-10-05 22:43:05,297 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 22:43:05,297 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 568 transitions. [2021-10-05 22:43:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:05,298 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:05,298 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:05,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable228 [2021-10-05 22:43:05,298 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 22:43:05,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:05,298 INFO L82 PathProgramCache]: Analyzing trace with hash -2097883935, now seen corresponding path program 229 times [2021-10-05 22:43:05,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:05,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398803397] [2021-10-05 22:43:05,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:05,299 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:05,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:05,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398803397] [2021-10-05 22:43:05,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398803397] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:05,409 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:05,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:05,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967815562] [2021-10-05 22:43:05,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:05,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:05,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:05,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:05,411 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 22:43:05,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:05,703 INFO L93 Difference]: Finished difference Result 414 states and 893 transitions. [2021-10-05 22:43:05,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:43:05,704 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 22:43:05,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:05,705 INFO L225 Difference]: With dead ends: 414 [2021-10-05 22:43:05,705 INFO L226 Difference]: Without dead ends: 396 [2021-10-05 22:43:05,705 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 139.3ms TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:43:05,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-10-05 22:43:05,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 262. [2021-10-05 22:43:05,709 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 22:43:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 571 transitions. [2021-10-05 22:43:05,710 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 571 transitions. Word has length 38 [2021-10-05 22:43:05,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:05,710 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 571 transitions. [2021-10-05 22:43:05,710 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 22:43:05,710 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 571 transitions. [2021-10-05 22:43:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:05,711 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:05,711 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:05,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable229 [2021-10-05 22:43:05,711 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 22:43:05,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:05,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1451080999, now seen corresponding path program 230 times [2021-10-05 22:43:05,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:05,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069102438] [2021-10-05 22:43:05,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:05,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:05,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 22:43:05,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:05,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069102438] [2021-10-05 22:43:05,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069102438] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:05,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:05,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:05,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688557924] [2021-10-05 22:43:05,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:05,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:05,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:05,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:05,815 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 22:43:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:06,070 INFO L93 Difference]: Finished difference Result 328 states and 702 transitions. [2021-10-05 22:43:06,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:43:06,070 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 22:43:06,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:06,071 INFO L225 Difference]: With dead ends: 328 [2021-10-05 22:43:06,071 INFO L226 Difference]: Without dead ends: 302 [2021-10-05 22:43:06,071 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 123.9ms TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:43:06,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-10-05 22:43:06,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 250. [2021-10-05 22:43:06,074 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 22:43:06,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 551 transitions. [2021-10-05 22:43:06,074 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 551 transitions. Word has length 38 [2021-10-05 22:43:06,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:06,075 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 551 transitions. [2021-10-05 22:43:06,075 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 22:43:06,075 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 551 transitions. [2021-10-05 22:43:06,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:06,075 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:06,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 22:43:06,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230 [2021-10-05 22:43:06,076 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 22:43:06,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:06,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1151184825, now seen corresponding path program 231 times [2021-10-05 22:43:06,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:06,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793546615] [2021-10-05 22:43:06,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:06,076 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:06,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:06,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793546615] [2021-10-05 22:43:06,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793546615] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:06,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:06,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:06,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590691372] [2021-10-05 22:43:06,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:06,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:06,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:06,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:06,207 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 22:43:06,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:06,521 INFO L93 Difference]: Finished difference Result 274 states and 589 transitions. [2021-10-05 22:43:06,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:43:06,521 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 22:43:06,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:06,522 INFO L225 Difference]: With dead ends: 274 [2021-10-05 22:43:06,522 INFO L226 Difference]: Without dead ends: 246 [2021-10-05 22:43:06,523 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 185.1ms TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:43:06,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-10-05 22:43:06,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2021-10-05 22:43:06,526 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 22:43:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 536 transitions. [2021-10-05 22:43:06,527 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 536 transitions. Word has length 38 [2021-10-05 22:43:06,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:06,527 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 536 transitions. [2021-10-05 22:43:06,527 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 22:43:06,527 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 536 transitions. [2021-10-05 22:43:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:06,528 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:06,528 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:06,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231 [2021-10-05 22:43:06,528 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 22:43:06,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:06,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1493233475, now seen corresponding path program 232 times [2021-10-05 22:43:06,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:06,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381257689] [2021-10-05 22:43:06,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:06,530 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:06,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:06,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:06,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381257689] [2021-10-05 22:43:06,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381257689] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:06,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:06,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:06,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359404204] [2021-10-05 22:43:06,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:06,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:06,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:06,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:06,679 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 22:43:07,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:07,038 INFO L93 Difference]: Finished difference Result 274 states and 589 transitions. [2021-10-05 22:43:07,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:43:07,039 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 22:43:07,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:07,040 INFO L225 Difference]: With dead ends: 274 [2021-10-05 22:43:07,040 INFO L226 Difference]: Without dead ends: 252 [2021-10-05 22:43:07,040 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 233.3ms TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:43:07,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-10-05 22:43:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 246. [2021-10-05 22:43:07,043 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 22:43:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 539 transitions. [2021-10-05 22:43:07,043 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 539 transitions. Word has length 38 [2021-10-05 22:43:07,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:07,043 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 539 transitions. [2021-10-05 22:43:07,044 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 22:43:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 539 transitions. [2021-10-05 22:43:07,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:07,044 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43: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 22:43:07,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable232 [2021-10-05 22:43:07,045 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 22:43:07,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:07,045 INFO L82 PathProgramCache]: Analyzing trace with hash 787497027, now seen corresponding path program 233 times [2021-10-05 22:43:07,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:07,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258051475] [2021-10-05 22:43:07,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:07,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:07,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 22:43:07,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:07,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258051475] [2021-10-05 22:43:07,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258051475] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:07,174 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:07,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:07,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735213610] [2021-10-05 22:43:07,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:07,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:07,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:07,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:07,175 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 22:43:07,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:07,550 INFO L93 Difference]: Finished difference Result 306 states and 659 transitions. [2021-10-05 22:43:07,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:43:07,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 22:43:07,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:07,551 INFO L225 Difference]: With dead ends: 306 [2021-10-05 22:43:07,551 INFO L226 Difference]: Without dead ends: 286 [2021-10-05 22:43:07,552 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 189.3ms TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:43:07,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-10-05 22:43:07,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 252. [2021-10-05 22:43:07,557 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 22:43:07,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 548 transitions. [2021-10-05 22:43:07,557 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 548 transitions. Word has length 38 [2021-10-05 22:43:07,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:07,558 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 548 transitions. [2021-10-05 22:43:07,558 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 22:43:07,558 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 548 transitions. [2021-10-05 22:43:07,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:07,559 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:07,559 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:07,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable233 [2021-10-05 22:43:07,559 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 22:43:07,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:07,560 INFO L82 PathProgramCache]: Analyzing trace with hash -97440127, now seen corresponding path program 234 times [2021-10-05 22:43:07,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:07,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053149275] [2021-10-05 22:43:07,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:07,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:07,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:07,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:07,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053149275] [2021-10-05 22:43:07,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053149275] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:07,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:07,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:07,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420332647] [2021-10-05 22:43:07,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:07,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:07,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:07,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:07,696 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 22:43:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:08,041 INFO L93 Difference]: Finished difference Result 328 states and 706 transitions. [2021-10-05 22:43:08,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:43:08,041 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 22:43:08,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:08,042 INFO L225 Difference]: With dead ends: 328 [2021-10-05 22:43:08,042 INFO L226 Difference]: Without dead ends: 310 [2021-10-05 22:43:08,042 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 195.3ms TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:43:08,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-10-05 22:43:08,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 254. [2021-10-05 22:43:08,045 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 22:43:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 551 transitions. [2021-10-05 22:43:08,046 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 551 transitions. Word has length 38 [2021-10-05 22:43:08,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:08,046 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 551 transitions. [2021-10-05 22:43:08,046 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 22:43:08,046 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 551 transitions. [2021-10-05 22:43:08,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:08,047 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:08,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 22:43:08,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable234 [2021-10-05 22:43:08,047 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 22:43:08,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:08,047 INFO L82 PathProgramCache]: Analyzing trace with hash -843442489, now seen corresponding path program 235 times [2021-10-05 22:43:08,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:08,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965558781] [2021-10-05 22:43:08,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:08,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:08,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:08,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965558781] [2021-10-05 22:43:08,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965558781] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:08,184 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:08,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:08,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301431060] [2021-10-05 22:43:08,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:08,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:08,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:08,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:08,185 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 22:43:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:08,515 INFO L93 Difference]: Finished difference Result 298 states and 639 transitions. [2021-10-05 22:43:08,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:43:08,516 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 22:43:08,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:08,517 INFO L225 Difference]: With dead ends: 298 [2021-10-05 22:43:08,517 INFO L226 Difference]: Without dead ends: 262 [2021-10-05 22:43:08,517 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 189.2ms TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:43:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-10-05 22:43:08,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 232. [2021-10-05 22:43:08,519 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 22:43:08,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 508 transitions. [2021-10-05 22:43:08,520 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 508 transitions. Word has length 38 [2021-10-05 22:43:08,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:08,520 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 508 transitions. [2021-10-05 22:43:08,520 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 22:43:08,520 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 508 transitions. [2021-10-05 22:43:08,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:08,521 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:08,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 22:43:08,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable235 [2021-10-05 22:43:08,521 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 22:43:08,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:08,521 INFO L82 PathProgramCache]: Analyzing trace with hash -151435657, now seen corresponding path program 236 times [2021-10-05 22:43:08,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:08,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695276055] [2021-10-05 22:43:08,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:08,522 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:08,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:08,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:08,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695276055] [2021-10-05 22:43:08,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695276055] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:08,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:08,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:08,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506909558] [2021-10-05 22:43:08,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:08,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:08,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:08,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:08,652 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 22:43:08,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:08,933 INFO L93 Difference]: Finished difference Result 276 states and 592 transitions. [2021-10-05 22:43:08,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:43:08,933 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 22:43:08,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:08,934 INFO L225 Difference]: With dead ends: 276 [2021-10-05 22:43:08,934 INFO L226 Difference]: Without dead ends: 264 [2021-10-05 22:43:08,934 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 145.2ms TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:43:08,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-10-05 22:43:08,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 240. [2021-10-05 22:43:08,937 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 22:43:08,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 522 transitions. [2021-10-05 22:43:08,938 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 522 transitions. Word has length 38 [2021-10-05 22:43:08,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:08,938 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 522 transitions. [2021-10-05 22:43:08,938 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 22:43:08,938 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 522 transitions. [2021-10-05 22:43:08,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:08,939 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:08,939 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:08,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236 [2021-10-05 22:43:08,939 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 22:43:08,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:08,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1245302793, now seen corresponding path program 237 times [2021-10-05 22:43:08,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:08,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554498333] [2021-10-05 22:43:08,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:08,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:09,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:09,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554498333] [2021-10-05 22:43:09,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554498333] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:09,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:09,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:09,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046719054] [2021-10-05 22:43:09,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:09,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:09,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:09,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:09,060 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 22:43:09,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:09,328 INFO L93 Difference]: Finished difference Result 268 states and 574 transitions. [2021-10-05 22:43:09,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:43:09,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 22:43:09,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:09,329 INFO L225 Difference]: With dead ends: 268 [2021-10-05 22:43:09,329 INFO L226 Difference]: Without dead ends: 262 [2021-10-05 22:43:09,330 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 131.3ms TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:43:09,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-10-05 22:43:09,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 242. [2021-10-05 22:43:09,332 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 22:43:09,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 525 transitions. [2021-10-05 22:43:09,333 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 525 transitions. Word has length 38 [2021-10-05 22:43:09,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:09,333 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 525 transitions. [2021-10-05 22:43:09,333 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 22:43:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 525 transitions. [2021-10-05 22:43:09,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:09,334 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:09,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 22:43:09,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable237 [2021-10-05 22:43:09,334 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 22:43:09,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:09,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1787029165, now seen corresponding path program 238 times [2021-10-05 22:43:09,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:09,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596502425] [2021-10-05 22:43:09,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:09,335 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:09,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:09,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:09,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596502425] [2021-10-05 22:43:09,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596502425] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:09,466 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:09,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:09,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557913020] [2021-10-05 22:43:09,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:09,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:09,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:09,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:09,467 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 22:43:09,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:09,752 INFO L93 Difference]: Finished difference Result 324 states and 694 transitions. [2021-10-05 22:43:09,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:43:09,752 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 22:43:09,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:09,753 INFO L225 Difference]: With dead ends: 324 [2021-10-05 22:43:09,753 INFO L226 Difference]: Without dead ends: 308 [2021-10-05 22:43:09,753 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 130.0ms TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:43:09,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-10-05 22:43:09,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 234. [2021-10-05 22:43:09,757 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 22:43:09,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 511 transitions. [2021-10-05 22:43:09,757 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 511 transitions. Word has length 38 [2021-10-05 22:43:09,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:09,757 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 511 transitions. [2021-10-05 22:43:09,757 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 22:43:09,758 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 511 transitions. [2021-10-05 22:43:09,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:09,758 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:09,758 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:09,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable238 [2021-10-05 22:43:09,758 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 22:43:09,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:09,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1839450267, now seen corresponding path program 239 times [2021-10-05 22:43:09,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:09,759 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257204816] [2021-10-05 22:43:09,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:09,759 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:09,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 22:43:09,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:09,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257204816] [2021-10-05 22:43:09,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257204816] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:09,891 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:09,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:09,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954670865] [2021-10-05 22:43:09,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:09,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:09,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:09,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:09,892 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 22:43:10,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:10,178 INFO L93 Difference]: Finished difference Result 268 states and 570 transitions. [2021-10-05 22:43:10,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:43:10,179 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 22:43:10,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:10,180 INFO L225 Difference]: With dead ends: 268 [2021-10-05 22:43:10,180 INFO L226 Difference]: Without dead ends: 252 [2021-10-05 22:43:10,180 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 149.7ms TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:43:10,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-10-05 22:43:10,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 232. [2021-10-05 22:43:10,182 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 22:43:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 506 transitions. [2021-10-05 22:43:10,183 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 506 transitions. Word has length 38 [2021-10-05 22:43:10,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:10,183 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 506 transitions. [2021-10-05 22:43:10,183 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 22:43:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 506 transitions. [2021-10-05 22:43:10,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:10,183 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:10,184 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:10,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable239 [2021-10-05 22:43:10,184 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 22:43:10,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:10,184 INFO L82 PathProgramCache]: Analyzing trace with hash 379960059, now seen corresponding path program 240 times [2021-10-05 22:43:10,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:10,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406763872] [2021-10-05 22:43:10,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:10,185 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:10,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:10,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:10,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406763872] [2021-10-05 22:43:10,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406763872] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:10,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:10,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:10,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127142428] [2021-10-05 22:43:10,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:10,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:10,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:10,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:10,309 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 22:43:10,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:10,509 INFO L93 Difference]: Finished difference Result 256 states and 540 transitions. [2021-10-05 22:43:10,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:43:10,510 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 22:43:10,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:10,511 INFO L225 Difference]: With dead ends: 256 [2021-10-05 22:43:10,511 INFO L226 Difference]: Without dead ends: 230 [2021-10-05 22:43:10,511 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 105.4ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-10-05 22:43:10,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-10-05 22:43:10,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2021-10-05 22:43:10,514 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 22:43:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 487 transitions. [2021-10-05 22:43:10,515 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 487 transitions. Word has length 38 [2021-10-05 22:43:10,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:10,515 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 487 transitions. [2021-10-05 22:43:10,515 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 22:43:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 487 transitions. [2021-10-05 22:43:10,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:10,515 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:10,516 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:10,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240 [2021-10-05 22:43:10,516 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 22:43:10,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:10,516 INFO L82 PathProgramCache]: Analyzing trace with hash 119289125, now seen corresponding path program 241 times [2021-10-05 22:43:10,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:10,516 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066080325] [2021-10-05 22:43:10,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:10,517 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:10,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:10,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:10,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066080325] [2021-10-05 22:43:10,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066080325] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:10,612 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:10,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:43:10,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653496987] [2021-10-05 22:43:10,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:43:10,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:10,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:43:10,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:43:10,613 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 22:43:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:10,891 INFO L93 Difference]: Finished difference Result 292 states and 618 transitions. [2021-10-05 22:43:10,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:43:10,892 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 22:43:10,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:10,892 INFO L225 Difference]: With dead ends: 292 [2021-10-05 22:43:10,892 INFO L226 Difference]: Without dead ends: 280 [2021-10-05 22:43:10,893 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 117.5ms TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:43:10,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-10-05 22:43:10,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 236. [2021-10-05 22:43:10,895 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 22:43:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 508 transitions. [2021-10-05 22:43:10,896 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 508 transitions. Word has length 38 [2021-10-05 22:43:10,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:10,896 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 508 transitions. [2021-10-05 22:43:10,896 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 22:43:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 508 transitions. [2021-10-05 22:43:10,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:10,897 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:10,897 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:10,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable241 [2021-10-05 22:43:10,897 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 22:43:10,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:10,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1516027575, now seen corresponding path program 242 times [2021-10-05 22:43:10,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:10,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195760027] [2021-10-05 22:43:10,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:10,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:11,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:11,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:11,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195760027] [2021-10-05 22:43:11,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195760027] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:11,021 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:11,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:11,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415732589] [2021-10-05 22:43:11,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:11,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:11,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:11,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:11,023 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 22:43:11,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:11,318 INFO L93 Difference]: Finished difference Result 268 states and 568 transitions. [2021-10-05 22:43:11,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:43:11,319 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 22:43:11,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:11,320 INFO L225 Difference]: With dead ends: 268 [2021-10-05 22:43:11,320 INFO L226 Difference]: Without dead ends: 262 [2021-10-05 22:43:11,320 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 174.2ms TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:43:11,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-10-05 22:43:11,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 238. [2021-10-05 22:43:11,323 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 22:43:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 511 transitions. [2021-10-05 22:43:11,323 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 511 transitions. Word has length 38 [2021-10-05 22:43:11,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:11,323 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 511 transitions. [2021-10-05 22:43:11,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 22:43:11,324 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 511 transitions. [2021-10-05 22:43:11,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:11,324 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:11,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 22:43:11,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242 [2021-10-05 22:43:11,324 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 22:43:11,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:11,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1516304383, now seen corresponding path program 243 times [2021-10-05 22:43:11,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:11,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976421719] [2021-10-05 22:43:11,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:11,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:11,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:11,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976421719] [2021-10-05 22:43:11,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976421719] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:11,447 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:11,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:11,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188424459] [2021-10-05 22:43:11,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:11,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:11,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:11,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:11,449 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 22:43:11,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:11,780 INFO L93 Difference]: Finished difference Result 380 states and 816 transitions. [2021-10-05 22:43:11,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:43:11,781 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 22:43:11,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:11,782 INFO L225 Difference]: With dead ends: 380 [2021-10-05 22:43:11,782 INFO L226 Difference]: Without dead ends: 364 [2021-10-05 22:43:11,782 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 170.6ms TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:43:11,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-10-05 22:43:11,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 244. [2021-10-05 22:43:11,785 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 22:43:11,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 536 transitions. [2021-10-05 22:43:11,786 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 536 transitions. Word has length 38 [2021-10-05 22:43:11,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:11,786 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 536 transitions. [2021-10-05 22:43:11,786 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 22:43:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 536 transitions. [2021-10-05 22:43:11,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:11,787 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:11,787 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:11,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable243 [2021-10-05 22:43:11,787 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 22:43:11,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:11,787 INFO L82 PathProgramCache]: Analyzing trace with hash 2110175049, now seen corresponding path program 244 times [2021-10-05 22:43:11,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:11,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190336959] [2021-10-05 22:43:11,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:11,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:11,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:11,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:11,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190336959] [2021-10-05 22:43:11,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190336959] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:11,888 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:11,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:43:11,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194851563] [2021-10-05 22:43:11,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:43:11,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:11,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:43:11,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:43:11,890 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 22:43:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:12,114 INFO L93 Difference]: Finished difference Result 282 states and 603 transitions. [2021-10-05 22:43:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:43:12,115 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 22:43:12,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:12,116 INFO L225 Difference]: With dead ends: 282 [2021-10-05 22:43:12,116 INFO L226 Difference]: Without dead ends: 266 [2021-10-05 22:43:12,116 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 129.1ms TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:43:12,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-10-05 22:43:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 242. [2021-10-05 22:43:12,119 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 22:43:12,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 531 transitions. [2021-10-05 22:43:12,120 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 531 transitions. Word has length 38 [2021-10-05 22:43:12,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:12,120 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 531 transitions. [2021-10-05 22:43:12,120 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 22:43:12,120 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 531 transitions. [2021-10-05 22:43:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:12,121 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:12,121 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:12,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable244 [2021-10-05 22:43:12,121 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 22:43:12,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:12,121 INFO L82 PathProgramCache]: Analyzing trace with hash -410547425, now seen corresponding path program 245 times [2021-10-05 22:43:12,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:12,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877458136] [2021-10-05 22:43:12,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:12,122 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:12,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:12,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877458136] [2021-10-05 22:43:12,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877458136] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:12,219 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:12,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:43:12,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335455739] [2021-10-05 22:43:12,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:43:12,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:12,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:43:12,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:43:12,220 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 22:43:12,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:12,468 INFO L93 Difference]: Finished difference Result 296 states and 634 transitions. [2021-10-05 22:43:12,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:43:12,469 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 22:43:12,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:12,470 INFO L225 Difference]: With dead ends: 296 [2021-10-05 22:43:12,470 INFO L226 Difference]: Without dead ends: 284 [2021-10-05 22:43:12,470 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 114.1ms TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:43:12,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-10-05 22:43:12,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 242. [2021-10-05 22:43:12,473 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 22:43:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 525 transitions. [2021-10-05 22:43:12,473 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 525 transitions. Word has length 38 [2021-10-05 22:43:12,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:12,473 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 525 transitions. [2021-10-05 22:43:12,473 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 22:43:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 525 transitions. [2021-10-05 22:43:12,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:12,474 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:12,474 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:12,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable245 [2021-10-05 22:43:12,474 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 22:43:12,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:12,475 INFO L82 PathProgramCache]: Analyzing trace with hash 986191025, now seen corresponding path program 246 times [2021-10-05 22:43:12,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:12,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980254793] [2021-10-05 22:43:12,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:12,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:12,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:12,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980254793] [2021-10-05 22:43:12,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980254793] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:12,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:12,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:12,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668599127] [2021-10-05 22:43:12,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:12,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:12,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:12,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:12,595 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 22:43:12,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:12,937 INFO L93 Difference]: Finished difference Result 356 states and 756 transitions. [2021-10-05 22:43:12,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:43:12,937 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 22:43:12,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:12,938 INFO L225 Difference]: With dead ends: 356 [2021-10-05 22:43:12,939 INFO L226 Difference]: Without dead ends: 342 [2021-10-05 22:43:12,939 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 165.9ms TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:43:12,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-10-05 22:43:12,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 234. [2021-10-05 22:43:12,942 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 22:43:12,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 507 transitions. [2021-10-05 22:43:12,943 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 507 transitions. Word has length 38 [2021-10-05 22:43:12,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:12,943 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 507 transitions. [2021-10-05 22:43:12,943 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 22:43:12,943 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 507 transitions. [2021-10-05 22:43:12,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:12,943 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:12,943 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:12,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable246 [2021-10-05 22:43:12,944 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 22:43:12,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:12,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1147605001, now seen corresponding path program 247 times [2021-10-05 22:43:12,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:12,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020185921] [2021-10-05 22:43:12,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:12,944 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:13,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 22:43:13,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:13,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020185921] [2021-10-05 22:43:13,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020185921] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:13,039 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:13,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:13,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764025766] [2021-10-05 22:43:13,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:13,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:13,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:13,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:13,041 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 22:43:13,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:13,339 INFO L93 Difference]: Finished difference Result 296 states and 626 transitions. [2021-10-05 22:43:13,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 22:43:13,340 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 22:43:13,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:13,340 INFO L225 Difference]: With dead ends: 296 [2021-10-05 22:43:13,340 INFO L226 Difference]: Without dead ends: 276 [2021-10-05 22:43:13,341 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 135.7ms TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:43:13,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-10-05 22:43:13,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 240. [2021-10-05 22:43:13,344 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 22:43:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 516 transitions. [2021-10-05 22:43:13,344 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 516 transitions. Word has length 38 [2021-10-05 22:43:13,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:13,344 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 516 transitions. [2021-10-05 22:43:13,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 22:43:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 516 transitions. [2021-10-05 22:43:13,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:13,345 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:13,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 22:43:13,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable247 [2021-10-05 22:43:13,345 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 22:43:13,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:13,346 INFO L82 PathProgramCache]: Analyzing trace with hash 411384369, now seen corresponding path program 248 times [2021-10-05 22:43:13,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:13,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486382155] [2021-10-05 22:43:13,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:13,346 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:13,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:13,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:13,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486382155] [2021-10-05 22:43:13,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486382155] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:13,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:13,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:13,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518368356] [2021-10-05 22:43:13,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:13,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:13,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:13,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:13,481 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 22:43:13,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:13,857 INFO L93 Difference]: Finished difference Result 334 states and 701 transitions. [2021-10-05 22:43:13,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 22:43:13,857 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 22:43:13,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:13,858 INFO L225 Difference]: With dead ends: 334 [2021-10-05 22:43:13,858 INFO L226 Difference]: Without dead ends: 294 [2021-10-05 22:43:13,859 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 203.5ms TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:43:13,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-10-05 22:43:13,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 234. [2021-10-05 22:43:13,861 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 22:43:13,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 501 transitions. [2021-10-05 22:43:13,862 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 501 transitions. Word has length 38 [2021-10-05 22:43:13,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:13,862 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 501 transitions. [2021-10-05 22:43:13,862 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 22:43:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 501 transitions. [2021-10-05 22:43:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:13,863 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:13,863 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:13,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable248 [2021-10-05 22:43:13,863 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 22:43:13,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:13,863 INFO L82 PathProgramCache]: Analyzing trace with hash -361812087, now seen corresponding path program 249 times [2021-10-05 22:43:13,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:13,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140695093] [2021-10-05 22:43:13,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:13,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:13,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 22:43:13,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:13,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140695093] [2021-10-05 22:43:13,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140695093] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:13,971 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:13,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:13,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981523409] [2021-10-05 22:43:13,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:13,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:13,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:13,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:13,972 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 22:43:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:14,265 INFO L93 Difference]: Finished difference Result 304 states and 644 transitions. [2021-10-05 22:43:14,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:43:14,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 22:43:14,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:14,266 INFO L225 Difference]: With dead ends: 304 [2021-10-05 22:43:14,267 INFO L226 Difference]: Without dead ends: 292 [2021-10-05 22:43:14,267 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 152.3ms TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:43:14,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-10-05 22:43:14,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 236. [2021-10-05 22:43:14,270 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 22:43:14,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 506 transitions. [2021-10-05 22:43:14,270 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 506 transitions. Word has length 38 [2021-10-05 22:43:14,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:14,270 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 506 transitions. [2021-10-05 22:43:14,270 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 22:43:14,270 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 506 transitions. [2021-10-05 22:43:14,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:14,271 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:14,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 22:43:14,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable249 [2021-10-05 22:43:14,272 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 22:43:14,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:14,272 INFO L82 PathProgramCache]: Analyzing trace with hash 760603359, now seen corresponding path program 250 times [2021-10-05 22:43:14,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:14,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132358024] [2021-10-05 22:43:14,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:14,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:14,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 22:43:14,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:14,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132358024] [2021-10-05 22:43:14,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132358024] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:14,367 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:14,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:14,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692290060] [2021-10-05 22:43:14,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:14,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:14,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:14,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:14,368 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 22:43:14,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:14,656 INFO L93 Difference]: Finished difference Result 312 states and 654 transitions. [2021-10-05 22:43:14,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:43:14,657 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 22:43:14,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:14,658 INFO L225 Difference]: With dead ends: 312 [2021-10-05 22:43:14,658 INFO L226 Difference]: Without dead ends: 290 [2021-10-05 22:43:14,658 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 150.6ms TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:43:14,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-10-05 22:43:14,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 236. [2021-10-05 22:43:14,661 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 22:43:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 504 transitions. [2021-10-05 22:43:14,662 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 504 transitions. Word has length 38 [2021-10-05 22:43:14,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:14,662 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 504 transitions. [2021-10-05 22:43:14,662 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 22:43:14,662 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 504 transitions. [2021-10-05 22:43:14,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:14,663 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:14,663 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:14,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250 [2021-10-05 22:43:14,663 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 22:43:14,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:14,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1784738785, now seen corresponding path program 251 times [2021-10-05 22:43:14,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:14,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228827396] [2021-10-05 22:43:14,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:14,664 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:14,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:14,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:14,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228827396] [2021-10-05 22:43:14,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228827396] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:14,781 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:14,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:43:14,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497310788] [2021-10-05 22:43:14,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:43:14,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:14,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:43:14,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:43:14,783 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 22:43:15,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:15,000 INFO L93 Difference]: Finished difference Result 326 states and 691 transitions. [2021-10-05 22:43:15,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:43:15,001 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 22:43:15,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:15,002 INFO L225 Difference]: With dead ends: 326 [2021-10-05 22:43:15,002 INFO L226 Difference]: Without dead ends: 318 [2021-10-05 22:43:15,002 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 122.6ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-10-05 22:43:15,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-10-05 22:43:15,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 238. [2021-10-05 22:43:15,005 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 22:43:15,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 507 transitions. [2021-10-05 22:43:15,005 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 507 transitions. Word has length 38 [2021-10-05 22:43:15,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:15,005 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 507 transitions. [2021-10-05 22:43:15,006 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 22:43:15,006 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 507 transitions. [2021-10-05 22:43:15,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:15,006 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:15,006 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:15,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable251 [2021-10-05 22:43:15,006 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 22:43:15,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:15,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1609984503, now seen corresponding path program 252 times [2021-10-05 22:43:15,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:15,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55344047] [2021-10-05 22:43:15,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:15,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:15,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:15,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:15,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55344047] [2021-10-05 22:43:15,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55344047] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:15,136 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:15,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:15,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574270726] [2021-10-05 22:43:15,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:15,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:15,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:15,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:15,138 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 22:43:15,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:15,424 INFO L93 Difference]: Finished difference Result 338 states and 709 transitions. [2021-10-05 22:43:15,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:43:15,425 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 22:43:15,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:15,426 INFO L225 Difference]: With dead ends: 338 [2021-10-05 22:43:15,426 INFO L226 Difference]: Without dead ends: 310 [2021-10-05 22:43:15,426 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 153.2ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:43:15,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-10-05 22:43:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 228. [2021-10-05 22:43:15,429 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 22:43:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 490 transitions. [2021-10-05 22:43:15,430 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 490 transitions. Word has length 38 [2021-10-05 22:43:15,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:15,430 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 490 transitions. [2021-10-05 22:43:15,430 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 22:43:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 490 transitions. [2021-10-05 22:43:15,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:15,431 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:15,431 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:15,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable252 [2021-10-05 22:43:15,431 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 22:43:15,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:15,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1126707297, now seen corresponding path program 253 times [2021-10-05 22:43:15,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:15,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587732905] [2021-10-05 22:43:15,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:15,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:15,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:15,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:15,566 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587732905] [2021-10-05 22:43:15,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587732905] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:15,567 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:15,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:15,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112241182] [2021-10-05 22:43:15,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:15,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:15,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:15,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:15,568 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 22:43:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:15,910 INFO L93 Difference]: Finished difference Result 266 states and 553 transitions. [2021-10-05 22:43:15,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:43:15,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 22:43:15,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:15,912 INFO L225 Difference]: With dead ends: 266 [2021-10-05 22:43:15,912 INFO L226 Difference]: Without dead ends: 244 [2021-10-05 22:43:15,912 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 210.1ms TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:43:15,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-10-05 22:43:15,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 230. [2021-10-05 22:43:15,916 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 22:43:15,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 493 transitions. [2021-10-05 22:43:15,917 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 493 transitions. Word has length 38 [2021-10-05 22:43:15,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:15,917 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 493 transitions. [2021-10-05 22:43:15,917 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 22:43:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 493 transitions. [2021-10-05 22:43:15,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:15,919 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:15,919 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:15,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253 [2021-10-05 22:43:15,920 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 22:43:15,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:15,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1559440795, now seen corresponding path program 254 times [2021-10-05 22:43:15,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:15,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712378813] [2021-10-05 22:43:15,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:15,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:16,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:16,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712378813] [2021-10-05 22:43:16,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712378813] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:16,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:16,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:16,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831847788] [2021-10-05 22:43:16,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:16,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:16,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:16,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:16,087 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 22:43:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:16,423 INFO L93 Difference]: Finished difference Result 282 states and 583 transitions. [2021-10-05 22:43:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 22:43:16,424 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 22:43:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:16,425 INFO L225 Difference]: With dead ends: 282 [2021-10-05 22:43:16,425 INFO L226 Difference]: Without dead ends: 262 [2021-10-05 22:43:16,426 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 193.3ms TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:43:16,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-10-05 22:43:16,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 236. [2021-10-05 22:43:16,429 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 22:43:16,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 502 transitions. [2021-10-05 22:43:16,430 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 502 transitions. Word has length 38 [2021-10-05 22:43:16,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:16,430 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 502 transitions. [2021-10-05 22:43:16,430 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 22:43:16,430 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 502 transitions. [2021-10-05 22:43:16,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:16,431 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:16,431 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:16,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable254 [2021-10-05 22:43:16,432 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 22:43:16,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:16,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1999305869, now seen corresponding path program 255 times [2021-10-05 22:43:16,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:16,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374878944] [2021-10-05 22:43:16,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:16,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:16,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:16,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:16,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374878944] [2021-10-05 22:43:16,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374878944] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:16,563 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:16,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:16,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673589121] [2021-10-05 22:43:16,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:16,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:16,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:16,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:16,564 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 22:43:16,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:16,877 INFO L93 Difference]: Finished difference Result 266 states and 553 transitions. [2021-10-05 22:43:16,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:43:16,880 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 22:43:16,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:16,883 INFO L225 Difference]: With dead ends: 266 [2021-10-05 22:43:16,883 INFO L226 Difference]: Without dead ends: 252 [2021-10-05 22:43:16,883 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 170.9ms TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:43:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-10-05 22:43:16,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 238. [2021-10-05 22:43:16,888 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 22:43:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 505 transitions. [2021-10-05 22:43:16,888 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 505 transitions. Word has length 38 [2021-10-05 22:43:16,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:16,889 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 505 transitions. [2021-10-05 22:43:16,889 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 22:43:16,889 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 505 transitions. [2021-10-05 22:43:16,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:16,890 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:16,890 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:16,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable255 [2021-10-05 22:43:16,891 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 22:43:16,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:16,891 INFO L82 PathProgramCache]: Analyzing trace with hash -858271807, now seen corresponding path program 256 times [2021-10-05 22:43:16,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:16,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839593976] [2021-10-05 22:43:16,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:16,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:17,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:17,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839593976] [2021-10-05 22:43:17,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839593976] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:17,036 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:17,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:17,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863005831] [2021-10-05 22:43:17,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:17,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:17,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:17,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:17,038 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 22:43:17,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:17,373 INFO L93 Difference]: Finished difference Result 320 states and 660 transitions. [2021-10-05 22:43:17,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:43:17,373 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 22:43:17,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:17,374 INFO L225 Difference]: With dead ends: 320 [2021-10-05 22:43:17,374 INFO L226 Difference]: Without dead ends: 290 [2021-10-05 22:43:17,375 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 207.3ms TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:43:17,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-10-05 22:43:17,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 226. [2021-10-05 22:43:17,378 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 22:43:17,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 485 transitions. [2021-10-05 22:43:17,378 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 485 transitions. Word has length 38 [2021-10-05 22:43:17,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:17,378 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 485 transitions. [2021-10-05 22:43:17,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 22:43:17,379 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 485 transitions. [2021-10-05 22:43:17,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:17,379 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:17,379 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:17,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable256 [2021-10-05 22:43:17,379 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 22:43:17,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:17,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1643838647, now seen corresponding path program 257 times [2021-10-05 22:43:17,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:17,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174440795] [2021-10-05 22:43:17,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:17,380 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:17,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:17,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174440795] [2021-10-05 22:43:17,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174440795] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:17,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:17,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:17,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768299551] [2021-10-05 22:43:17,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:17,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:17,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:17,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:17,528 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 22:43:17,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:17,838 INFO L93 Difference]: Finished difference Result 250 states and 523 transitions. [2021-10-05 22:43:17,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:43:17,839 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 22:43:17,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:17,840 INFO L225 Difference]: With dead ends: 250 [2021-10-05 22:43:17,840 INFO L226 Difference]: Without dead ends: 222 [2021-10-05 22:43:17,841 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 205.2ms TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:43:17,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-10-05 22:43:17,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2021-10-05 22:43:17,843 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 22:43:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 470 transitions. [2021-10-05 22:43:17,844 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 470 transitions. Word has length 38 [2021-10-05 22:43:17,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:17,844 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 470 transitions. [2021-10-05 22:43:17,844 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 22:43:17,844 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 470 transitions. [2021-10-05 22:43:17,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:17,845 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:17,845 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:17,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable257 [2021-10-05 22:43:17,845 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 22:43:17,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:17,845 INFO L82 PathProgramCache]: Analyzing trace with hash 873736511, now seen corresponding path program 258 times [2021-10-05 22:43:17,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:17,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396475123] [2021-10-05 22:43:17,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:17,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:17,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 22:43:17,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:17,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396475123] [2021-10-05 22:43:17,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396475123] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:17,988 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:17,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:17,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852387137] [2021-10-05 22:43:17,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:17,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:17,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:17,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:17,989 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 22:43:18,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:18,315 INFO L93 Difference]: Finished difference Result 244 states and 510 transitions. [2021-10-05 22:43:18,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:43:18,316 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 22:43:18,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:18,317 INFO L225 Difference]: With dead ends: 244 [2021-10-05 22:43:18,317 INFO L226 Difference]: Without dead ends: 222 [2021-10-05 22:43:18,317 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 210.6ms TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:43:18,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-10-05 22:43:18,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2021-10-05 22:43:18,320 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 22:43:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 473 transitions. [2021-10-05 22:43:18,320 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 473 transitions. Word has length 38 [2021-10-05 22:43:18,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:18,320 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 473 transitions. [2021-10-05 22:43:18,320 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 22:43:18,320 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 473 transitions. [2021-10-05 22:43:18,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:18,321 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:18,321 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:18,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable258 [2021-10-05 22:43:18,321 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 22:43:18,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:18,321 INFO L82 PathProgramCache]: Analyzing trace with hash 441003013, now seen corresponding path program 259 times [2021-10-05 22:43:18,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:18,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307125171] [2021-10-05 22:43:18,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:18,322 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:18,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:18,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307125171] [2021-10-05 22:43:18,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307125171] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:18,460 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:18,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:18,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025225916] [2021-10-05 22:43:18,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:18,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:18,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:18,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:18,461 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 22:43:18,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:18,764 INFO L93 Difference]: Finished difference Result 252 states and 528 transitions. [2021-10-05 22:43:18,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:43:18,765 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 22:43:18,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:18,765 INFO L225 Difference]: With dead ends: 252 [2021-10-05 22:43:18,766 INFO L226 Difference]: Without dead ends: 232 [2021-10-05 22:43:18,766 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 191.9ms TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:43:18,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-10-05 22:43:18,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2021-10-05 22:43:18,768 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 22:43:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 482 transitions. [2021-10-05 22:43:18,769 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 482 transitions. Word has length 38 [2021-10-05 22:43:18,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:18,769 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 482 transitions. [2021-10-05 22:43:18,769 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 22:43:18,769 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 482 transitions. [2021-10-05 22:43:18,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:18,770 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:18,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 22:43:18,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable259 [2021-10-05 22:43:18,770 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 22:43:18,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:18,770 INFO L82 PathProgramCache]: Analyzing trace with hash -295217619, now seen corresponding path program 260 times [2021-10-05 22:43:18,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:18,771 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631721000] [2021-10-05 22:43:18,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:18,771 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:18,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:18,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:18,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631721000] [2021-10-05 22:43:18,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631721000] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:18,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:18,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:18,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293392952] [2021-10-05 22:43:18,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:18,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:18,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:18,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:18,910 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 22:43:19,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:19,176 INFO L93 Difference]: Finished difference Result 244 states and 510 transitions. [2021-10-05 22:43:19,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:43:19,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 22:43:19,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:19,177 INFO L225 Difference]: With dead ends: 244 [2021-10-05 22:43:19,177 INFO L226 Difference]: Without dead ends: 230 [2021-10-05 22:43:19,177 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 175.9ms TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:43:19,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-10-05 22:43:19,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2021-10-05 22:43:19,180 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 22:43:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 485 transitions. [2021-10-05 22:43:19,180 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 485 transitions. Word has length 38 [2021-10-05 22:43:19,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:19,180 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 485 transitions. [2021-10-05 22:43:19,180 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 22:43:19,180 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 485 transitions. [2021-10-05 22:43:19,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:19,181 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:19,181 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:19,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable260 [2021-10-05 22:43:19,181 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 22:43:19,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:19,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1142172001, now seen corresponding path program 261 times [2021-10-05 22:43:19,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:19,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929172240] [2021-10-05 22:43:19,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:19,182 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:19,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:19,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:19,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929172240] [2021-10-05 22:43:19,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929172240] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:19,319 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:19,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:19,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838735499] [2021-10-05 22:43:19,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:19,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:19,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:19,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:19,321 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 22:43:19,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:19,576 INFO L93 Difference]: Finished difference Result 248 states and 518 transitions. [2021-10-05 22:43:19,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:43:19,577 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 22:43:19,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:19,577 INFO L225 Difference]: With dead ends: 248 [2021-10-05 22:43:19,577 INFO L226 Difference]: Without dead ends: 208 [2021-10-05 22:43:19,578 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 171.3ms TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:43:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-10-05 22:43:19,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2021-10-05 22:43:19,580 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 22:43:19,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 442 transitions. [2021-10-05 22:43:19,580 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 442 transitions. Word has length 38 [2021-10-05 22:43:19,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:19,580 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 442 transitions. [2021-10-05 22:43:19,580 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 22:43:19,581 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 442 transitions. [2021-10-05 22:43:19,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:19,581 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:19,581 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:19,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261 [2021-10-05 22:43:19,581 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 22:43:19,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:19,582 INFO L82 PathProgramCache]: Analyzing trace with hash 414476597, now seen corresponding path program 262 times [2021-10-05 22:43:19,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:19,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769306224] [2021-10-05 22:43:19,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:19,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:19,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:19,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769306224] [2021-10-05 22:43:19,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769306224] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:19,700 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:19,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:19,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824412705] [2021-10-05 22:43:19,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:19,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:19,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:19,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:19,702 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 22:43:20,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:20,002 INFO L93 Difference]: Finished difference Result 278 states and 577 transitions. [2021-10-05 22:43:20,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:43:20,003 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 22:43:20,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:20,003 INFO L225 Difference]: With dead ends: 278 [2021-10-05 22:43:20,003 INFO L226 Difference]: Without dead ends: 266 [2021-10-05 22:43:20,004 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 170.8ms TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:43:20,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-10-05 22:43:20,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 214. [2021-10-05 22:43:20,006 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 22:43:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 451 transitions. [2021-10-05 22:43:20,007 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 451 transitions. Word has length 38 [2021-10-05 22:43:20,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:20,007 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 451 transitions. [2021-10-05 22:43:20,007 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 22:43:20,007 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 451 transitions. [2021-10-05 22:43:20,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:20,007 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:20,007 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:20,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable262 [2021-10-05 22:43:20,008 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 22:43:20,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:20,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1467946515, now seen corresponding path program 263 times [2021-10-05 22:43:20,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:20,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592243282] [2021-10-05 22:43:20,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:20,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:20,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:20,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592243282] [2021-10-05 22:43:20,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592243282] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:20,133 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:20,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:20,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022580030] [2021-10-05 22:43:20,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:20,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:20,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:20,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:20,134 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 22:43:20,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:20,472 INFO L93 Difference]: Finished difference Result 378 states and 817 transitions. [2021-10-05 22:43:20,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:43:20,473 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 22:43:20,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:20,473 INFO L225 Difference]: With dead ends: 378 [2021-10-05 22:43:20,473 INFO L226 Difference]: Without dead ends: 370 [2021-10-05 22:43:20,474 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 178.2ms TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:43:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-10-05 22:43:20,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 228. [2021-10-05 22:43:20,477 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 22:43:20,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 490 transitions. [2021-10-05 22:43:20,477 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 490 transitions. Word has length 38 [2021-10-05 22:43:20,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:20,477 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 490 transitions. [2021-10-05 22:43:20,477 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 22:43:20,477 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 490 transitions. [2021-10-05 22:43:20,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:20,478 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:20,478 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:20,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable263 [2021-10-05 22:43:20,478 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 22:43:20,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:20,478 INFO L82 PathProgramCache]: Analyzing trace with hash -746775587, now seen corresponding path program 264 times [2021-10-05 22:43:20,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:20,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862859458] [2021-10-05 22:43:20,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:20,479 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:20,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:20,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:20,605 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862859458] [2021-10-05 22:43:20,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862859458] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:20,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:20,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:20,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282737162] [2021-10-05 22:43:20,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:20,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:20,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:20,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:20,607 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 22:43:20,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:20,884 INFO L93 Difference]: Finished difference Result 284 states and 596 transitions. [2021-10-05 22:43:20,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:43:20,885 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 22:43:20,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:20,886 INFO L225 Difference]: With dead ends: 284 [2021-10-05 22:43:20,886 INFO L226 Difference]: Without dead ends: 270 [2021-10-05 22:43:20,886 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 182.9ms TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:43:20,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-10-05 22:43:20,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 222. [2021-10-05 22:43:20,889 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 22:43:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 479 transitions. [2021-10-05 22:43:20,889 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 479 transitions. Word has length 38 [2021-10-05 22:43:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:20,889 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 479 transitions. [2021-10-05 22:43:20,890 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 22:43:20,890 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 479 transitions. [2021-10-05 22:43:20,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:20,890 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:20,890 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:20,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable264 [2021-10-05 22:43:20,890 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 22:43:20,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:20,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1889604775, now seen corresponding path program 265 times [2021-10-05 22:43:20,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:20,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191224358] [2021-10-05 22:43:20,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:20,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:21,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:21,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:21,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191224358] [2021-10-05 22:43:21,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191224358] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:21,021 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:21,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:21,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602338028] [2021-10-05 22:43:21,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:21,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:21,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:21,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:21,022 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 22:43:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:21,312 INFO L93 Difference]: Finished difference Result 278 states and 577 transitions. [2021-10-05 22:43:21,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:43:21,313 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 22:43:21,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:21,314 INFO L225 Difference]: With dead ends: 278 [2021-10-05 22:43:21,314 INFO L226 Difference]: Without dead ends: 262 [2021-10-05 22:43:21,314 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 179.0ms TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:43:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-10-05 22:43:21,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 220. [2021-10-05 22:43:21,329 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 22:43:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 474 transitions. [2021-10-05 22:43:21,329 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 474 transitions. Word has length 38 [2021-10-05 22:43:21,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:21,330 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 474 transitions. [2021-10-05 22:43:21,330 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 22:43:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 474 transitions. [2021-10-05 22:43:21,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:21,330 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:21,330 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:21,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable265 [2021-10-05 22:43:21,331 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 22:43:21,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:21,331 INFO L82 PathProgramCache]: Analyzing trace with hash 11483189, now seen corresponding path program 266 times [2021-10-05 22:43:21,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:21,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791685488] [2021-10-05 22:43:21,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:21,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:21,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:21,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:21,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791685488] [2021-10-05 22:43:21,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791685488] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:21,448 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:21,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:21,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355975795] [2021-10-05 22:43:21,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:21,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:21,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:21,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:21,450 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 22:43:21,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:21,774 INFO L93 Difference]: Finished difference Result 334 states and 713 transitions. [2021-10-05 22:43:21,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:43:21,774 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 22:43:21,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:21,775 INFO L225 Difference]: With dead ends: 334 [2021-10-05 22:43:21,775 INFO L226 Difference]: Without dead ends: 322 [2021-10-05 22:43:21,775 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 159.8ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:43:21,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-10-05 22:43:21,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 220. [2021-10-05 22:43:21,778 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 22:43:21,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 468 transitions. [2021-10-05 22:43:21,778 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 468 transitions. Word has length 38 [2021-10-05 22:43:21,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:21,778 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 468 transitions. [2021-10-05 22:43:21,779 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 22:43:21,779 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 468 transitions. [2021-10-05 22:43:21,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:21,779 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:21,779 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:21,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable266 [2021-10-05 22:43:21,779 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 22:43:21,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:21,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1149768995, now seen corresponding path program 267 times [2021-10-05 22:43:21,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:21,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809838728] [2021-10-05 22:43:21,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:21,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:21,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 22:43:21,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:21,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809838728] [2021-10-05 22:43:21,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809838728] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:21,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:21,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:21,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682420941] [2021-10-05 22:43:21,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:21,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:21,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:21,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:21,892 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 22:43:22,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:22,213 INFO L93 Difference]: Finished difference Result 394 states and 835 transitions. [2021-10-05 22:43:22,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:43:22,213 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 22:43:22,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:22,214 INFO L225 Difference]: With dead ends: 394 [2021-10-05 22:43:22,214 INFO L226 Difference]: Without dead ends: 380 [2021-10-05 22:43:22,214 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 173.2ms TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:43:22,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-10-05 22:43:22,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 212. [2021-10-05 22:43:22,218 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 22:43:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 450 transitions. [2021-10-05 22:43:22,218 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 450 transitions. Word has length 38 [2021-10-05 22:43:22,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:22,218 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 450 transitions. [2021-10-05 22:43:22,218 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 22:43:22,218 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 450 transitions. [2021-10-05 22:43:22,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:22,219 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:22,219 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:22,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable267 [2021-10-05 22:43:22,219 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 22:43:22,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:22,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1296632665, now seen corresponding path program 268 times [2021-10-05 22:43:22,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:22,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758916946] [2021-10-05 22:43:22,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:22,220 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:22,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:22,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758916946] [2021-10-05 22:43:22,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758916946] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:22,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:22,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:22,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787537717] [2021-10-05 22:43:22,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:22,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:22,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:22,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:22,341 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 22:43:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:22,719 INFO L93 Difference]: Finished difference Result 326 states and 693 transitions. [2021-10-05 22:43:22,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:43:22,720 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 22:43:22,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:22,721 INFO L225 Difference]: With dead ends: 326 [2021-10-05 22:43:22,721 INFO L226 Difference]: Without dead ends: 306 [2021-10-05 22:43:22,722 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 203.1ms TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:43:22,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-10-05 22:43:22,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 218. [2021-10-05 22:43:22,725 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 22:43:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 459 transitions. [2021-10-05 22:43:22,725 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 459 transitions. Word has length 38 [2021-10-05 22:43:22,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:22,725 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 459 transitions. [2021-10-05 22:43:22,725 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 22:43:22,726 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 459 transitions. [2021-10-05 22:43:22,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:22,726 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:22,726 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:22,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable268 [2021-10-05 22:43:22,726 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 22:43:22,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:22,727 INFO L82 PathProgramCache]: Analyzing trace with hash 411695511, now seen corresponding path program 269 times [2021-10-05 22:43:22,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:22,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112101518] [2021-10-05 22:43:22,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:22,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:22,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:22,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112101518] [2021-10-05 22:43:22,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112101518] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:22,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:22,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:22,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93543244] [2021-10-05 22:43:22,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:22,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:22,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:22,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:22,846 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 22:43:23,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:23,129 INFO L93 Difference]: Finished difference Result 350 states and 745 transitions. [2021-10-05 22:43:23,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:43:23,130 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 22:43:23,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:23,131 INFO L225 Difference]: With dead ends: 350 [2021-10-05 22:43:23,131 INFO L226 Difference]: Without dead ends: 332 [2021-10-05 22:43:23,131 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 160.1ms TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:43:23,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-10-05 22:43:23,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 220. [2021-10-05 22:43:23,135 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 22:43:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 462 transitions. [2021-10-05 22:43:23,136 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 462 transitions. Word has length 38 [2021-10-05 22:43:23,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:23,136 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 462 transitions. [2021-10-05 22:43:23,136 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 22:43:23,136 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 462 transitions. [2021-10-05 22:43:23,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:23,136 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:23,137 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:23,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable269 [2021-10-05 22:43:23,137 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 22:43:23,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:23,137 INFO L82 PathProgramCache]: Analyzing trace with hash -334306851, now seen corresponding path program 270 times [2021-10-05 22:43:23,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:23,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229660261] [2021-10-05 22:43:23,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:23,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:23,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:23,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:23,257 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229660261] [2021-10-05 22:43:23,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229660261] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:23,257 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:23,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:23,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294121] [2021-10-05 22:43:23,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:23,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:23,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:23,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:23,259 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 22:43:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:23,627 INFO L93 Difference]: Finished difference Result 346 states and 733 transitions. [2021-10-05 22:43:23,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:43:23,628 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 22:43:23,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:23,629 INFO L225 Difference]: With dead ends: 346 [2021-10-05 22:43:23,629 INFO L226 Difference]: Without dead ends: 324 [2021-10-05 22:43:23,629 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 196.0ms TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:43:23,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-10-05 22:43:23,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 212. [2021-10-05 22:43:23,632 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 22:43:23,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 444 transitions. [2021-10-05 22:43:23,632 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 444 transitions. Word has length 38 [2021-10-05 22:43:23,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:23,632 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 444 transitions. [2021-10-05 22:43:23,633 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 22:43:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 444 transitions. [2021-10-05 22:43:23,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:23,633 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:23,633 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:23,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable270 [2021-10-05 22:43:23,633 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 22:43:23,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:23,634 INFO L82 PathProgramCache]: Analyzing trace with hash 718947893, now seen corresponding path program 271 times [2021-10-05 22:43:23,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:23,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208415742] [2021-10-05 22:43:23,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:23,634 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:23,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 22:43:23,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:23,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208415742] [2021-10-05 22:43:23,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208415742] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:23,736 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:23,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:43:23,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119708530] [2021-10-05 22:43:23,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:43:23,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:23,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:43:23,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:43:23,738 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 22:43:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:23,961 INFO L93 Difference]: Finished difference Result 282 states and 585 transitions. [2021-10-05 22:43:23,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:43:23,962 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 22:43:23,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:23,963 INFO L225 Difference]: With dead ends: 282 [2021-10-05 22:43:23,963 INFO L226 Difference]: Without dead ends: 274 [2021-10-05 22:43:23,963 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 134.0ms TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:43:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-10-05 22:43:23,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 212. [2021-10-05 22:43:23,966 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 22:43:23,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 442 transitions. [2021-10-05 22:43:23,967 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 442 transitions. Word has length 38 [2021-10-05 22:43:23,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:23,967 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 442 transitions. [2021-10-05 22:43:23,967 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 22:43:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 442 transitions. [2021-10-05 22:43:23,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:23,968 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:23,968 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:23,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable271 [2021-10-05 22:43:23,968 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 22:43:23,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:23,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2108846113, now seen corresponding path program 272 times [2021-10-05 22:43:23,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:23,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937140945] [2021-10-05 22:43:23,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:23,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:24,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:24,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937140945] [2021-10-05 22:43:24,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937140945] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:24,088 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:24,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:24,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203405716] [2021-10-05 22:43:24,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:24,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:24,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:24,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:24,089 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 22:43:24,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:24,359 INFO L93 Difference]: Finished difference Result 262 states and 539 transitions. [2021-10-05 22:43:24,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:43:24,359 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 22:43:24,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:24,360 INFO L225 Difference]: With dead ends: 262 [2021-10-05 22:43:24,360 INFO L226 Difference]: Without dead ends: 242 [2021-10-05 22:43:24,361 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 153.6ms TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:43:24,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-10-05 22:43:24,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 210. [2021-10-05 22:43:24,364 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 22:43:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 437 transitions. [2021-10-05 22:43:24,365 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 437 transitions. Word has length 38 [2021-10-05 22:43:24,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:24,365 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 437 transitions. [2021-10-05 22:43:24,365 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 22:43:24,365 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 437 transitions. [2021-10-05 22:43:24,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:24,366 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:24,366 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:24,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272 [2021-10-05 22:43:24,366 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 22:43:24,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:24,366 INFO L82 PathProgramCache]: Analyzing trace with hash -890457367, now seen corresponding path program 273 times [2021-10-05 22:43:24,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:24,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896844353] [2021-10-05 22:43:24,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:24,367 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:24,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:24,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896844353] [2021-10-05 22:43:24,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896844353] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:24,473 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:24,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:43:24,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962460191] [2021-10-05 22:43:24,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:43:24,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:24,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:43:24,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:43:24,474 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 22:43:24,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:24,702 INFO L93 Difference]: Finished difference Result 322 states and 679 transitions. [2021-10-05 22:43:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:43:24,703 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 22:43:24,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:24,703 INFO L225 Difference]: With dead ends: 322 [2021-10-05 22:43:24,704 INFO L226 Difference]: Without dead ends: 314 [2021-10-05 22:43:24,704 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 144.5ms TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:43:24,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-10-05 22:43:24,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 214. [2021-10-05 22:43:24,706 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 22:43:24,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 445 transitions. [2021-10-05 22:43:24,707 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 445 transitions. Word has length 38 [2021-10-05 22:43:24,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:24,707 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 445 transitions. [2021-10-05 22:43:24,707 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 22:43:24,707 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 445 transitions. [2021-10-05 22:43:24,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:24,708 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:24,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 22:43:24,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable273 [2021-10-05 22:43:24,708 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 22:43:24,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:24,708 INFO L82 PathProgramCache]: Analyzing trace with hash -169286439, now seen corresponding path program 274 times [2021-10-05 22:43:24,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:24,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044347443] [2021-10-05 22:43:24,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:24,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:24,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:24,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:24,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044347443] [2021-10-05 22:43:24,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044347443] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:24,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:24,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:24,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100247611] [2021-10-05 22:43:24,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:24,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:24,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:24,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:24,826 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 22:43:25,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:25,127 INFO L93 Difference]: Finished difference Result 320 states and 672 transitions. [2021-10-05 22:43:25,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:43:25,128 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 22:43:25,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:25,128 INFO L225 Difference]: With dead ends: 320 [2021-10-05 22:43:25,128 INFO L226 Difference]: Without dead ends: 312 [2021-10-05 22:43:25,129 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 165.5ms TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:43:25,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-10-05 22:43:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 212. [2021-10-05 22:43:25,132 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 22:43:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 440 transitions. [2021-10-05 22:43:25,132 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 440 transitions. Word has length 38 [2021-10-05 22:43:25,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:25,132 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 440 transitions. [2021-10-05 22:43:25,132 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 22:43:25,132 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 440 transitions. [2021-10-05 22:43:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:25,133 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:25,133 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:25,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable274 [2021-10-05 22:43:25,133 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 22:43:25,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:25,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1227383825, now seen corresponding path program 275 times [2021-10-05 22:43:25,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:25,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035570356] [2021-10-05 22:43:25,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:25,134 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:25,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:25,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035570356] [2021-10-05 22:43:25,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035570356] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:25,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:25,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:25,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668251767] [2021-10-05 22:43:25,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:25,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:25,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:25,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:25,253 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 22:43:25,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:25,552 INFO L93 Difference]: Finished difference Result 314 states and 657 transitions. [2021-10-05 22:43:25,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:43:25,553 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 22:43:25,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:25,554 INFO L225 Difference]: With dead ends: 314 [2021-10-05 22:43:25,554 INFO L226 Difference]: Without dead ends: 296 [2021-10-05 22:43:25,554 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 175.1ms TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:43:25,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-10-05 22:43:25,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 214. [2021-10-05 22:43:25,558 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 22:43:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 443 transitions. [2021-10-05 22:43:25,558 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 443 transitions. Word has length 38 [2021-10-05 22:43:25,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:25,558 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 443 transitions. [2021-10-05 22:43:25,558 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 22:43:25,559 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 443 transitions. [2021-10-05 22:43:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:25,559 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:25,559 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:25,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable275 [2021-10-05 22:43:25,559 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 22:43:25,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:25,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1973386187, now seen corresponding path program 276 times [2021-10-05 22:43:25,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:25,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382044085] [2021-10-05 22:43:25,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:25,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:25,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:25,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:25,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382044085] [2021-10-05 22:43:25,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382044085] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:25,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:25,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:25,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586450487] [2021-10-05 22:43:25,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:25,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:25,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:25,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:25,688 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 22:43:26,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:26,023 INFO L93 Difference]: Finished difference Result 310 states and 645 transitions. [2021-10-05 22:43:26,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:43:26,023 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 22:43:26,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:26,024 INFO L225 Difference]: With dead ends: 310 [2021-10-05 22:43:26,024 INFO L226 Difference]: Without dead ends: 286 [2021-10-05 22:43:26,025 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 209.2ms TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:43:26,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-10-05 22:43:26,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 204. [2021-10-05 22:43:26,028 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 22:43:26,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 426 transitions. [2021-10-05 22:43:26,028 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 426 transitions. Word has length 38 [2021-10-05 22:43:26,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:26,028 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 426 transitions. [2021-10-05 22:43:26,029 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 22:43:26,029 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 426 transitions. [2021-10-05 22:43:26,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:26,029 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:26,029 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:26,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable276 [2021-10-05 22:43:26,029 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 22:43:26,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:26,030 INFO L82 PathProgramCache]: Analyzing trace with hash -704676683, now seen corresponding path program 277 times [2021-10-05 22:43:26,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:26,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304960145] [2021-10-05 22:43:26,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:26,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:26,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:26,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304960145] [2021-10-05 22:43:26,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304960145] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:26,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:26,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:26,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674065418] [2021-10-05 22:43:26,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:26,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:26,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:26,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:26,170 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 22:43:26,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:26,507 INFO L93 Difference]: Finished difference Result 224 states and 458 transitions. [2021-10-05 22:43:26,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:43:26,508 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 22:43:26,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:26,508 INFO L225 Difference]: With dead ends: 224 [2021-10-05 22:43:26,508 INFO L226 Difference]: Without dead ends: 202 [2021-10-05 22:43:26,509 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 218.0ms TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:43:26,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-05 22:43:26,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2021-10-05 22:43:26,511 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 22:43:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 421 transitions. [2021-10-05 22:43:26,512 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 421 transitions. Word has length 38 [2021-10-05 22:43:26,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:26,512 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 421 transitions. [2021-10-05 22:43:26,512 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 22:43:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 421 transitions. [2021-10-05 22:43:26,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:26,512 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:26,513 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:26,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable277 [2021-10-05 22:43:26,513 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 22:43:26,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:26,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1410413131, now seen corresponding path program 278 times [2021-10-05 22:43:26,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:26,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274090741] [2021-10-05 22:43:26,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:26,513 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:26,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:26,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:26,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274090741] [2021-10-05 22:43:26,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274090741] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:26,646 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:26,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:26,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157786536] [2021-10-05 22:43:26,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:26,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:26,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:26,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:26,648 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 22:43:26,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:26,977 INFO L93 Difference]: Finished difference Result 256 states and 528 transitions. [2021-10-05 22:43:26,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:43:26,978 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 22:43:26,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:26,979 INFO L225 Difference]: With dead ends: 256 [2021-10-05 22:43:26,979 INFO L226 Difference]: Without dead ends: 236 [2021-10-05 22:43:26,979 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 211.1ms TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:43:26,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-10-05 22:43:26,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 208. [2021-10-05 22:43:26,982 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 22:43:26,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 430 transitions. [2021-10-05 22:43:26,982 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 430 transitions. Word has length 38 [2021-10-05 22:43:26,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:26,982 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 430 transitions. [2021-10-05 22:43:26,983 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 22:43:26,983 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 430 transitions. [2021-10-05 22:43:26,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:26,983 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:26,983 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:26,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable278 [2021-10-05 22:43:26,983 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 22:43:26,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:26,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1999617011, now seen corresponding path program 279 times [2021-10-05 22:43:26,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:26,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153350866] [2021-10-05 22:43:26,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:26,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:27,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 22:43:27,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:27,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153350866] [2021-10-05 22:43:27,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153350866] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:27,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:27,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:27,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198425140] [2021-10-05 22:43:27,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:27,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:27,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:27,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:27,118 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 22:43:27,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:27,441 INFO L93 Difference]: Finished difference Result 286 states and 603 transitions. [2021-10-05 22:43:27,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:43:27,441 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 22:43:27,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:27,442 INFO L225 Difference]: With dead ends: 286 [2021-10-05 22:43:27,442 INFO L226 Difference]: Without dead ends: 268 [2021-10-05 22:43:27,443 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 218.8ms TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:43:27,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-10-05 22:43:27,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 210. [2021-10-05 22:43:27,446 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 22:43:27,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 433 transitions. [2021-10-05 22:43:27,447 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 433 transitions. Word has length 38 [2021-10-05 22:43:27,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:27,447 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 433 transitions. [2021-10-05 22:43:27,447 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 22:43:27,447 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 433 transitions. [2021-10-05 22:43:27,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:27,447 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:27,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 22:43:27,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable279 [2021-10-05 22:43:27,448 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 22:43:27,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:27,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1253614649, now seen corresponding path program 280 times [2021-10-05 22:43:27,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:27,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308518060] [2021-10-05 22:43:27,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:27,448 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:27,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:27,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:27,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308518060] [2021-10-05 22:43:27,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308518060] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:27,565 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:27,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:27,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365135592] [2021-10-05 22:43:27,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:27,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:27,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:27,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:27,566 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 22:43:27,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:27,912 INFO L93 Difference]: Finished difference Result 248 states and 508 transitions. [2021-10-05 22:43:27,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:43:27,912 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 22:43:27,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:27,913 INFO L225 Difference]: With dead ends: 248 [2021-10-05 22:43:27,913 INFO L226 Difference]: Without dead ends: 222 [2021-10-05 22:43:27,913 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 198.0ms TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:43:27,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-10-05 22:43:27,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2021-10-05 22:43:27,916 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 22:43:27,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 413 transitions. [2021-10-05 22:43:27,916 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 413 transitions. Word has length 38 [2021-10-05 22:43:27,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:27,916 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 413 transitions. [2021-10-05 22:43:27,917 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 22:43:27,917 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 413 transitions. [2021-10-05 22:43:27,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:27,917 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:27,917 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:27,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable280 [2021-10-05 22:43:27,917 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 22:43:27,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:27,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1576127927, now seen corresponding path program 281 times [2021-10-05 22:43:27,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:27,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826141179] [2021-10-05 22:43:27,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:27,918 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:28,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 22:43:28,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:28,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826141179] [2021-10-05 22:43:28,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826141179] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:28,034 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:28,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:28,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508586249] [2021-10-05 22:43:28,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:28,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:28,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:28,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:28,035 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 22:43:28,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:28,307 INFO L93 Difference]: Finished difference Result 236 states and 484 transitions. [2021-10-05 22:43:28,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:43:28,308 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 22:43:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:28,309 INFO L225 Difference]: With dead ends: 236 [2021-10-05 22:43:28,309 INFO L226 Difference]: Without dead ends: 224 [2021-10-05 22:43:28,309 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 172.4ms TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:43:28,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-10-05 22:43:28,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 204. [2021-10-05 22:43:28,311 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 22:43:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 422 transitions. [2021-10-05 22:43:28,312 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 422 transitions. Word has length 38 [2021-10-05 22:43:28,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:28,312 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 422 transitions. [2021-10-05 22:43:28,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 22:43:28,312 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 422 transitions. [2021-10-05 22:43:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:28,313 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:28,313 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:28,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable281 [2021-10-05 22:43:28,313 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 22:43:28,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:28,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1322100919, now seen corresponding path program 282 times [2021-10-05 22:43:28,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:28,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081623128] [2021-10-05 22:43:28,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:28,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:28,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:28,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:28,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081623128] [2021-10-05 22:43:28,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081623128] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:28,435 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:28,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:28,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421891120] [2021-10-05 22:43:28,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:28,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:28,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:28,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:28,436 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 22:43:28,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:28,679 INFO L93 Difference]: Finished difference Result 228 states and 466 transitions. [2021-10-05 22:43:28,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:43:28,679 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 22:43:28,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:28,680 INFO L225 Difference]: With dead ends: 228 [2021-10-05 22:43:28,680 INFO L226 Difference]: Without dead ends: 222 [2021-10-05 22:43:28,681 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 167.6ms TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:43:28,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-10-05 22:43:28,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 206. [2021-10-05 22:43:28,684 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 22:43:28,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 425 transitions. [2021-10-05 22:43:28,684 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 425 transitions. Word has length 38 [2021-10-05 22:43:28,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:28,684 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 425 transitions. [2021-10-05 22:43:28,684 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 22:43:28,684 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 425 transitions. [2021-10-05 22:43:28,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:28,685 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:28,685 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:28,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable282 [2021-10-05 22:43:28,685 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 22:43:28,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:28,685 INFO L82 PathProgramCache]: Analyzing trace with hash -59465581, now seen corresponding path program 283 times [2021-10-05 22:43:28,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:28,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413333755] [2021-10-05 22:43:28,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:28,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:28,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:28,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413333755] [2021-10-05 22:43:28,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413333755] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:28,795 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:28,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:28,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488114610] [2021-10-05 22:43:28,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:28,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:28,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:28,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:28,797 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 22:43:29,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:29,085 INFO L93 Difference]: Finished difference Result 322 states and 679 transitions. [2021-10-05 22:43:29,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:43:29,085 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 22:43:29,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:29,086 INFO L225 Difference]: With dead ends: 322 [2021-10-05 22:43:29,086 INFO L226 Difference]: Without dead ends: 306 [2021-10-05 22:43:29,087 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 152.8ms TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:43:29,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-10-05 22:43:29,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 212. [2021-10-05 22:43:29,090 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 22:43:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 450 transitions. [2021-10-05 22:43:29,090 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 450 transitions. Word has length 38 [2021-10-05 22:43:29,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:29,090 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 450 transitions. [2021-10-05 22:43:29,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 22:43:29,091 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 450 transitions. [2021-10-05 22:43:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:29,091 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:29,091 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:29,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable283 [2021-10-05 22:43:29,091 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 22:43:29,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:29,092 INFO L82 PathProgramCache]: Analyzing trace with hash -727953445, now seen corresponding path program 284 times [2021-10-05 22:43:29,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:29,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320458033] [2021-10-05 22:43:29,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:29,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:29,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:29,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:29,215 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320458033] [2021-10-05 22:43:29,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320458033] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:29,215 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:29,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:29,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750414909] [2021-10-05 22:43:29,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:29,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:29,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:29,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:29,219 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 22:43:29,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:29,472 INFO L93 Difference]: Finished difference Result 242 states and 501 transitions. [2021-10-05 22:43:29,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:43:29,473 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 22:43:29,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:29,473 INFO L225 Difference]: With dead ends: 242 [2021-10-05 22:43:29,473 INFO L226 Difference]: Without dead ends: 226 [2021-10-05 22:43:29,474 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 175.4ms TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:43:29,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-10-05 22:43:29,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 210. [2021-10-05 22:43:29,476 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 22:43:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 445 transitions. [2021-10-05 22:43:29,476 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 445 transitions. Word has length 38 [2021-10-05 22:43:29,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:29,477 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 445 transitions. [2021-10-05 22:43:29,477 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 22:43:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 445 transitions. [2021-10-05 22:43:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:29,477 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:29,477 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:29,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable284 [2021-10-05 22:43:29,477 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 22:43:29,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:29,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1046291377, now seen corresponding path program 285 times [2021-10-05 22:43:29,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:29,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283336394] [2021-10-05 22:43:29,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:29,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:29,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:29,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:29,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283336394] [2021-10-05 22:43:29,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283336394] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:29,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:29,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:29,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858536034] [2021-10-05 22:43:29,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:29,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:29,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:29,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:29,600 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 22:43:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:29,854 INFO L93 Difference]: Finished difference Result 260 states and 540 transitions. [2021-10-05 22:43:29,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:43:29,855 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 22:43:29,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:29,856 INFO L225 Difference]: With dead ends: 260 [2021-10-05 22:43:29,856 INFO L226 Difference]: Without dead ends: 248 [2021-10-05 22:43:29,856 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 165.1ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:43:29,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-10-05 22:43:29,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 210. [2021-10-05 22:43:29,860 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 22:43:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 439 transitions. [2021-10-05 22:43:29,860 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 439 transitions. Word has length 38 [2021-10-05 22:43:29,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:29,860 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 439 transitions. [2021-10-05 22:43:29,861 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 22:43:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 439 transitions. [2021-10-05 22:43:29,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:29,861 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:29,861 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:29,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable285 [2021-10-05 22:43:29,861 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 22:43:29,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:29,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1851937469, now seen corresponding path program 286 times [2021-10-05 22:43:29,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:29,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418946180] [2021-10-05 22:43:29,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:29,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:29,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:29,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:29,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418946180] [2021-10-05 22:43:29,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418946180] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:29,962 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:29,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:29,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206646741] [2021-10-05 22:43:29,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:29,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:29,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:29,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:29,963 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 22:43:30,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:30,271 INFO L93 Difference]: Finished difference Result 320 states and 662 transitions. [2021-10-05 22:43:30,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:43:30,272 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 22:43:30,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:30,272 INFO L225 Difference]: With dead ends: 320 [2021-10-05 22:43:30,272 INFO L226 Difference]: Without dead ends: 306 [2021-10-05 22:43:30,273 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 163.1ms TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:43:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-10-05 22:43:30,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 202. [2021-10-05 22:43:30,275 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 22:43:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 421 transitions. [2021-10-05 22:43:30,276 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 421 transitions. Word has length 38 [2021-10-05 22:43:30,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:30,276 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 421 transitions. [2021-10-05 22:43:30,276 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 22:43:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 421 transitions. [2021-10-05 22:43:30,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:30,277 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:30,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 22:43:30,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable286 [2021-10-05 22:43:30,277 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 22:43:30,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:30,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1690523493, now seen corresponding path program 287 times [2021-10-05 22:43:30,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:30,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606283830] [2021-10-05 22:43:30,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:30,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:30,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:30,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606283830] [2021-10-05 22:43:30,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606283830] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:30,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:30,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:30,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358627191] [2021-10-05 22:43:30,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:30,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:30,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:30,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:30,408 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 22:43:30,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:30,708 INFO L93 Difference]: Finished difference Result 260 states and 532 transitions. [2021-10-05 22:43:30,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:43:30,708 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 22:43:30,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:30,709 INFO L225 Difference]: With dead ends: 260 [2021-10-05 22:43:30,709 INFO L226 Difference]: Without dead ends: 240 [2021-10-05 22:43:30,709 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 186.8ms TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:43:30,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-10-05 22:43:30,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 208. [2021-10-05 22:43:30,712 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 22:43:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 430 transitions. [2021-10-05 22:43:30,712 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 430 transitions. Word has length 38 [2021-10-05 22:43:30,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:30,712 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 430 transitions. [2021-10-05 22:43:30,712 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 22:43:30,713 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 430 transitions. [2021-10-05 22:43:30,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:30,713 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:30,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 22:43:30,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable287 [2021-10-05 22:43:30,713 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 22:43:30,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:30,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1868223171, now seen corresponding path program 288 times [2021-10-05 22:43:30,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:30,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679498920] [2021-10-05 22:43:30,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:30,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:30,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 22:43:30,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:30,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679498920] [2021-10-05 22:43:30,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679498920] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:30,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:30,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:30,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279629470] [2021-10-05 22:43:30,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:30,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:30,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:30,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:30,853 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 22:43:31,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:31,200 INFO L93 Difference]: Finished difference Result 298 states and 607 transitions. [2021-10-05 22:43:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:43:31,200 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 22:43:31,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:31,201 INFO L225 Difference]: With dead ends: 298 [2021-10-05 22:43:31,201 INFO L226 Difference]: Without dead ends: 258 [2021-10-05 22:43:31,201 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 217.9ms TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:43:31,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-10-05 22:43:31,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 202. [2021-10-05 22:43:31,204 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 22:43:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 415 transitions. [2021-10-05 22:43:31,205 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 415 transitions. Word has length 38 [2021-10-05 22:43:31,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:31,205 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 415 transitions. [2021-10-05 22:43:31,205 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 22:43:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 415 transitions. [2021-10-05 22:43:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:31,205 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:31,205 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:31,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable288 [2021-10-05 22:43:31,206 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 22:43:31,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:31,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1095026715, now seen corresponding path program 289 times [2021-10-05 22:43:31,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:31,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821059523] [2021-10-05 22:43:31,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:31,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:31,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:31,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:31,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821059523] [2021-10-05 22:43:31,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821059523] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:31,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:31,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:31,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340256979] [2021-10-05 22:43:31,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:31,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:31,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:31,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:31,324 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 22:43:31,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:31,597 INFO L93 Difference]: Finished difference Result 268 states and 550 transitions. [2021-10-05 22:43:31,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:43:31,597 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 22:43:31,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:31,598 INFO L225 Difference]: With dead ends: 268 [2021-10-05 22:43:31,598 INFO L226 Difference]: Without dead ends: 256 [2021-10-05 22:43:31,598 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 175.7ms TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:43:31,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-10-05 22:43:31,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 204. [2021-10-05 22:43:31,601 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 22:43:31,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 420 transitions. [2021-10-05 22:43:31,601 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 420 transitions. Word has length 38 [2021-10-05 22:43:31,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:31,601 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 420 transitions. [2021-10-05 22:43:31,602 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 22:43:31,602 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 420 transitions. [2021-10-05 22:43:31,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:31,602 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:31,602 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:31,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable289 [2021-10-05 22:43:31,602 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 22:43:31,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:31,603 INFO L82 PathProgramCache]: Analyzing trace with hash -2077525135, now seen corresponding path program 290 times [2021-10-05 22:43:31,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:31,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127250330] [2021-10-05 22:43:31,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:31,603 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:31,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 22:43:31,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:31,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127250330] [2021-10-05 22:43:31,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127250330] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:31,736 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:31,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:31,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21574685] [2021-10-05 22:43:31,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:31,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:31,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:31,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:31,737 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 22:43:32,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:32,062 INFO L93 Difference]: Finished difference Result 276 states and 560 transitions. [2021-10-05 22:43:32,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:43:32,062 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 22:43:32,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:32,063 INFO L225 Difference]: With dead ends: 276 [2021-10-05 22:43:32,063 INFO L226 Difference]: Without dead ends: 254 [2021-10-05 22:43:32,064 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 214.9ms TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:43:32,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-10-05 22:43:32,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 204. [2021-10-05 22:43:32,067 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 22:43:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 418 transitions. [2021-10-05 22:43:32,067 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 418 transitions. Word has length 38 [2021-10-05 22:43:32,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:32,067 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 418 transitions. [2021-10-05 22:43:32,068 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 22:43:32,068 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 418 transitions. [2021-10-05 22:43:32,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:32,068 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:32,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 22:43:32,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable290 [2021-10-05 22:43:32,068 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 22:43:32,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:32,069 INFO L82 PathProgramCache]: Analyzing trace with hash -327899983, now seen corresponding path program 291 times [2021-10-05 22:43:32,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:32,069 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21306012] [2021-10-05 22:43:32,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:32,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:32,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:32,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:32,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21306012] [2021-10-05 22:43:32,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21306012] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:32,182 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:32,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:43:32,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233807687] [2021-10-05 22:43:32,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:43:32,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:32,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:43:32,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:43:32,184 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 22:43:32,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:32,420 INFO L93 Difference]: Finished difference Result 258 states and 527 transitions. [2021-10-05 22:43:32,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:43:32,420 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 22:43:32,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:32,421 INFO L225 Difference]: With dead ends: 258 [2021-10-05 22:43:32,421 INFO L226 Difference]: Without dead ends: 250 [2021-10-05 22:43:32,422 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 139.9ms TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:43:32,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-10-05 22:43:32,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 204. [2021-10-05 22:43:32,425 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 22:43:32,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 416 transitions. [2021-10-05 22:43:32,425 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 416 transitions. Word has length 38 [2021-10-05 22:43:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:32,425 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 416 transitions. [2021-10-05 22:43:32,425 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 22:43:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 416 transitions. [2021-10-05 22:43:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:32,426 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:32,426 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:32,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable291 [2021-10-05 22:43:32,426 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 22:43:32,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:32,426 INFO L82 PathProgramCache]: Analyzing trace with hash -153145701, now seen corresponding path program 292 times [2021-10-05 22:43:32,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:32,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153570124] [2021-10-05 22:43:32,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:32,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:32,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:32,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153570124] [2021-10-05 22:43:32,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153570124] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:32,550 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:32,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:32,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133865725] [2021-10-05 22:43:32,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:32,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:32,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:32,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:32,551 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 22:43:32,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:32,805 INFO L93 Difference]: Finished difference Result 254 states and 513 transitions. [2021-10-05 22:43:32,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:43:32,806 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 22:43:32,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:32,807 INFO L225 Difference]: With dead ends: 254 [2021-10-05 22:43:32,807 INFO L226 Difference]: Without dead ends: 226 [2021-10-05 22:43:32,807 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 164.3ms TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:43:32,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-10-05 22:43:32,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 194. [2021-10-05 22:43:32,810 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 22:43:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 397 transitions. [2021-10-05 22:43:32,811 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 397 transitions. Word has length 38 [2021-10-05 22:43:32,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:32,811 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 397 transitions. [2021-10-05 22:43:32,811 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 22:43:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 397 transitions. [2021-10-05 22:43:32,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:32,811 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43: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 22:43:32,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable292 [2021-10-05 22:43:32,812 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 22:43:32,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:32,812 INFO L82 PathProgramCache]: Analyzing trace with hash 330131505, now seen corresponding path program 293 times [2021-10-05 22:43:32,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:32,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774304354] [2021-10-05 22:43:32,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:32,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:32,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:32,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:32,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774304354] [2021-10-05 22:43:32,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774304354] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:32,921 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:32,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:32,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015896307] [2021-10-05 22:43:32,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:32,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:32,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:32,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:32,923 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 22:43:33,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:33,137 INFO L93 Difference]: Finished difference Result 214 states and 429 transitions. [2021-10-05 22:43:33,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:43:33,138 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 22:43:33,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:33,139 INFO L225 Difference]: With dead ends: 214 [2021-10-05 22:43:33,139 INFO L226 Difference]: Without dead ends: 192 [2021-10-05 22:43:33,139 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 131.2ms TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:43:33,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-10-05 22:43:33,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2021-10-05 22:43:33,142 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 22:43:33,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 392 transitions. [2021-10-05 22:43:33,142 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 392 transitions. Word has length 38 [2021-10-05 22:43:33,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:33,142 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 392 transitions. [2021-10-05 22:43:33,142 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 22:43:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 392 transitions. [2021-10-05 22:43:33,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:33,143 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:33,143 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:33,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable293 [2021-10-05 22:43:33,143 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 22:43:33,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:33,143 INFO L82 PathProgramCache]: Analyzing trace with hash -102601993, now seen corresponding path program 294 times [2021-10-05 22:43:33,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:33,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190004661] [2021-10-05 22:43:33,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:33,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:33,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:33,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190004661] [2021-10-05 22:43:33,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190004661] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:33,272 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:33,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:33,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099141982] [2021-10-05 22:43:33,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:33,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:33,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:33,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:33,274 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 22:43:33,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:33,491 INFO L93 Difference]: Finished difference Result 222 states and 447 transitions. [2021-10-05 22:43:33,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:43:33,492 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 22:43:33,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:33,493 INFO L225 Difference]: With dead ends: 222 [2021-10-05 22:43:33,493 INFO L226 Difference]: Without dead ends: 202 [2021-10-05 22:43:33,493 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 154.2ms TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:43:33,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-05 22:43:33,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 198. [2021-10-05 22:43:33,496 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 22:43:33,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 401 transitions. [2021-10-05 22:43:33,496 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 401 transitions. Word has length 38 [2021-10-05 22:43:33,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:33,496 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 401 transitions. [2021-10-05 22:43:33,496 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 22:43:33,497 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 401 transitions. [2021-10-05 22:43:33,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:33,497 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:33,497 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:33,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable294 [2021-10-05 22:43:33,497 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 22:43:33,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:33,498 INFO L82 PathProgramCache]: Analyzing trace with hash -838822625, now seen corresponding path program 295 times [2021-10-05 22:43:33,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:33,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267804506] [2021-10-05 22:43:33,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:33,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:33,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:33,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:33,635 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267804506] [2021-10-05 22:43:33,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267804506] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:33,635 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:33,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:33,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845140599] [2021-10-05 22:43:33,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:33,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:33,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:33,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:33,636 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 22:43:33,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:33,859 INFO L93 Difference]: Finished difference Result 214 states and 429 transitions. [2021-10-05 22:43:33,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:43:33,860 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 22:43:33,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:33,860 INFO L225 Difference]: With dead ends: 214 [2021-10-05 22:43:33,860 INFO L226 Difference]: Without dead ends: 200 [2021-10-05 22:43:33,860 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 172.4ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:43:33,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-10-05 22:43:33,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2021-10-05 22:43:33,862 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 22:43:33,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 404 transitions. [2021-10-05 22:43:33,863 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 404 transitions. Word has length 38 [2021-10-05 22:43:33,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:33,863 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 404 transitions. [2021-10-05 22:43:33,863 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 22:43:33,863 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 404 transitions. [2021-10-05 22:43:33,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:33,864 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:33,864 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:33,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable295 [2021-10-05 22:43:33,864 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 22:43:33,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:33,864 INFO L82 PathProgramCache]: Analyzing trace with hash 598566995, now seen corresponding path program 296 times [2021-10-05 22:43:33,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:33,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581181359] [2021-10-05 22:43:33,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:33,865 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:33,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 22:43:33,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:33,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581181359] [2021-10-05 22:43:33,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581181359] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:33,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:33,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:33,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205545517] [2021-10-05 22:43:33,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:33,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:33,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:33,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:33,991 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 22:43:34,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:34,199 INFO L93 Difference]: Finished difference Result 218 states and 437 transitions. [2021-10-05 22:43:34,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:43:34,200 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 22:43:34,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:34,200 INFO L225 Difference]: With dead ends: 218 [2021-10-05 22:43:34,200 INFO L226 Difference]: Without dead ends: 188 [2021-10-05 22:43:34,201 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 156.7ms TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:43:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-10-05 22:43:34,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2021-10-05 22:43:34,203 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 22:43:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 384 transitions. [2021-10-05 22:43:34,203 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 384 transitions. Word has length 38 [2021-10-05 22:43:34,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:34,203 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 384 transitions. [2021-10-05 22:43:34,203 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 22:43:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 384 transitions. [2021-10-05 22:43:34,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:34,204 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:34,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 22:43:34,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable296 [2021-10-05 22:43:34,204 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 22:43:34,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:34,204 INFO L82 PathProgramCache]: Analyzing trace with hash 766419323, now seen corresponding path program 297 times [2021-10-05 22:43:34,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:34,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488231335] [2021-10-05 22:43:34,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:34,205 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:34,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:34,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488231335] [2021-10-05 22:43:34,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488231335] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:34,304 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:34,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:43:34,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747396253] [2021-10-05 22:43:34,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:43:34,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:34,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:43:34,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:43:34,306 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 22:43:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:34,513 INFO L93 Difference]: Finished difference Result 210 states and 415 transitions. [2021-10-05 22:43:34,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:43:34,513 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 22:43:34,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:34,514 INFO L225 Difference]: With dead ends: 210 [2021-10-05 22:43:34,514 INFO L226 Difference]: Without dead ends: 198 [2021-10-05 22:43:34,515 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 89.5ms TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-10-05 22:43:34,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-05 22:43:34,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2021-10-05 22:43:34,531 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 22:43:34,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 378 transitions. [2021-10-05 22:43:34,531 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 378 transitions. Word has length 38 [2021-10-05 22:43:34,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:34,532 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 378 transitions. [2021-10-05 22:43:34,532 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 22:43:34,532 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 378 transitions. [2021-10-05 22:43:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:34,533 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:34,533 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:34,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable297 [2021-10-05 22:43:34,533 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 22:43:34,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:34,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1116003789, now seen corresponding path program 298 times [2021-10-05 22:43:34,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:34,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698593974] [2021-10-05 22:43:34,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:34,535 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:34,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:34,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:34,635 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698593974] [2021-10-05 22:43:34,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698593974] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:34,636 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:34,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:43:34,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105547614] [2021-10-05 22:43:34,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:43:34,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:34,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:43:34,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:43:34,637 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 22:43:34,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:34,869 INFO L93 Difference]: Finished difference Result 256 states and 520 transitions. [2021-10-05 22:43:34,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 22:43:34,870 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 22:43:34,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:34,871 INFO L225 Difference]: With dead ends: 256 [2021-10-05 22:43:34,871 INFO L226 Difference]: Without dead ends: 248 [2021-10-05 22:43:34,872 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 89.9ms TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-10-05 22:43:34,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-10-05 22:43:34,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 190. [2021-10-05 22:43:34,875 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 22:43:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 381 transitions. [2021-10-05 22:43:34,876 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 381 transitions. Word has length 38 [2021-10-05 22:43:34,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:34,876 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 381 transitions. [2021-10-05 22:43:34,876 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 22:43:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 381 transitions. [2021-10-05 22:43:34,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:34,877 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:34,877 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:34,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable298 [2021-10-05 22:43:34,878 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 22:43:34,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:34,878 INFO L82 PathProgramCache]: Analyzing trace with hash -394832861, now seen corresponding path program 299 times [2021-10-05 22:43:34,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:34,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651287553] [2021-10-05 22:43:34,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:34,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:34,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:34,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:34,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651287553] [2021-10-05 22:43:34,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651287553] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:34,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:34,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:34,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467376734] [2021-10-05 22:43:34,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:34,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:34,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:34,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:34,997 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 22:43:35,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:35,239 INFO L93 Difference]: Finished difference Result 254 states and 513 transitions. [2021-10-05 22:43:35,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:43:35,240 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 22:43:35,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:35,241 INFO L225 Difference]: With dead ends: 254 [2021-10-05 22:43:35,241 INFO L226 Difference]: Without dead ends: 240 [2021-10-05 22:43:35,241 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 128.6ms TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:43:35,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-10-05 22:43:35,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 182. [2021-10-05 22:43:35,245 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 22:43:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 363 transitions. [2021-10-05 22:43:35,246 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 363 transitions. Word has length 38 [2021-10-05 22:43:35,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:35,246 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 363 transitions. [2021-10-05 22:43:35,247 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 22:43:35,247 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 363 transitions. [2021-10-05 22:43:35,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:35,247 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:35,248 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:35,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable299 [2021-10-05 22:43:35,248 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 22:43:35,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:35,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2051568799, now seen corresponding path program 300 times [2021-10-05 22:43:35,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:35,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856348857] [2021-10-05 22:43:35,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:35,249 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:35,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:35,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:35,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856348857] [2021-10-05 22:43:35,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856348857] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:35,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:35,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:35,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597997563] [2021-10-05 22:43:35,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:35,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:35,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:35,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:35,371 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 22:43:35,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:35,579 INFO L93 Difference]: Finished difference Result 198 states and 389 transitions. [2021-10-05 22:43:35,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:43:35,580 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 22:43:35,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:35,580 INFO L225 Difference]: With dead ends: 198 [2021-10-05 22:43:35,580 INFO L226 Difference]: Without dead ends: 178 [2021-10-05 22:43:35,581 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 22:43:35,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-10-05 22:43:35,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2021-10-05 22:43:35,583 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 22:43:35,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 348 transitions. [2021-10-05 22:43:35,583 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 348 transitions. Word has length 38 [2021-10-05 22:43:35,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:35,583 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 348 transitions. [2021-10-05 22:43:35,583 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 22:43:35,583 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 348 transitions. [2021-10-05 22:43:35,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:35,584 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:35,584 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:35,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable300 [2021-10-05 22:43:35,584 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 22:43:35,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:35,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1166631645, now seen corresponding path program 301 times [2021-10-05 22:43:35,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:35,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980272692] [2021-10-05 22:43:35,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:35,585 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:35,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:35,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:35,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980272692] [2021-10-05 22:43:35,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980272692] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:35,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:35,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:35,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469642374] [2021-10-05 22:43:35,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:35,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:35,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:35,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:35,701 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 22:43:35,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:35,929 INFO L93 Difference]: Finished difference Result 222 states and 441 transitions. [2021-10-05 22:43:35,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:43:35,929 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 22:43:35,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:35,930 INFO L225 Difference]: With dead ends: 222 [2021-10-05 22:43:35,930 INFO L226 Difference]: Without dead ends: 204 [2021-10-05 22:43:35,930 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 115.5ms TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:43:35,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-10-05 22:43:35,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 178. [2021-10-05 22:43:35,932 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 22:43:35,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 351 transitions. [2021-10-05 22:43:35,933 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 351 transitions. Word has length 38 [2021-10-05 22:43:35,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:35,933 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 351 transitions. [2021-10-05 22:43:35,933 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 22:43:35,933 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 351 transitions. [2021-10-05 22:43:35,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:35,933 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:35,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 22:43:35,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable301 [2021-10-05 22:43:35,934 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 22:43:35,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:35,934 INFO L82 PathProgramCache]: Analyzing trace with hash 420629283, now seen corresponding path program 302 times [2021-10-05 22:43:35,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:35,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090745911] [2021-10-05 22:43:35,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:35,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:36,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:36,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:36,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090745911] [2021-10-05 22:43:36,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090745911] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:36,060 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:36,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:36,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127038722] [2021-10-05 22:43:36,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:36,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:36,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:36,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:36,061 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 22:43:36,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:36,309 INFO L93 Difference]: Finished difference Result 192 states and 374 transitions. [2021-10-05 22:43:36,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:43:36,310 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 22:43:36,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:36,311 INFO L225 Difference]: With dead ends: 192 [2021-10-05 22:43:36,311 INFO L226 Difference]: Without dead ends: 170 [2021-10-05 22:43:36,311 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 144.6ms TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:43:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-10-05 22:43:36,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2021-10-05 22:43:36,314 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 22:43:36,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 333 transitions. [2021-10-05 22:43:36,314 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 333 transitions. Word has length 38 [2021-10-05 22:43:36,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:36,314 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 333 transitions. [2021-10-05 22:43:36,314 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 22:43:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 333 transitions. [2021-10-05 22:43:36,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:36,315 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:36,315 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:36,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable302 [2021-10-05 22:43:36,315 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 22:43:36,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:36,315 INFO L82 PathProgramCache]: Analyzing trace with hash -135521233, now seen corresponding path program 303 times [2021-10-05 22:43:36,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:36,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989458973] [2021-10-05 22:43:36,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:36,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:36,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:36,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989458973] [2021-10-05 22:43:36,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989458973] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:36,415 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:36,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:43:36,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188474221] [2021-10-05 22:43:36,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:43:36,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:36,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:43:36,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:43:36,417 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 22:43:36,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:36,588 INFO L93 Difference]: Finished difference Result 174 states and 337 transitions. [2021-10-05 22:43:36,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 22:43:36,589 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 22:43:36,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:36,589 INFO L225 Difference]: With dead ends: 174 [2021-10-05 22:43:36,589 INFO L226 Difference]: Without dead ends: 166 [2021-10-05 22:43:36,590 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 106.0ms TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-10-05 22:43:36,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-10-05 22:43:36,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2021-10-05 22:43:36,592 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 22:43:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 323 transitions. [2021-10-05 22:43:36,592 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 323 transitions. Word has length 38 [2021-10-05 22:43:36,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:36,592 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 323 transitions. [2021-10-05 22:43:36,592 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 22:43:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 323 transitions. [2021-10-05 22:43:36,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:36,593 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:36,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 22:43:36,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable303 [2021-10-05 22:43:36,593 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 22:43:36,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:36,593 INFO L82 PathProgramCache]: Analyzing trace with hash 585649695, now seen corresponding path program 304 times [2021-10-05 22:43:36,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:36,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896702781] [2021-10-05 22:43:36,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:36,594 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:36,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 22:43:36,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:36,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896702781] [2021-10-05 22:43:36,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896702781] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:36,703 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:36,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:36,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860623214] [2021-10-05 22:43:36,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:36,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:36,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:36,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:36,705 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 22:43:36,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:36,907 INFO L93 Difference]: Finished difference Result 172 states and 330 transitions. [2021-10-05 22:43:36,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:43:36,908 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 22:43:36,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:36,908 INFO L225 Difference]: With dead ends: 172 [2021-10-05 22:43:36,908 INFO L226 Difference]: Without dead ends: 164 [2021-10-05 22:43:36,909 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 132.3ms TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:43:36,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-10-05 22:43:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2021-10-05 22:43:36,910 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 22:43:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 318 transitions. [2021-10-05 22:43:36,911 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 318 transitions. Word has length 38 [2021-10-05 22:43:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:36,911 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 318 transitions. [2021-10-05 22:43:36,911 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 22:43:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 318 transitions. [2021-10-05 22:43:36,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:36,912 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:36,912 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:36,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable304 [2021-10-05 22:43:36,912 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 22:43:36,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:36,912 INFO L82 PathProgramCache]: Analyzing trace with hash -472447691, now seen corresponding path program 305 times [2021-10-05 22:43:36,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:36,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380198324] [2021-10-05 22:43:36,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:36,913 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:37,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:37,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380198324] [2021-10-05 22:43:37,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380198324] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:37,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:37,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:37,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201260169] [2021-10-05 22:43:37,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:37,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:37,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:37,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:37,025 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 22:43:37,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:37,220 INFO L93 Difference]: Finished difference Result 176 states and 338 transitions. [2021-10-05 22:43:37,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:43:37,221 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 22:43:37,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:37,221 INFO L225 Difference]: With dead ends: 176 [2021-10-05 22:43:37,221 INFO L226 Difference]: Without dead ends: 158 [2021-10-05 22:43:37,221 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 124.9ms TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:43:37,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-10-05 22:43:37,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2021-10-05 22:43:37,223 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 22:43:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 303 transitions. [2021-10-05 22:43:37,223 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 303 transitions. Word has length 38 [2021-10-05 22:43:37,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:37,223 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 303 transitions. [2021-10-05 22:43:37,224 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 22:43:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 303 transitions. [2021-10-05 22:43:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:37,224 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:37,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 22:43:37,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable305 [2021-10-05 22:43:37,224 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 22:43:37,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:37,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1218450053, now seen corresponding path program 306 times [2021-10-05 22:43:37,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:37,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065625570] [2021-10-05 22:43:37,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:37,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:37,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:37,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:37,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065625570] [2021-10-05 22:43:37,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065625570] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:37,345 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:37,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:37,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094515746] [2021-10-05 22:43:37,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:37,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:37,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:37,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:37,347 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 22:43:37,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:37,555 INFO L93 Difference]: Finished difference Result 138 states and 257 transitions. [2021-10-05 22:43:37,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:43:37,555 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 22:43:37,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:37,556 INFO L225 Difference]: With dead ends: 138 [2021-10-05 22:43:37,556 INFO L226 Difference]: Without dead ends: 114 [2021-10-05 22:43:37,556 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 141.3ms TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:43:37,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-10-05 22:43:37,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-10-05 22:43:37,558 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 22:43:37,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 217 transitions. [2021-10-05 22:43:37,559 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 217 transitions. Word has length 38 [2021-10-05 22:43:37,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:37,559 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 217 transitions. [2021-10-05 22:43:37,559 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 22:43:37,559 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 217 transitions. [2021-10-05 22:43:37,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:37,559 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:37,559 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:37,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable306 [2021-10-05 22:43:37,560 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 22:43:37,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:37,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1438397617, now seen corresponding path program 307 times [2021-10-05 22:43:37,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:37,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509531962] [2021-10-05 22:43:37,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:37,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:37,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:37,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509531962] [2021-10-05 22:43:37,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509531962] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:37,665 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:37,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:37,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489609850] [2021-10-05 22:43:37,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:37,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:37,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:37,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:37,666 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 22:43:37,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:37,825 INFO L93 Difference]: Finished difference Result 128 states and 236 transitions. [2021-10-05 22:43:37,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:43:37,826 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 22:43:37,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:37,826 INFO L225 Difference]: With dead ends: 128 [2021-10-05 22:43:37,826 INFO L226 Difference]: Without dead ends: 116 [2021-10-05 22:43:37,826 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 96.4ms TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2021-10-05 22:43:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-10-05 22:43:37,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2021-10-05 22:43:37,828 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 22:43:37,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 211 transitions. [2021-10-05 22:43:37,829 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 211 transitions. Word has length 38 [2021-10-05 22:43:37,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:37,829 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 211 transitions. [2021-10-05 22:43:37,829 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 22:43:37,829 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 211 transitions. [2021-10-05 22:43:37,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:37,830 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:37,830 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:37,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable307 [2021-10-05 22:43:37,830 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 22:43:37,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:37,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1459831229, now seen corresponding path program 308 times [2021-10-05 22:43:37,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:37,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579420472] [2021-10-05 22:43:37,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:37,831 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:37,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:37,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:37,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579420472] [2021-10-05 22:43:37,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579420472] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:37,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:37,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:43:37,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679377090] [2021-10-05 22:43:37,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:43:37,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:37,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:43:37,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:43:37,920 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 22:43:38,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:38,140 INFO L93 Difference]: Finished difference Result 188 states and 360 transitions. [2021-10-05 22:43:38,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:43:38,140 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 22:43:38,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:38,141 INFO L225 Difference]: With dead ends: 188 [2021-10-05 22:43:38,141 INFO L226 Difference]: Without dead ends: 166 [2021-10-05 22:43:38,141 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 101.4ms TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:43:38,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-10-05 22:43:38,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 108. [2021-10-05 22:43:38,143 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 22:43:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 196 transitions. [2021-10-05 22:43:38,143 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 196 transitions. Word has length 38 [2021-10-05 22:43:38,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:38,143 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 196 transitions. [2021-10-05 22:43:38,143 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 22:43:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 196 transitions. [2021-10-05 22:43:38,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:38,143 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:38,144 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:38,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable308 [2021-10-05 22:43:38,144 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 22:43:38,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:38,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1298417253, now seen corresponding path program 309 times [2021-10-05 22:43:38,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:38,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488454525] [2021-10-05 22:43:38,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:38,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:38,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:38,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:38,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488454525] [2021-10-05 22:43:38,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488454525] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:38,265 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:38,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:43:38,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096009071] [2021-10-05 22:43:38,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:43:38,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:38,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:43:38,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:43:38,267 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 22:43:38,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:38,438 INFO L93 Difference]: Finished difference Result 124 states and 222 transitions. [2021-10-05 22:43:38,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:43:38,439 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 22:43:38,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:38,439 INFO L225 Difference]: With dead ends: 124 [2021-10-05 22:43:38,439 INFO L226 Difference]: Without dead ends: 104 [2021-10-05 22:43:38,439 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 126.1ms TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:43:38,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-10-05 22:43:38,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2021-10-05 22:43:38,441 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 22:43:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 181 transitions. [2021-10-05 22:43:38,441 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 181 transitions. Word has length 38 [2021-10-05 22:43:38,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:38,441 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 181 transitions. [2021-10-05 22:43:38,441 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 22:43:38,441 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 181 transitions. [2021-10-05 22:43:38,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:38,442 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:38,442 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:38,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable309 [2021-10-05 22:43:38,442 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 22:43:38,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:38,442 INFO L82 PathProgramCache]: Analyzing trace with hash -2034637885, now seen corresponding path program 310 times [2021-10-05 22:43:38,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:38,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559089721] [2021-10-05 22:43:38,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:38,443 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:38,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:38,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559089721] [2021-10-05 22:43:38,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559089721] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:38,541 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:38,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:38,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315332722] [2021-10-05 22:43:38,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:38,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:38,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:38,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:38,542 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 22:43:38,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:38,754 INFO L93 Difference]: Finished difference Result 136 states and 242 transitions. [2021-10-05 22:43:38,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:43:38,754 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 22:43:38,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:38,755 INFO L225 Difference]: With dead ends: 136 [2021-10-05 22:43:38,755 INFO L226 Difference]: Without dead ends: 96 [2021-10-05 22:43:38,755 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 127.0ms TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:43:38,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-10-05 22:43:38,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-10-05 22:43:38,757 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 22:43:38,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 166 transitions. [2021-10-05 22:43:38,757 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 166 transitions. Word has length 38 [2021-10-05 22:43:38,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:38,757 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 166 transitions. [2021-10-05 22:43:38,757 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 22:43:38,757 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 166 transitions. [2021-10-05 22:43:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:38,758 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:38,758 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:38,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable310 [2021-10-05 22:43:38,758 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 22:43:38,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:38,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1487132955, now seen corresponding path program 311 times [2021-10-05 22:43:38,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:38,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394944927] [2021-10-05 22:43:38,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:38,759 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:38,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:38,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394944927] [2021-10-05 22:43:38,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394944927] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:38,848 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:38,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:43:38,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561500488] [2021-10-05 22:43:38,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:43:38,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:38,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:43:38,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:43:38,849 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 22:43:39,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:39,001 INFO L93 Difference]: Finished difference Result 102 states and 173 transitions. [2021-10-05 22:43:39,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:43:39,001 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 22:43:39,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:39,002 INFO L225 Difference]: With dead ends: 102 [2021-10-05 22:43:39,002 INFO L226 Difference]: Without dead ends: 90 [2021-10-05 22:43:39,002 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 102.1ms TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:43:39,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-10-05 22:43:39,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-10-05 22:43:39,003 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 22:43:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 151 transitions. [2021-10-05 22:43:39,004 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 151 transitions. Word has length 38 [2021-10-05 22:43:39,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:39,004 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 151 transitions. [2021-10-05 22:43:39,004 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 22:43:39,004 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 151 transitions. [2021-10-05 22:43:39,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 22:43:39,004 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:43:39,004 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:43:39,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable311 [2021-10-05 22:43:39,005 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 22:43:39,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:43:39,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1685418895, now seen corresponding path program 312 times [2021-10-05 22:43:39,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:43:39,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083912036] [2021-10-05 22:43:39,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:43:39,005 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:43:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:43:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:43:39,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:43:39,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083912036] [2021-10-05 22:43:39,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083912036] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:43:39,104 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:43:39,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:43:39,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40783639] [2021-10-05 22:43:39,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:43:39,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:43:39,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:43:39,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:43:39,105 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 22:43:39,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:43:39,243 INFO L93 Difference]: Finished difference Result 50 states and 79 transitions. [2021-10-05 22:43:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:43:39,244 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 22:43:39,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:43:39,244 INFO L225 Difference]: With dead ends: 50 [2021-10-05 22:43:39,244 INFO L226 Difference]: Without dead ends: 0 [2021-10-05 22:43:39,245 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 102.8ms TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:43:39,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-05 22:43:39,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-05 22:43:39,245 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 22:43:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-05 22:43:39,245 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2021-10-05 22:43:39,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:43:39,245 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-05 22:43:39,245 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 22:43:39,246 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-05 22:43:39,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-05 22:43:39,248 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-05 22:43:39,249 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-05 22:43:39,249 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-05 22:43:39,249 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-05 22:43:39,252 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATION [2021-10-05 22:43:39,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable312 [2021-10-05 22:43:39,259 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-05 22:43:39,259 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-05 22:43:39,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 10:43:39 BasicIcfg [2021-10-05 22:43:39,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-05 22:43:39,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-05 22:43:39,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-05 22:43:39,262 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-05 22:43:39,263 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:40:05" (3/4) ... [2021-10-05 22:43:39,266 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-05 22:43:39,272 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-10-05 22:43:39,273 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-10-05 22:43:39,273 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-10-05 22:43:39,273 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2021-10-05 22:43:39,279 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2021-10-05 22:43:39,280 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-05 22:43:39,280 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-05 22:43:39,280 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-05 22:43:39,314 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-05 22:43:39,314 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-05 22:43:39,317 INFO L168 Benchmark]: Toolchain (without parser) took 214675.79 ms. Allocated memory was 48.2 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 24.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 672.7 MB. Max. memory is 16.1 GB. [2021-10-05 22:43:39,317 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 48.2 MB. Free memory was 27.1 MB in the beginning and 27.0 MB in the end (delta: 33.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-05 22:43:39,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.51 ms. Allocated memory was 48.2 MB in the beginning and 60.8 MB in the end (delta: 12.6 MB). Free memory was 23.9 MB in the beginning and 37.0 MB in the end (delta: -13.1 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2021-10-05 22:43:39,318 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.33 ms. Allocated memory is still 60.8 MB. Free memory was 37.0 MB in the beginning and 35.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-05 22:43:39,319 INFO L168 Benchmark]: Boogie Preprocessor took 31.96 ms. Allocated memory is still 60.8 MB. Free memory was 35.0 MB in the beginning and 33.6 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-05 22:43:39,319 INFO L168 Benchmark]: RCFGBuilder took 724.40 ms. Allocated memory is still 60.8 MB. Free memory was 33.6 MB in the beginning and 32.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-05 22:43:39,320 INFO L168 Benchmark]: TraceAbstraction took 213470.97 ms. Allocated memory was 60.8 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 31.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 661.0 MB. Max. memory is 16.1 GB. [2021-10-05 22:43:39,320 INFO L168 Benchmark]: Witness Printer took 52.74 ms. Allocated memory is still 2.0 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-05 22:43:39,323 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.26 ms. Allocated memory is still 48.2 MB. Free memory was 27.1 MB in the beginning and 27.0 MB in the end (delta: 33.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 329.51 ms. Allocated memory was 48.2 MB in the beginning and 60.8 MB in the end (delta: 12.6 MB). Free memory was 23.9 MB in the beginning and 37.0 MB in the end (delta: -13.1 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 53.33 ms. Allocated memory is still 60.8 MB. Free memory was 37.0 MB in the beginning and 35.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.96 ms. Allocated memory is still 60.8 MB. Free memory was 35.0 MB in the beginning and 33.6 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 724.40 ms. Allocated memory is still 60.8 MB. Free memory was 33.6 MB in the beginning and 32.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 213470.97 ms. Allocated memory was 60.8 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 31.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 661.0 MB. Max. memory is 16.1 GB. * Witness Printer took 52.74 ms. Allocated memory is still 2.0 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6521.1ms, 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: 237, positive: 122, positive conditional: 0, positive unconditional: 122, negative: 115, negative conditional: 0, negative unconditional: 115, 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: 213202.7ms, OverallIterations: 313, TraceHistogramMax: 1, EmptinessCheckTime: 1261.4ms, AutomataDifference: 150860.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6850.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 22455 SDtfs, 31999 SDslu, 131086 SDs, 0 SdLazy, 135918 SolverSat, 9542 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 72841.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7061 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 6684 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30136 ImplicationChecksByTransitivity, 66254.1ms 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: 13677.1ms AutomataMinimizationTime, 313 MinimizatonAttempts, 117528 StatesRemovedByMinimization, 285 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 532.2ms SsaConstructionTime, 5772.2ms SatisfiabilityAnalysisTime, 31897.6ms 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 22:43:39,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...