./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel/ticket-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8c2bbc92 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel/ticket-4.wvr.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b35f2aa4b110c089eeeca9681cb8383cf6eb05d5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-04 18:48:58,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-04 18:48:58,890 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-04 18:48:58,924 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-04 18:48:58,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-04 18:48:58,927 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-04 18:48:58,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-04 18:48:58,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-04 18:48:58,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-04 18:48:58,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-04 18:48:58,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-04 18:48:58,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-04 18:48:58,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-04 18:48:58,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-04 18:48:58,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-04 18:48:58,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-04 18:48:58,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-04 18:48:58,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-04 18:48:58,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-04 18:48:58,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-04 18:48:58,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-04 18:48:58,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-04 18:48:58,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-04 18:48:58,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-04 18:48:58,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-04 18:48:58,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-04 18:48:58,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-04 18:48:58,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-04 18:48:58,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-04 18:48:58,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-04 18:48:58,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-04 18:48:58,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-04 18:48:58,980 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-04 18:48:58,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-04 18:48:58,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-04 18:48:58,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-04 18:48:58,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-04 18:48:58,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-04 18:48:58,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-04 18:48:58,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-04 18:48:58,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-04 18:48:58,991 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-04 18:48:59,024 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-04 18:48:59,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-04 18:48:59,025 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-04 18:48:59,025 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-04 18:48:59,026 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-04 18:48:59,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-04 18:48:59,028 INFO L138 SettingsManager]: * Use SBE=true [2021-10-04 18:48:59,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-04 18:48:59,029 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-04 18:48:59,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-04 18:48:59,030 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-04 18:48:59,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-04 18:48:59,031 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-04 18:48:59,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-04 18:48:59,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-04 18:48:59,032 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-04 18:48:59,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-04 18:48:59,033 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-04 18:48:59,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-04 18:48:59,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-04 18:48:59,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-04 18:48:59,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-04 18:48:59,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-04 18:48:59,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-04 18:48:59,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-04 18:48:59,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-04 18:48:59,035 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-04 18:48:59,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-04 18:48:59,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-04 18:48:59,036 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-04 18:48:59,037 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 -> b35f2aa4b110c089eeeca9681cb8383cf6eb05d5 [2021-10-04 18:48:59,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-04 18:48:59,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-04 18:48:59,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-04 18:48:59,492 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-04 18:48:59,492 INFO L275 PluginConnector]: CDTParser initialized [2021-10-04 18:48:59,493 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-04 18:48:59,575 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7d6b5df2e/c79df1226e344a64ac7ea6bba06e2a88/FLAG592f18de0 [2021-10-04 18:49:00,213 INFO L306 CDTParser]: Found 1 translation units. [2021-10-04 18:49:00,214 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/ticket-4.wvr.c [2021-10-04 18:49:00,214 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2021-10-04 18:49:00,214 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2021-10-04 18:49:00,222 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7d6b5df2e/c79df1226e344a64ac7ea6bba06e2a88/FLAG592f18de0 [2021-10-04 18:49:00,239 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7d6b5df2e/c79df1226e344a64ac7ea6bba06e2a88 [2021-10-04 18:49:00,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-04 18:49:00,250 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-04 18:49:00,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-04 18:49:00,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-04 18:49:00,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-04 18:49:00,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.10 06:49:00" (1/1) ... [2021-10-04 18:49:00,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a7e301d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:49:00, skipping insertion in model container [2021-10-04 18:49:00,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.10 06:49:00" (1/1) ... [2021-10-04 18:49:00,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-04 18:49:00,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-04 18:49:00,446 WARN L612 FunctionHandler]: implicit declaration of function assert [2021-10-04 18:49:00,496 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[1788,1801] [2021-10-04 18:49:00,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-04 18:49:00,512 INFO L203 MainTranslator]: Completed pre-run [2021-10-04 18:49:00,524 WARN L612 FunctionHandler]: implicit declaration of function assert [2021-10-04 18:49:00,540 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[1788,1801] [2021-10-04 18:49:00,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-04 18:49:00,560 INFO L208 MainTranslator]: Completed translation [2021-10-04 18:49:00,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:49:00 WrapperNode [2021-10-04 18:49:00,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-04 18:49:00,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-04 18:49:00,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-04 18:49:00,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-04 18:49:00,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:49:00" (1/1) ... [2021-10-04 18:49:00,593 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:49:00" (1/1) ... [2021-10-04 18:49:00,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-04 18:49:00,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-04 18:49:00,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-04 18:49:00,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-04 18:49:00,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:49:00" (1/1) ... [2021-10-04 18:49:00,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:49:00" (1/1) ... [2021-10-04 18:49:00,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:49:00" (1/1) ... [2021-10-04 18:49:00,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:49:00" (1/1) ... [2021-10-04 18:49:00,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:49:00" (1/1) ... [2021-10-04 18:49:00,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:49:00" (1/1) ... [2021-10-04 18:49:00,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:49:00" (1/1) ... [2021-10-04 18:49:00,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-04 18:49:00,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-04 18:49:00,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-04 18:49:00,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-04 18:49:00,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:49:00" (1/1) ... [2021-10-04 18:49:00,717 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-04 18:49:00,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:49:00,752 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-04 18:49:00,779 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-04 18:49:00,824 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-04 18:49:00,824 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-04 18:49:00,824 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-04 18:49:00,825 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-04 18:49:00,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-04 18:49:00,825 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-04 18:49:00,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-10-04 18:49:00,825 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-10-04 18:49:00,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-04 18:49:00,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-04 18:49:00,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-04 18:49:00,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-04 18:49:00,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-04 18:49:00,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-04 18:49:00,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-04 18:49:00,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-04 18:49:00,829 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-04 18:49:01,370 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-04 18:49:01,370 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2021-10-04 18:49:01,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 06:49:01 BoogieIcfgContainer [2021-10-04 18:49:01,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-04 18:49:01,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-04 18:49:01,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-04 18:49:01,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-04 18:49:01,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.10 06:49:00" (1/3) ... [2021-10-04 18:49:01,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf2bd30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 06:49:01, skipping insertion in model container [2021-10-04 18:49:01,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:49:00" (2/3) ... [2021-10-04 18:49:01,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf2bd30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 06:49:01, skipping insertion in model container [2021-10-04 18:49:01,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 06:49:01" (3/3) ... [2021-10-04 18:49:01,382 INFO L111 eAbstractionObserver]: Analyzing ICFG ticket-4.wvr.c [2021-10-04 18:49:01,388 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-04 18:49:01,389 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-04 18:49:01,389 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-04 18:49:01,389 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-04 18:49:01,435 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,435 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,436 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,436 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,436 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,436 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,436 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,437 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,437 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,437 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,437 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,439 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,439 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,439 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,440 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,440 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,440 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,441 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,441 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,441 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,441 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,441 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,442 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,442 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,442 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,442 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,443 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,443 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,443 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,443 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,444 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,444 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,444 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,444 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,444 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,445 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,445 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,445 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,445 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,446 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,446 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,446 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,455 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,456 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,456 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,456 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,456 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,456 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,457 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,457 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,457 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,458 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,458 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,458 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,458 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,458 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,459 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,459 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,459 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,459 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,459 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,460 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,460 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,461 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,461 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,461 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,461 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,461 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,464 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,464 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,464 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,464 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,465 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,465 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,465 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,466 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,466 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,466 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,466 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,466 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,467 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,469 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,469 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,469 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,470 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,470 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,470 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,470 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,471 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,471 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,471 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,471 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,471 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,472 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,474 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,474 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,479 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,481 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,481 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,481 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,481 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,482 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,486 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,487 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,489 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,489 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,490 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,490 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,494 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,494 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,494 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,494 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,495 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,495 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,500 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,500 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,500 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,500 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,501 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,502 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:49:01,522 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-10-04 18:49:01,600 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-04 18:49:01,612 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-04 18:49:01,612 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-10-04 18:49:01,662 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-04 18:49:01,675 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 155 transitions, 342 flow [2021-10-04 18:49:01,679 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 155 transitions, 342 flow [2021-10-04 18:49:01,681 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 162 places, 155 transitions, 342 flow [2021-10-04 18:49:01,837 INFO L129 PetriNetUnfolder]: 6/151 cut-off events. [2021-10-04 18:49:01,838 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-10-04 18:49:01,848 INFO L84 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 151 events. 6/151 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 137 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2021-10-04 18:49:01,857 INFO L116 LiptonReduction]: Number of co-enabled transitions 3864 [2021-10-04 18:49:06,571 INFO L131 LiptonReduction]: Checked pairs total: 11537 [2021-10-04 18:49:06,572 INFO L133 LiptonReduction]: Total number of compositions: 135 [2021-10-04 18:49:06,581 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 46 transitions, 124 flow [2021-10-04 18:49:06,806 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4146 states, 4145 states have (on average 4.187696019300362) internal successors, (17358), 4145 states have internal predecessors, (17358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:06,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 4146 states, 4145 states have (on average 4.187696019300362) internal successors, (17358), 4145 states have internal predecessors, (17358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:06,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-04 18:49:06,890 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:06,891 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:06,891 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-04 18:49:06,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:06,898 INFO L82 PathProgramCache]: Analyzing trace with hash -148863997, now seen corresponding path program 1 times [2021-10-04 18:49:06,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:06,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296132125] [2021-10-04 18:49:06,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:06,912 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:07,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-04 18:49:07,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:07,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296132125] [2021-10-04 18:49:07,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296132125] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:07,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:07,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-04 18:49:07,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347772214] [2021-10-04 18:49:07,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-04 18:49:07,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:07,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-04 18:49:07,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-04 18:49:07,235 INFO L87 Difference]: Start difference. First operand has 4146 states, 4145 states have (on average 4.187696019300362) internal successors, (17358), 4145 states have internal predecessors, (17358), 0 states have call successors, (0), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:07,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:07,341 INFO L93 Difference]: Finished difference Result 4146 states and 15422 transitions. [2021-10-04 18:49:07,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-04 18:49:07,343 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-04 18:49:07,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:07,439 INFO L225 Difference]: With dead ends: 4146 [2021-10-04 18:49:07,440 INFO L226 Difference]: Without dead ends: 4146 [2021-10-04 18:49:07,441 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-04 18:49:07,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4146 states. [2021-10-04 18:49:07,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4146 to 4146. [2021-10-04 18:49:07,846 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-04 18:49:07,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4146 states to 4146 states and 15422 transitions. [2021-10-04 18:49:07,889 INFO L78 Accepts]: Start accepts. Automaton has 4146 states and 15422 transitions. Word has length 26 [2021-10-04 18:49:07,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:07,890 INFO L470 AbstractCegarLoop]: Abstraction has 4146 states and 15422 transitions. [2021-10-04 18:49:07,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:07,892 INFO L276 IsEmpty]: Start isEmpty. Operand 4146 states and 15422 transitions. [2021-10-04 18:49:07,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:07,971 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:07,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-04 18:49:07,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-04 18:49:07,972 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-04 18:49:07,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:07,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1094942690, now seen corresponding path program 1 times [2021-10-04 18:49:07,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:07,974 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541995924] [2021-10-04 18:49:07,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:07,975 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:08,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:08,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541995924] [2021-10-04 18:49:08,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541995924] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:08,289 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:08,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-04 18:49:08,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423971851] [2021-10-04 18:49:08,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-04 18:49:08,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:08,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-04 18:49:08,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-04 18:49:08,293 INFO L87 Difference]: Start difference. First operand 4146 states and 15422 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-04 18:49:08,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:08,858 INFO L93 Difference]: Finished difference Result 6050 states and 22506 transitions. [2021-10-04 18:49:08,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-04 18:49:08,858 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-04 18:49:08,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:08,945 INFO L225 Difference]: With dead ends: 6050 [2021-10-04 18:49:08,945 INFO L226 Difference]: Without dead ends: 5102 [2021-10-04 18:49:08,946 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 113.0ms TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:49:08,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5102 states. [2021-10-04 18:49:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5102 to 4502. [2021-10-04 18:49:09,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4502 states, 4501 states have (on average 3.6967340590979783) internal successors, (16639), 4501 states have internal predecessors, (16639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:09,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4502 states to 4502 states and 16639 transitions. [2021-10-04 18:49:09,262 INFO L78 Accepts]: Start accepts. Automaton has 4502 states and 16639 transitions. Word has length 38 [2021-10-04 18:49:09,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:09,264 INFO L470 AbstractCegarLoop]: Abstraction has 4502 states and 16639 transitions. [2021-10-04 18:49:09,264 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-04 18:49:09,265 INFO L276 IsEmpty]: Start isEmpty. Operand 4502 states and 16639 transitions. [2021-10-04 18:49:09,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:09,284 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:09,292 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:09,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-04 18:49:09,293 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-04 18:49:09,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:09,293 INFO L82 PathProgramCache]: Analyzing trace with hash 212164702, now seen corresponding path program 2 times [2021-10-04 18:49:09,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:09,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638163747] [2021-10-04 18:49:09,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:09,295 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:09,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:09,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:09,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638163747] [2021-10-04 18:49:09,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638163747] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:09,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:09,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-04 18:49:09,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355387198] [2021-10-04 18:49:09,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-04 18:49:09,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:09,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-04 18:49:09,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-04 18:49:09,555 INFO L87 Difference]: Start difference. First operand 4502 states and 16639 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-04 18:49:09,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:09,871 INFO L93 Difference]: Finished difference Result 5512 states and 20296 transitions. [2021-10-04 18:49:09,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-04 18:49:09,872 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-04 18:49:09,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:09,923 INFO L225 Difference]: With dead ends: 5512 [2021-10-04 18:49:09,923 INFO L226 Difference]: Without dead ends: 5512 [2021-10-04 18:49:09,924 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 46.7ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:49:09,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5512 states. [2021-10-04 18:49:10,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5512 to 4832. [2021-10-04 18:49:10,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4832 states, 4831 states have (on average 3.671289588077003) internal successors, (17736), 4831 states have internal predecessors, (17736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:10,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4832 states to 4832 states and 17736 transitions. [2021-10-04 18:49:10,227 INFO L78 Accepts]: Start accepts. Automaton has 4832 states and 17736 transitions. Word has length 38 [2021-10-04 18:49:10,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:10,228 INFO L470 AbstractCegarLoop]: Abstraction has 4832 states and 17736 transitions. [2021-10-04 18:49:10,228 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-04 18:49:10,229 INFO L276 IsEmpty]: Start isEmpty. Operand 4832 states and 17736 transitions. [2021-10-04 18:49:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:10,253 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:10,253 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:10,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-04 18:49:10,254 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-04 18:49:10,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:10,255 INFO L82 PathProgramCache]: Analyzing trace with hash 570754852, now seen corresponding path program 3 times [2021-10-04 18:49:10,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:10,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086312180] [2021-10-04 18:49:10,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:10,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:10,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-04 18:49:10,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:10,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086312180] [2021-10-04 18:49:10,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086312180] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:10,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:10,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-04 18:49:10,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483596521] [2021-10-04 18:49:10,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-04 18:49:10,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:10,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-04 18:49:10,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:49:10,372 INFO L87 Difference]: Start difference. First operand 4832 states and 17736 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-04 18:49:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:10,765 INFO L93 Difference]: Finished difference Result 4788 states and 16138 transitions. [2021-10-04 18:49:10,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-04 18:49:10,766 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-04 18:49:10,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:10,802 INFO L225 Difference]: With dead ends: 4788 [2021-10-04 18:49:10,802 INFO L226 Difference]: Without dead ends: 4780 [2021-10-04 18:49:10,802 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 42.2ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:49:10,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4780 states. [2021-10-04 18:49:10,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4780 to 4364. [2021-10-04 18:49:10,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4364 states, 4363 states have (on average 3.4256245702498282) internal successors, (14946), 4363 states have internal predecessors, (14946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4364 states to 4364 states and 14946 transitions. [2021-10-04 18:49:10,974 INFO L78 Accepts]: Start accepts. Automaton has 4364 states and 14946 transitions. Word has length 38 [2021-10-04 18:49:10,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:10,974 INFO L470 AbstractCegarLoop]: Abstraction has 4364 states and 14946 transitions. [2021-10-04 18:49:10,975 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-04 18:49:10,975 INFO L276 IsEmpty]: Start isEmpty. Operand 4364 states and 14946 transitions. [2021-10-04 18:49:10,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:10,994 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:10,994 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:10,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-04 18:49:10,995 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-04 18:49:10,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:10,996 INFO L82 PathProgramCache]: Analyzing trace with hash -998061218, now seen corresponding path program 4 times [2021-10-04 18:49:10,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:10,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008801207] [2021-10-04 18:49:10,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:10,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:11,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:11,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:11,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008801207] [2021-10-04 18:49:11,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008801207] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:11,148 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:11,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:49:11,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344113293] [2021-10-04 18:49:11,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:49:11,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:11,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:49:11,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:49:11,150 INFO L87 Difference]: Start difference. First operand 4364 states and 14946 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-04 18:49:11,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:11,587 INFO L93 Difference]: Finished difference Result 5194 states and 17396 transitions. [2021-10-04 18:49:11,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:49:11,587 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-04 18:49:11,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:11,609 INFO L225 Difference]: With dead ends: 5194 [2021-10-04 18:49:11,610 INFO L226 Difference]: Without dead ends: 4864 [2021-10-04 18:49:11,610 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 85.0ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-10-04 18:49:11,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4864 states. [2021-10-04 18:49:11,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4864 to 4404. [2021-10-04 18:49:11,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4404 states, 4403 states have (on average 3.405859641153759) internal successors, (14996), 4403 states have internal predecessors, (14996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:11,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 14996 transitions. [2021-10-04 18:49:11,778 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 14996 transitions. Word has length 38 [2021-10-04 18:49:11,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:11,781 INFO L470 AbstractCegarLoop]: Abstraction has 4404 states and 14996 transitions. [2021-10-04 18:49:11,781 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-04 18:49:11,781 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 14996 transitions. [2021-10-04 18:49:11,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:11,797 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:11,797 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:11,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-04 18:49:11,797 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-04 18:49:11,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:11,799 INFO L82 PathProgramCache]: Analyzing trace with hash 336153206, now seen corresponding path program 5 times [2021-10-04 18:49:11,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:11,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707219184] [2021-10-04 18:49:11,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:11,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:11,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-04 18:49:11,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:11,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707219184] [2021-10-04 18:49:11,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707219184] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:11,975 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:11,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:49:11,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931178542] [2021-10-04 18:49:11,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:49:11,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:11,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:49:11,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:49:11,978 INFO L87 Difference]: Start difference. First operand 4404 states and 14996 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-04 18:49:12,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:12,626 INFO L93 Difference]: Finished difference Result 5942 states and 19479 transitions. [2021-10-04 18:49:12,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-04 18:49:12,626 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-04 18:49:12,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:12,656 INFO L225 Difference]: With dead ends: 5942 [2021-10-04 18:49:12,656 INFO L226 Difference]: Without dead ends: 5244 [2021-10-04 18:49:12,657 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 170.2ms TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:49:12,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2021-10-04 18:49:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 4630. [2021-10-04 18:49:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4630 states, 4629 states have (on average 3.3501836249729964) internal successors, (15508), 4629 states have internal predecessors, (15508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:12,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4630 states to 4630 states and 15508 transitions. [2021-10-04 18:49:12,841 INFO L78 Accepts]: Start accepts. Automaton has 4630 states and 15508 transitions. Word has length 38 [2021-10-04 18:49:12,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:12,842 INFO L470 AbstractCegarLoop]: Abstraction has 4630 states and 15508 transitions. [2021-10-04 18:49:12,842 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-04 18:49:12,843 INFO L276 IsEmpty]: Start isEmpty. Operand 4630 states and 15508 transitions. [2021-10-04 18:49:12,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:12,858 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:12,858 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:12,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-04 18:49:12,859 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-04 18:49:12,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:12,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1033584326, now seen corresponding path program 6 times [2021-10-04 18:49:12,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:12,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493838727] [2021-10-04 18:49:12,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:12,866 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:13,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:13,018 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493838727] [2021-10-04 18:49:13,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493838727] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:13,018 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:13,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:49:13,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848792047] [2021-10-04 18:49:13,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:49:13,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:13,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:49:13,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:49:13,021 INFO L87 Difference]: Start difference. First operand 4630 states and 15508 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-04 18:49:13,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:13,408 INFO L93 Difference]: Finished difference Result 5780 states and 18758 transitions. [2021-10-04 18:49:13,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:49:13,409 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-04 18:49:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:13,434 INFO L225 Difference]: With dead ends: 5780 [2021-10-04 18:49:13,435 INFO L226 Difference]: Without dead ends: 5762 [2021-10-04 18:49:13,436 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 95.8ms TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-10-04 18:49:13,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5762 states. [2021-10-04 18:49:13,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5762 to 5046. [2021-10-04 18:49:13,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5046 states, 5045 states have (on average 3.299108027750248) internal successors, (16644), 5045 states have internal predecessors, (16644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5046 states to 5046 states and 16644 transitions. [2021-10-04 18:49:13,690 INFO L78 Accepts]: Start accepts. Automaton has 5046 states and 16644 transitions. Word has length 38 [2021-10-04 18:49:13,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:13,690 INFO L470 AbstractCegarLoop]: Abstraction has 5046 states and 16644 transitions. [2021-10-04 18:49:13,691 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-04 18:49:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 5046 states and 16644 transitions. [2021-10-04 18:49:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:13,711 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:13,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-04 18:49:13,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-04 18:49:13,712 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-04 18:49:13,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:13,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1486048182, now seen corresponding path program 7 times [2021-10-04 18:49:13,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:13,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915743589] [2021-10-04 18:49:13,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:13,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:13,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-04 18:49:13,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:13,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915743589] [2021-10-04 18:49:13,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915743589] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:13,964 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:13,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:49:13,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951446754] [2021-10-04 18:49:13,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:49:13,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:13,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:49:13,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:49:13,968 INFO L87 Difference]: Start difference. First operand 5046 states and 16644 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-04 18:49:15,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:15,155 INFO L93 Difference]: Finished difference Result 5872 states and 17772 transitions. [2021-10-04 18:49:15,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-04 18:49:15,156 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:15,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:15,180 INFO L225 Difference]: With dead ends: 5872 [2021-10-04 18:49:15,180 INFO L226 Difference]: Without dead ends: 5070 [2021-10-04 18:49:15,181 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 408.0ms TimeCoverageRelationStatistics Valid=289, Invalid=1117, Unknown=0, NotChecked=0, Total=1406 [2021-10-04 18:49:15,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5070 states. [2021-10-04 18:49:15,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5070 to 4326. [2021-10-04 18:49:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4326 states, 4325 states have (on average 3.1035838150289017) internal successors, (13423), 4325 states have internal predecessors, (13423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4326 states to 4326 states and 13423 transitions. [2021-10-04 18:49:15,342 INFO L78 Accepts]: Start accepts. Automaton has 4326 states and 13423 transitions. Word has length 38 [2021-10-04 18:49:15,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:15,343 INFO L470 AbstractCegarLoop]: Abstraction has 4326 states and 13423 transitions. [2021-10-04 18:49:15,343 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-04 18:49:15,343 INFO L276 IsEmpty]: Start isEmpty. Operand 4326 states and 13423 transitions. [2021-10-04 18:49:15,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:15,357 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:15,358 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:15,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-04 18:49:15,358 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-04 18:49:15,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:15,359 INFO L82 PathProgramCache]: Analyzing trace with hash -458266770, now seen corresponding path program 8 times [2021-10-04 18:49:15,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:15,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734035030] [2021-10-04 18:49:15,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:15,360 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:15,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:15,538 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734035030] [2021-10-04 18:49:15,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734035030] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:15,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:15,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-04 18:49:15,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257671118] [2021-10-04 18:49:15,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-04 18:49:15,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:15,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-04 18:49:15,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-04 18:49:15,541 INFO L87 Difference]: Start difference. First operand 4326 states and 13423 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-04 18:49:15,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:15,650 INFO L93 Difference]: Finished difference Result 6625 states and 20441 transitions. [2021-10-04 18:49:15,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-04 18:49:15,650 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-04 18:49:15,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:15,669 INFO L225 Difference]: With dead ends: 6625 [2021-10-04 18:49:15,669 INFO L226 Difference]: Without dead ends: 3898 [2021-10-04 18:49:15,670 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.0ms TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-10-04 18:49:15,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3898 states. [2021-10-04 18:49:15,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3898 to 3804. [2021-10-04 18:49:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3804 states, 3803 states have (on average 3.0060478569550355) internal successors, (11432), 3803 states have internal predecessors, (11432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3804 states to 3804 states and 11432 transitions. [2021-10-04 18:49:15,807 INFO L78 Accepts]: Start accepts. Automaton has 3804 states and 11432 transitions. Word has length 38 [2021-10-04 18:49:15,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:15,808 INFO L470 AbstractCegarLoop]: Abstraction has 3804 states and 11432 transitions. [2021-10-04 18:49:15,808 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-04 18:49:15,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3804 states and 11432 transitions. [2021-10-04 18:49:15,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:15,823 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:15,824 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:15,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-04 18:49:15,824 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-04 18:49:15,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:15,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1995252922, now seen corresponding path program 9 times [2021-10-04 18:49:15,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:15,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810237715] [2021-10-04 18:49:15,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:15,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:15,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-04 18:49:15,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:15,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810237715] [2021-10-04 18:49:15,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810237715] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:15,933 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:15,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:49:15,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176455382] [2021-10-04 18:49:15,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:49:15,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:15,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:49:15,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:49:15,935 INFO L87 Difference]: Start difference. First operand 3804 states and 11432 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-04 18:49:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:16,224 INFO L93 Difference]: Finished difference Result 5154 states and 15312 transitions. [2021-10-04 18:49:16,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:49:16,225 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-04 18:49:16,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:16,252 INFO L225 Difference]: With dead ends: 5154 [2021-10-04 18:49:16,252 INFO L226 Difference]: Without dead ends: 5108 [2021-10-04 18:49:16,253 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 59.5ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:49:16,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5108 states. [2021-10-04 18:49:16,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5108 to 4056. [2021-10-04 18:49:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4056 states, 4055 states have (on average 2.9948212083847103) internal successors, (12144), 4055 states have internal predecessors, (12144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:16,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 12144 transitions. [2021-10-04 18:49:16,402 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 12144 transitions. Word has length 38 [2021-10-04 18:49:16,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:16,403 INFO L470 AbstractCegarLoop]: Abstraction has 4056 states and 12144 transitions. [2021-10-04 18:49:16,403 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-04 18:49:16,403 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 12144 transitions. [2021-10-04 18:49:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:16,416 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:16,416 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:16,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-04 18:49:16,417 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-04 18:49:16,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:16,418 INFO L82 PathProgramCache]: Analyzing trace with hash 892392716, now seen corresponding path program 10 times [2021-10-04 18:49:16,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:16,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222882134] [2021-10-04 18:49:16,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:16,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:16,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-04 18:49:16,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:16,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222882134] [2021-10-04 18:49:16,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222882134] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:16,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:16,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:49:16,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265433641] [2021-10-04 18:49:16,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:49:16,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:16,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:49:16,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:49:16,534 INFO L87 Difference]: Start difference. First operand 4056 states and 12144 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-04 18:49:16,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:16,893 INFO L93 Difference]: Finished difference Result 5384 states and 15906 transitions. [2021-10-04 18:49:16,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:49:16,894 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-04 18:49:16,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:16,918 INFO L225 Difference]: With dead ends: 5384 [2021-10-04 18:49:16,919 INFO L226 Difference]: Without dead ends: 5280 [2021-10-04 18:49:16,919 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 78.3ms TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2021-10-04 18:49:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5280 states. [2021-10-04 18:49:17,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5280 to 4096. [2021-10-04 18:49:17,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4096 states, 4095 states have (on average 2.9973137973137973) internal successors, (12274), 4095 states have internal predecessors, (12274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:17,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4096 states to 4096 states and 12274 transitions. [2021-10-04 18:49:17,108 INFO L78 Accepts]: Start accepts. Automaton has 4096 states and 12274 transitions. Word has length 38 [2021-10-04 18:49:17,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:17,109 INFO L470 AbstractCegarLoop]: Abstraction has 4096 states and 12274 transitions. [2021-10-04 18:49:17,109 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-04 18:49:17,109 INFO L276 IsEmpty]: Start isEmpty. Operand 4096 states and 12274 transitions. [2021-10-04 18:49:17,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:17,121 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:17,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-04 18:49:17,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-04 18:49:17,121 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-04 18:49:17,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:17,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1521739592, now seen corresponding path program 11 times [2021-10-04 18:49:17,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:17,123 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794625939] [2021-10-04 18:49:17,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:17,123 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:17,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:17,224 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794625939] [2021-10-04 18:49:17,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794625939] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:17,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:17,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:49:17,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411970294] [2021-10-04 18:49:17,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:49:17,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:17,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:49:17,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:49:17,227 INFO L87 Difference]: Start difference. First operand 4096 states and 12274 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-04 18:49:17,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:17,547 INFO L93 Difference]: Finished difference Result 5248 states and 15429 transitions. [2021-10-04 18:49:17,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:49:17,547 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-04 18:49:17,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:17,567 INFO L225 Difference]: With dead ends: 5248 [2021-10-04 18:49:17,567 INFO L226 Difference]: Without dead ends: 5026 [2021-10-04 18:49:17,568 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 70.3ms TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2021-10-04 18:49:17,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5026 states. [2021-10-04 18:49:17,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5026 to 4124. [2021-10-04 18:49:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4124 states, 4123 states have (on average 2.9970894979383944) internal successors, (12357), 4123 states have internal predecessors, (12357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:17,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4124 states to 4124 states and 12357 transitions. [2021-10-04 18:49:17,687 INFO L78 Accepts]: Start accepts. Automaton has 4124 states and 12357 transitions. Word has length 38 [2021-10-04 18:49:17,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:17,688 INFO L470 AbstractCegarLoop]: Abstraction has 4124 states and 12357 transitions. [2021-10-04 18:49:17,688 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-04 18:49:17,688 INFO L276 IsEmpty]: Start isEmpty. Operand 4124 states and 12357 transitions. [2021-10-04 18:49:17,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:17,700 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:17,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-04 18:49:17,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-04 18:49:17,700 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-04 18:49:17,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:17,701 INFO L82 PathProgramCache]: Analyzing trace with hash 2122509814, now seen corresponding path program 12 times [2021-10-04 18:49:17,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:17,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677741668] [2021-10-04 18:49:17,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:17,702 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:17,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-04 18:49:17,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:17,823 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677741668] [2021-10-04 18:49:17,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677741668] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:17,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:17,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-04 18:49:17,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470935487] [2021-10-04 18:49:17,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-04 18:49:17,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:17,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-04 18:49:17,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:49:17,826 INFO L87 Difference]: Start difference. First operand 4124 states and 12357 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-04 18:49:18,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:18,020 INFO L93 Difference]: Finished difference Result 3478 states and 10304 transitions. [2021-10-04 18:49:18,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-04 18:49:18,022 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-04 18:49:18,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:18,034 INFO L225 Difference]: With dead ends: 3478 [2021-10-04 18:49:18,035 INFO L226 Difference]: Without dead ends: 3264 [2021-10-04 18:49:18,035 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 72.1ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:18,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2021-10-04 18:49:18,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 3238. [2021-10-04 18:49:18,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3238 states, 3237 states have (on average 2.9966017917825147) internal successors, (9700), 3237 states have internal predecessors, (9700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:18,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3238 states to 3238 states and 9700 transitions. [2021-10-04 18:49:18,120 INFO L78 Accepts]: Start accepts. Automaton has 3238 states and 9700 transitions. Word has length 38 [2021-10-04 18:49:18,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:18,121 INFO L470 AbstractCegarLoop]: Abstraction has 3238 states and 9700 transitions. [2021-10-04 18:49:18,121 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-04 18:49:18,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3238 states and 9700 transitions. [2021-10-04 18:49:18,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:18,130 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:18,130 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:18,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-04 18:49:18,131 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-04 18:49:18,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:18,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1382464902, now seen corresponding path program 13 times [2021-10-04 18:49:18,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:18,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372570551] [2021-10-04 18:49:18,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:18,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:18,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:18,232 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372570551] [2021-10-04 18:49:18,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372570551] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:18,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:18,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:49:18,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929646707] [2021-10-04 18:49:18,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:49:18,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:18,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:49:18,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:49:18,236 INFO L87 Difference]: Start difference. First operand 3238 states and 9700 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-04 18:49:18,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:18,454 INFO L93 Difference]: Finished difference Result 3306 states and 9846 transitions. [2021-10-04 18:49:18,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-04 18:49:18,455 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-04 18:49:18,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:18,466 INFO L225 Difference]: With dead ends: 3306 [2021-10-04 18:49:18,466 INFO L226 Difference]: Without dead ends: 3288 [2021-10-04 18:49:18,468 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 71.4ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:49:18,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2021-10-04 18:49:18,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 3240. [2021-10-04 18:49:18,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3240 states, 3239 states have (on average 2.9953689410311823) internal successors, (9702), 3239 states have internal predecessors, (9702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3240 states to 3240 states and 9702 transitions. [2021-10-04 18:49:18,549 INFO L78 Accepts]: Start accepts. Automaton has 3240 states and 9702 transitions. Word has length 38 [2021-10-04 18:49:18,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:18,550 INFO L470 AbstractCegarLoop]: Abstraction has 3240 states and 9702 transitions. [2021-10-04 18:49:18,550 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-04 18:49:18,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3240 states and 9702 transitions. [2021-10-04 18:49:18,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:18,563 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:18,563 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:18,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-04 18:49:18,564 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-04 18:49:18,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:18,564 INFO L82 PathProgramCache]: Analyzing trace with hash -121459530, now seen corresponding path program 14 times [2021-10-04 18:49:18,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:18,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783818583] [2021-10-04 18:49:18,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:18,565 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:18,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-04 18:49:18,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:18,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783818583] [2021-10-04 18:49:18,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783818583] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:18,698 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:18,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:49:18,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439559548] [2021-10-04 18:49:18,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:49:18,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:18,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:49:18,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:49:18,701 INFO L87 Difference]: Start difference. First operand 3240 states and 9702 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-04 18:49:19,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:19,037 INFO L93 Difference]: Finished difference Result 3776 states and 11168 transitions. [2021-10-04 18:49:19,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:49:19,037 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-04 18:49:19,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:19,050 INFO L225 Difference]: With dead ends: 3776 [2021-10-04 18:49:19,050 INFO L226 Difference]: Without dead ends: 3700 [2021-10-04 18:49:19,056 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 121.2ms TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2021-10-04 18:49:19,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3700 states. [2021-10-04 18:49:19,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3700 to 3240. [2021-10-04 18:49:19,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3240 states, 3239 states have (on average 2.9953689410311823) internal successors, (9702), 3239 states have internal predecessors, (9702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:19,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3240 states to 3240 states and 9702 transitions. [2021-10-04 18:49:19,143 INFO L78 Accepts]: Start accepts. Automaton has 3240 states and 9702 transitions. Word has length 38 [2021-10-04 18:49:19,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:19,144 INFO L470 AbstractCegarLoop]: Abstraction has 3240 states and 9702 transitions. [2021-10-04 18:49:19,144 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-04 18:49:19,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3240 states and 9702 transitions. [2021-10-04 18:49:19,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:19,152 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:19,152 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:19,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-04 18:49:19,153 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-04 18:49:19,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:19,153 INFO L82 PathProgramCache]: Analyzing trace with hash -302769656, now seen corresponding path program 15 times [2021-10-04 18:49:19,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:19,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208928972] [2021-10-04 18:49:19,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:19,154 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:19,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:19,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208928972] [2021-10-04 18:49:19,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208928972] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:19,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:19,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:49:19,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377793704] [2021-10-04 18:49:19,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:49:19,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:19,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:49:19,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:49:19,255 INFO L87 Difference]: Start difference. First operand 3240 states and 9702 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-04 18:49:19,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:19,500 INFO L93 Difference]: Finished difference Result 3442 states and 10177 transitions. [2021-10-04 18:49:19,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:49:19,500 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-04 18:49:19,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:19,513 INFO L225 Difference]: With dead ends: 3442 [2021-10-04 18:49:19,514 INFO L226 Difference]: Without dead ends: 3326 [2021-10-04 18:49:19,514 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 76.8ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-10-04 18:49:19,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2021-10-04 18:49:19,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 3234. [2021-10-04 18:49:19,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3234 states, 3233 states have (on average 2.9959789669038046) internal successors, (9686), 3233 states have internal predecessors, (9686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 9686 transitions. [2021-10-04 18:49:19,599 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 9686 transitions. Word has length 38 [2021-10-04 18:49:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:19,600 INFO L470 AbstractCegarLoop]: Abstraction has 3234 states and 9686 transitions. [2021-10-04 18:49:19,600 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-04 18:49:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 9686 transitions. [2021-10-04 18:49:19,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:19,607 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:19,607 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:19,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-04 18:49:19,608 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-04 18:49:19,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:19,609 INFO L82 PathProgramCache]: Analyzing trace with hash -167685584, now seen corresponding path program 16 times [2021-10-04 18:49:19,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:19,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147309908] [2021-10-04 18:49:19,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:19,609 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:19,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:19,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:19,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147309908] [2021-10-04 18:49:19,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147309908] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:19,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:19,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:49:19,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979240179] [2021-10-04 18:49:19,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:49:19,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:19,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:49:19,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:49:19,699 INFO L87 Difference]: Start difference. First operand 3234 states and 9686 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-04 18:49:19,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:19,875 INFO L93 Difference]: Finished difference Result 3316 states and 9861 transitions. [2021-10-04 18:49:19,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-04 18:49:19,876 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-04 18:49:19,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:19,887 INFO L225 Difference]: With dead ends: 3316 [2021-10-04 18:49:19,887 INFO L226 Difference]: Without dead ends: 3264 [2021-10-04 18:49:19,888 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 53.5ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2021-10-04 18:49:19,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 3210. [2021-10-04 18:49:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3210 states, 3209 states have (on average 2.9965721408538486) internal successors, (9616), 3209 states have internal predecessors, (9616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3210 states to 3210 states and 9616 transitions. [2021-10-04 18:49:20,000 INFO L78 Accepts]: Start accepts. Automaton has 3210 states and 9616 transitions. Word has length 38 [2021-10-04 18:49:20,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:20,000 INFO L470 AbstractCegarLoop]: Abstraction has 3210 states and 9616 transitions. [2021-10-04 18:49:20,001 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-04 18:49:20,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3210 states and 9616 transitions. [2021-10-04 18:49:20,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:20,008 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:20,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-04 18:49:20,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-04 18:49:20,009 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-04 18:49:20,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:20,009 INFO L82 PathProgramCache]: Analyzing trace with hash 169066414, now seen corresponding path program 17 times [2021-10-04 18:49:20,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:20,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502669100] [2021-10-04 18:49:20,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:20,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:20,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:20,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502669100] [2021-10-04 18:49:20,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502669100] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:20,095 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:20,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-04 18:49:20,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991121436] [2021-10-04 18:49:20,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-04 18:49:20,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:20,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-04 18:49:20,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:49:20,099 INFO L87 Difference]: Start difference. First operand 3210 states and 9616 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-04 18:49:20,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:20,316 INFO L93 Difference]: Finished difference Result 3818 states and 11374 transitions. [2021-10-04 18:49:20,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-04 18:49:20,317 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-04 18:49:20,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:20,335 INFO L225 Difference]: With dead ends: 3818 [2021-10-04 18:49:20,336 INFO L226 Difference]: Without dead ends: 3818 [2021-10-04 18:49:20,336 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 68.1ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-10-04 18:49:20,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3818 states. [2021-10-04 18:49:20,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3818 to 3228. [2021-10-04 18:49:20,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3228 states, 3227 states have (on average 2.994731949178804) internal successors, (9664), 3227 states have internal predecessors, (9664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3228 states to 3228 states and 9664 transitions. [2021-10-04 18:49:20,424 INFO L78 Accepts]: Start accepts. Automaton has 3228 states and 9664 transitions. Word has length 38 [2021-10-04 18:49:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:20,425 INFO L470 AbstractCegarLoop]: Abstraction has 3228 states and 9664 transitions. [2021-10-04 18:49:20,425 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-04 18:49:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3228 states and 9664 transitions. [2021-10-04 18:49:20,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:20,432 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:20,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-04 18:49:20,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-04 18:49:20,433 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-04 18:49:20,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:20,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1238255244, now seen corresponding path program 18 times [2021-10-04 18:49:20,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:20,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294223319] [2021-10-04 18:49:20,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:20,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:20,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-04 18:49:20,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:20,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294223319] [2021-10-04 18:49:20,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294223319] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:20,557 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:20,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:49:20,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978069306] [2021-10-04 18:49:20,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:49:20,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:20,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:49:20,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:49:20,559 INFO L87 Difference]: Start difference. First operand 3228 states and 9664 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-04 18:49:20,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:20,876 INFO L93 Difference]: Finished difference Result 4072 states and 12120 transitions. [2021-10-04 18:49:20,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:49:20,877 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-04 18:49:20,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:20,899 INFO L225 Difference]: With dead ends: 4072 [2021-10-04 18:49:20,899 INFO L226 Difference]: Without dead ends: 3994 [2021-10-04 18:49:20,900 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 107.9ms TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-10-04 18:49:20,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2021-10-04 18:49:20,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3230. [2021-10-04 18:49:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3230 states, 3229 states have (on average 2.9956642923505727) internal successors, (9673), 3229 states have internal predecessors, (9673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:20,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 9673 transitions. [2021-10-04 18:49:20,989 INFO L78 Accepts]: Start accepts. Automaton has 3230 states and 9673 transitions. Word has length 38 [2021-10-04 18:49:20,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:20,992 INFO L470 AbstractCegarLoop]: Abstraction has 3230 states and 9673 transitions. [2021-10-04 18:49:20,992 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-04 18:49:20,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 9673 transitions. [2021-10-04 18:49:21,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:21,003 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:21,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-04 18:49:21,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-04 18:49:21,004 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-04 18:49:21,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:21,005 INFO L82 PathProgramCache]: Analyzing trace with hash 642579744, now seen corresponding path program 19 times [2021-10-04 18:49:21,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:21,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273538649] [2021-10-04 18:49:21,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:21,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:21,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:21,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273538649] [2021-10-04 18:49:21,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273538649] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:21,133 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:21,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:49:21,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80330041] [2021-10-04 18:49:21,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:49:21,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:21,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:49:21,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:49:21,136 INFO L87 Difference]: Start difference. First operand 3230 states and 9673 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-04 18:49:21,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:21,401 INFO L93 Difference]: Finished difference Result 3846 states and 11397 transitions. [2021-10-04 18:49:21,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:49:21,402 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-04 18:49:21,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:21,412 INFO L225 Difference]: With dead ends: 3846 [2021-10-04 18:49:21,412 INFO L226 Difference]: Without dead ends: 3728 [2021-10-04 18:49:21,413 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 84.4ms TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-10-04 18:49:21,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3728 states. [2021-10-04 18:49:21,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3728 to 3210. [2021-10-04 18:49:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3210 states, 3209 states have (on average 2.9953256466188845) internal successors, (9612), 3209 states have internal predecessors, (9612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3210 states to 3210 states and 9612 transitions. [2021-10-04 18:49:21,502 INFO L78 Accepts]: Start accepts. Automaton has 3210 states and 9612 transitions. Word has length 38 [2021-10-04 18:49:21,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:21,503 INFO L470 AbstractCegarLoop]: Abstraction has 3210 states and 9612 transitions. [2021-10-04 18:49:21,503 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-04 18:49:21,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3210 states and 9612 transitions. [2021-10-04 18:49:21,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:21,513 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:21,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-04 18:49:21,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-04 18:49:21,513 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-04 18:49:21,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:21,514 INFO L82 PathProgramCache]: Analyzing trace with hash -748183058, now seen corresponding path program 20 times [2021-10-04 18:49:21,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:21,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542679999] [2021-10-04 18:49:21,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:21,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:21,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-04 18:49:21,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:21,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542679999] [2021-10-04 18:49:21,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542679999] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:21,610 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:21,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:49:21,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233064975] [2021-10-04 18:49:21,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:49:21,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:21,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:49:21,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:49:21,612 INFO L87 Difference]: Start difference. First operand 3210 states and 9612 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-04 18:49:21,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:21,839 INFO L93 Difference]: Finished difference Result 3720 states and 11042 transitions. [2021-10-04 18:49:21,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:49:21,840 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-04 18:49:21,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:21,849 INFO L225 Difference]: With dead ends: 3720 [2021-10-04 18:49:21,850 INFO L226 Difference]: Without dead ends: 3708 [2021-10-04 18:49:21,850 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 86.6ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-10-04 18:49:21,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3708 states. [2021-10-04 18:49:21,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3708 to 3204. [2021-10-04 18:49:21,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3204 states, 3203 states have (on average 2.9950046831095847) internal successors, (9593), 3203 states have internal predecessors, (9593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:21,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 9593 transitions. [2021-10-04 18:49:21,932 INFO L78 Accepts]: Start accepts. Automaton has 3204 states and 9593 transitions. Word has length 38 [2021-10-04 18:49:21,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:21,932 INFO L470 AbstractCegarLoop]: Abstraction has 3204 states and 9593 transitions. [2021-10-04 18:49:21,933 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-04 18:49:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 9593 transitions. [2021-10-04 18:49:21,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:21,940 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:21,940 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:21,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-04 18:49:21,941 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-04 18:49:21,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:21,942 INFO L82 PathProgramCache]: Analyzing trace with hash 2042859806, now seen corresponding path program 21 times [2021-10-04 18:49:21,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:21,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556476491] [2021-10-04 18:49:21,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:21,942 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:22,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:22,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:22,044 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556476491] [2021-10-04 18:49:22,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556476491] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:22,045 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:22,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:49:22,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576481114] [2021-10-04 18:49:22,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:49:22,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:22,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:49:22,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:49:22,047 INFO L87 Difference]: Start difference. First operand 3204 states and 9593 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-04 18:49:22,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:22,305 INFO L93 Difference]: Finished difference Result 3732 states and 11075 transitions. [2021-10-04 18:49:22,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:49:22,306 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-04 18:49:22,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:22,317 INFO L225 Difference]: With dead ends: 3732 [2021-10-04 18:49:22,317 INFO L226 Difference]: Without dead ends: 3656 [2021-10-04 18:49:22,317 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 88.7ms TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-10-04 18:49:22,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2021-10-04 18:49:22,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 3200. [2021-10-04 18:49:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3200 states, 3199 states have (on average 2.9956236323851204) internal successors, (9583), 3199 states have internal predecessors, (9583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:22,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3200 states to 3200 states and 9583 transitions. [2021-10-04 18:49:22,405 INFO L78 Accepts]: Start accepts. Automaton has 3200 states and 9583 transitions. Word has length 38 [2021-10-04 18:49:22,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:22,406 INFO L470 AbstractCegarLoop]: Abstraction has 3200 states and 9583 transitions. [2021-10-04 18:49:22,406 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-04 18:49:22,406 INFO L276 IsEmpty]: Start isEmpty. Operand 3200 states and 9583 transitions. [2021-10-04 18:49:22,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:22,415 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:22,415 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:22,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-04 18:49:22,416 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-04 18:49:22,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:22,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1861549680, now seen corresponding path program 22 times [2021-10-04 18:49:22,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:22,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019900371] [2021-10-04 18:49:22,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:22,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:22,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:22,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019900371] [2021-10-04 18:49:22,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019900371] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:22,507 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:22,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:49:22,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812924813] [2021-10-04 18:49:22,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:49:22,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:22,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:49:22,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:49:22,509 INFO L87 Difference]: Start difference. First operand 3200 states and 9583 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-04 18:49:22,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:22,787 INFO L93 Difference]: Finished difference Result 3640 states and 10725 transitions. [2021-10-04 18:49:22,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:49:22,787 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-04 18:49:22,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:22,796 INFO L225 Difference]: With dead ends: 3640 [2021-10-04 18:49:22,797 INFO L226 Difference]: Without dead ends: 3524 [2021-10-04 18:49:22,797 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 101.9ms TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2021-10-04 18:49:22,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3524 states. [2021-10-04 18:49:22,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3524 to 3190. [2021-10-04 18:49:22,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3190 states, 3189 states have (on average 2.9968642207588587) internal successors, (9557), 3189 states have internal predecessors, (9557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:22,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 9557 transitions. [2021-10-04 18:49:22,874 INFO L78 Accepts]: Start accepts. Automaton has 3190 states and 9557 transitions. Word has length 38 [2021-10-04 18:49:22,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:22,875 INFO L470 AbstractCegarLoop]: Abstraction has 3190 states and 9557 transitions. [2021-10-04 18:49:22,875 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-04 18:49:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3190 states and 9557 transitions. [2021-10-04 18:49:22,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:22,927 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:22,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-04 18:49:22,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-04 18:49:22,928 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-04 18:49:22,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:22,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1636609228, now seen corresponding path program 23 times [2021-10-04 18:49:22,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:22,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523919245] [2021-10-04 18:49:22,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:22,929 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:23,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-04 18:49:23,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:23,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523919245] [2021-10-04 18:49:23,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523919245] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:23,002 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:23,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-04 18:49:23,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91988941] [2021-10-04 18:49:23,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-04 18:49:23,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:23,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-04 18:49:23,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:49:23,004 INFO L87 Difference]: Start difference. First operand 3190 states and 9557 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-04 18:49:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:23,187 INFO L93 Difference]: Finished difference Result 3472 states and 10294 transitions. [2021-10-04 18:49:23,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-04 18:49:23,187 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-04 18:49:23,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:23,195 INFO L225 Difference]: With dead ends: 3472 [2021-10-04 18:49:23,196 INFO L226 Difference]: Without dead ends: 3472 [2021-10-04 18:49:23,196 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 49.7ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:23,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2021-10-04 18:49:23,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3108. [2021-10-04 18:49:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3108 states, 3107 states have (on average 2.9932410685548763) internal successors, (9300), 3107 states have internal predecessors, (9300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:23,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 9300 transitions. [2021-10-04 18:49:23,276 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 9300 transitions. Word has length 38 [2021-10-04 18:49:23,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:23,277 INFO L470 AbstractCegarLoop]: Abstraction has 3108 states and 9300 transitions. [2021-10-04 18:49:23,277 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-04 18:49:23,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 9300 transitions. [2021-10-04 18:49:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:23,285 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:23,285 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:23,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-04 18:49:23,286 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-04 18:49:23,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:23,287 INFO L82 PathProgramCache]: Analyzing trace with hash 229287570, now seen corresponding path program 24 times [2021-10-04 18:49:23,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:23,287 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540852043] [2021-10-04 18:49:23,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:23,287 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:23,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:23,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540852043] [2021-10-04 18:49:23,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540852043] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:23,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:23,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:49:23,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282839988] [2021-10-04 18:49:23,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:49:23,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:23,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:49:23,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:49:23,379 INFO L87 Difference]: Start difference. First operand 3108 states and 9300 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-04 18:49:23,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:23,677 INFO L93 Difference]: Finished difference Result 3660 states and 10767 transitions. [2021-10-04 18:49:23,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:49:23,678 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-04 18:49:23,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:23,684 INFO L225 Difference]: With dead ends: 3660 [2021-10-04 18:49:23,684 INFO L226 Difference]: Without dead ends: 3582 [2021-10-04 18:49:23,685 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 101.3ms TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-10-04 18:49:23,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3582 states. [2021-10-04 18:49:23,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3582 to 3066. [2021-10-04 18:49:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3066 states, 3065 states have (on average 2.9895595432300164) internal successors, (9163), 3065 states have internal predecessors, (9163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 9163 transitions. [2021-10-04 18:49:23,760 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 9163 transitions. Word has length 38 [2021-10-04 18:49:23,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:23,760 INFO L470 AbstractCegarLoop]: Abstraction has 3066 states and 9163 transitions. [2021-10-04 18:49:23,761 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-04 18:49:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 9163 transitions. [2021-10-04 18:49:23,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:23,768 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:23,768 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:23,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-04 18:49:23,769 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-04 18:49:23,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:23,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2110122558, now seen corresponding path program 25 times [2021-10-04 18:49:23,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:23,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395015428] [2021-10-04 18:49:23,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:23,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:23,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:23,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395015428] [2021-10-04 18:49:23,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395015428] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:23,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:23,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:49:23,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699772206] [2021-10-04 18:49:23,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:49:23,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:23,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:49:23,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:49:23,855 INFO L87 Difference]: Start difference. First operand 3066 states and 9163 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-04 18:49:24,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:24,074 INFO L93 Difference]: Finished difference Result 3296 states and 9659 transitions. [2021-10-04 18:49:24,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:49:24,075 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-04 18:49:24,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:24,082 INFO L225 Difference]: With dead ends: 3296 [2021-10-04 18:49:24,082 INFO L226 Difference]: Without dead ends: 3178 [2021-10-04 18:49:24,082 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 60.7ms TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-10-04 18:49:24,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2021-10-04 18:49:24,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 2878. [2021-10-04 18:49:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2878 states, 2877 states have (on average 2.9760166840458813) internal successors, (8562), 2877 states have internal predecessors, (8562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:24,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 8562 transitions. [2021-10-04 18:49:24,140 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 8562 transitions. Word has length 38 [2021-10-04 18:49:24,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:24,140 INFO L470 AbstractCegarLoop]: Abstraction has 2878 states and 8562 transitions. [2021-10-04 18:49:24,141 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-04 18:49:24,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 8562 transitions. [2021-10-04 18:49:24,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:24,147 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:24,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-04 18:49:24,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-04 18:49:24,148 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-04 18:49:24,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:24,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1674672750, now seen corresponding path program 26 times [2021-10-04 18:49:24,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:24,149 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857282755] [2021-10-04 18:49:24,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:24,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:24,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:24,232 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857282755] [2021-10-04 18:49:24,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857282755] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:24,232 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:24,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:49:24,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903969559] [2021-10-04 18:49:24,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:49:24,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:24,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:49:24,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:49:24,234 INFO L87 Difference]: Start difference. First operand 2878 states and 8562 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-04 18:49:24,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:24,496 INFO L93 Difference]: Finished difference Result 2222 states and 6127 transitions. [2021-10-04 18:49:24,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:49:24,497 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-04 18:49:24,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:24,502 INFO L225 Difference]: With dead ends: 2222 [2021-10-04 18:49:24,502 INFO L226 Difference]: Without dead ends: 1948 [2021-10-04 18:49:24,503 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 60.4ms TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-10-04 18:49:24,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2021-10-04 18:49:24,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1764. [2021-10-04 18:49:24,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 2.770845150311968) internal successors, (4885), 1763 states have internal predecessors, (4885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:24,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 4885 transitions. [2021-10-04 18:49:24,541 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 4885 transitions. Word has length 38 [2021-10-04 18:49:24,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:24,542 INFO L470 AbstractCegarLoop]: Abstraction has 1764 states and 4885 transitions. [2021-10-04 18:49:24,542 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-04 18:49:24,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 4885 transitions. [2021-10-04 18:49:24,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:24,546 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:24,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-04 18:49:24,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-04 18:49:24,547 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-04 18:49:24,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:24,547 INFO L82 PathProgramCache]: Analyzing trace with hash 829731678, now seen corresponding path program 27 times [2021-10-04 18:49:24,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:24,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174142306] [2021-10-04 18:49:24,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:24,548 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:24,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:24,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174142306] [2021-10-04 18:49:24,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174142306] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:24,663 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:24,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:24,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040262593] [2021-10-04 18:49:24,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:24,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:24,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:24,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:24,665 INFO L87 Difference]: Start difference. First operand 1764 states and 4885 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:25,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:25,128 INFO L93 Difference]: Finished difference Result 2218 states and 6017 transitions. [2021-10-04 18:49:25,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-04 18:49:25,129 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:25,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:25,132 INFO L225 Difference]: With dead ends: 2218 [2021-10-04 18:49:25,133 INFO L226 Difference]: Without dead ends: 2122 [2021-10-04 18:49:25,133 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 168.2ms TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:49:25,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2021-10-04 18:49:25,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1838. [2021-10-04 18:49:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 2.7468698965704954) internal successors, (5046), 1837 states have internal predecessors, (5046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:25,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 5046 transitions. [2021-10-04 18:49:25,172 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 5046 transitions. Word has length 38 [2021-10-04 18:49:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:25,172 INFO L470 AbstractCegarLoop]: Abstraction has 1838 states and 5046 transitions. [2021-10-04 18:49:25,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 5046 transitions. [2021-10-04 18:49:25,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:25,176 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:25,176 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:25,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-04 18:49:25,177 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-04 18:49:25,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:25,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1701777522, now seen corresponding path program 28 times [2021-10-04 18:49:25,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:25,178 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097987438] [2021-10-04 18:49:25,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:25,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:25,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:25,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:25,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097987438] [2021-10-04 18:49:25,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097987438] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:25,278 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:25,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:49:25,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385300226] [2021-10-04 18:49:25,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:49:25,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:25,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:49:25,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:49:25,280 INFO L87 Difference]: Start difference. First operand 1838 states and 5046 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-04 18:49:25,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:25,851 INFO L93 Difference]: Finished difference Result 3080 states and 8415 transitions. [2021-10-04 18:49:25,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-04 18:49:25,851 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-04 18:49:25,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:25,858 INFO L225 Difference]: With dead ends: 3080 [2021-10-04 18:49:25,858 INFO L226 Difference]: Without dead ends: 2972 [2021-10-04 18:49:25,860 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 202.1ms TimeCoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2021-10-04 18:49:25,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2021-10-04 18:49:25,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 1898. [2021-10-04 18:49:25,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1897 states have (on average 2.7601476014760147) internal successors, (5236), 1897 states have internal predecessors, (5236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:25,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 5236 transitions. [2021-10-04 18:49:25,906 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 5236 transitions. Word has length 38 [2021-10-04 18:49:25,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:25,907 INFO L470 AbstractCegarLoop]: Abstraction has 1898 states and 5236 transitions. [2021-10-04 18:49:25,907 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-04 18:49:25,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 5236 transitions. [2021-10-04 18:49:25,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:25,913 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:25,913 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:25,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-04 18:49:25,913 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-04 18:49:25,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:25,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1747792828, now seen corresponding path program 29 times [2021-10-04 18:49:25,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:25,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057298602] [2021-10-04 18:49:25,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:25,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:26,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:26,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057298602] [2021-10-04 18:49:26,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057298602] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:26,055 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:26,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:26,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225997043] [2021-10-04 18:49:26,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:26,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:26,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:26,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:26,057 INFO L87 Difference]: Start difference. First operand 1898 states and 5236 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:26,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:26,778 INFO L93 Difference]: Finished difference Result 3204 states and 8729 transitions. [2021-10-04 18:49:26,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-10-04 18:49:26,779 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:26,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:26,784 INFO L225 Difference]: With dead ends: 3204 [2021-10-04 18:49:26,784 INFO L226 Difference]: Without dead ends: 3056 [2021-10-04 18:49:26,786 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 269.9ms TimeCoverageRelationStatistics Valid=220, Invalid=836, Unknown=0, NotChecked=0, Total=1056 [2021-10-04 18:49:26,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3056 states. [2021-10-04 18:49:26,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3056 to 1890. [2021-10-04 18:49:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1889 states have (on average 2.7623080995235574) internal successors, (5218), 1889 states have internal predecessors, (5218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:26,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 5218 transitions. [2021-10-04 18:49:26,852 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 5218 transitions. Word has length 38 [2021-10-04 18:49:26,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:26,853 INFO L470 AbstractCegarLoop]: Abstraction has 1890 states and 5218 transitions. [2021-10-04 18:49:26,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:26,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 5218 transitions. [2021-10-04 18:49:26,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:26,856 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:26,856 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:26,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-04 18:49:26,857 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-04 18:49:26,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:26,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2103062348, now seen corresponding path program 30 times [2021-10-04 18:49:26,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:26,858 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612937789] [2021-10-04 18:49:26,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:26,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:26,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:26,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612937789] [2021-10-04 18:49:26,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612937789] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:26,983 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:26,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:26,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120775673] [2021-10-04 18:49:26,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:26,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:26,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:26,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:26,985 INFO L87 Difference]: Start difference. First operand 1890 states and 5218 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:27,418 INFO L93 Difference]: Finished difference Result 2350 states and 6348 transitions. [2021-10-04 18:49:27,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:49:27,418 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:27,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:27,424 INFO L225 Difference]: With dead ends: 2350 [2021-10-04 18:49:27,424 INFO L226 Difference]: Without dead ends: 2274 [2021-10-04 18:49:27,425 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 144.5ms TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:49:27,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2021-10-04 18:49:27,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 1964. [2021-10-04 18:49:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1964 states, 1963 states have (on average 2.7361181864493123) internal successors, (5371), 1963 states have internal predecessors, (5371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 5371 transitions. [2021-10-04 18:49:27,478 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 5371 transitions. Word has length 38 [2021-10-04 18:49:27,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:27,479 INFO L470 AbstractCegarLoop]: Abstraction has 1964 states and 5371 transitions. [2021-10-04 18:49:27,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 5371 transitions. [2021-10-04 18:49:27,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:27,484 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:27,484 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:27,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-04 18:49:27,485 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-04 18:49:27,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:27,485 INFO L82 PathProgramCache]: Analyzing trace with hash 622773290, now seen corresponding path program 31 times [2021-10-04 18:49:27,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:27,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127094437] [2021-10-04 18:49:27,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:27,486 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:27,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-04 18:49:27,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:27,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127094437] [2021-10-04 18:49:27,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127094437] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:27,609 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:27,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:27,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310037046] [2021-10-04 18:49:27,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:27,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:27,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:27,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:27,612 INFO L87 Difference]: Start difference. First operand 1964 states and 5371 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:28,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:28,315 INFO L93 Difference]: Finished difference Result 2852 states and 7572 transitions. [2021-10-04 18:49:28,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-04 18:49:28,320 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:28,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:28,327 INFO L225 Difference]: With dead ends: 2852 [2021-10-04 18:49:28,327 INFO L226 Difference]: Without dead ends: 2708 [2021-10-04 18:49:28,328 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 264.4ms TimeCoverageRelationStatistics Valid=214, Invalid=778, Unknown=0, NotChecked=0, Total=992 [2021-10-04 18:49:28,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2021-10-04 18:49:28,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 1992. [2021-10-04 18:49:28,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1992 states, 1991 states have (on average 2.74585635359116) internal successors, (5467), 1991 states have internal predecessors, (5467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:28,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 5467 transitions. [2021-10-04 18:49:28,383 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 5467 transitions. Word has length 38 [2021-10-04 18:49:28,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:28,384 INFO L470 AbstractCegarLoop]: Abstraction has 1992 states and 5467 transitions. [2021-10-04 18:49:28,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:28,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 5467 transitions. [2021-10-04 18:49:28,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:28,389 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:28,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-04 18:49:28,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-04 18:49:28,390 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-04 18:49:28,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:28,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1462750110, now seen corresponding path program 32 times [2021-10-04 18:49:28,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:28,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765277960] [2021-10-04 18:49:28,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:28,391 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:28,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-04 18:49:28,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:28,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765277960] [2021-10-04 18:49:28,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765277960] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:28,506 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:28,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:49:28,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668348029] [2021-10-04 18:49:28,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:49:28,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:28,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:49:28,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:49:28,508 INFO L87 Difference]: Start difference. First operand 1992 states and 5467 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-04 18:49:29,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:29,053 INFO L93 Difference]: Finished difference Result 2896 states and 7633 transitions. [2021-10-04 18:49:29,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-04 18:49:29,054 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-04 18:49:29,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:29,059 INFO L225 Difference]: With dead ends: 2896 [2021-10-04 18:49:29,059 INFO L226 Difference]: Without dead ends: 2788 [2021-10-04 18:49:29,060 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 164.3ms TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2021-10-04 18:49:29,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2021-10-04 18:49:29,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 1960. [2021-10-04 18:49:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1960 states, 1959 states have (on average 2.731495661051557) internal successors, (5351), 1959 states have internal predecessors, (5351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:29,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 5351 transitions. [2021-10-04 18:49:29,110 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 5351 transitions. Word has length 38 [2021-10-04 18:49:29,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:29,111 INFO L470 AbstractCegarLoop]: Abstraction has 1960 states and 5351 transitions. [2021-10-04 18:49:29,111 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-04 18:49:29,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 5351 transitions. [2021-10-04 18:49:29,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:29,116 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:29,116 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:29,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-04 18:49:29,117 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-04 18:49:29,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:29,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1508765416, now seen corresponding path program 33 times [2021-10-04 18:49:29,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:29,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482163483] [2021-10-04 18:49:29,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:29,119 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:29,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-04 18:49:29,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:29,232 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482163483] [2021-10-04 18:49:29,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482163483] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:29,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:29,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:29,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247042365] [2021-10-04 18:49:29,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:29,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:29,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:29,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:29,235 INFO L87 Difference]: Start difference. First operand 1960 states and 5351 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:29,881 INFO L93 Difference]: Finished difference Result 2880 states and 7553 transitions. [2021-10-04 18:49:29,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-04 18:49:29,882 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:29,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:29,887 INFO L225 Difference]: With dead ends: 2880 [2021-10-04 18:49:29,887 INFO L226 Difference]: Without dead ends: 2774 [2021-10-04 18:49:29,888 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 236.5ms TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2021-10-04 18:49:29,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2021-10-04 18:49:29,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 1956. [2021-10-04 18:49:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1956 states, 1955 states have (on average 2.730946291560102) internal successors, (5339), 1955 states have internal predecessors, (5339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:29,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 5339 transitions. [2021-10-04 18:49:29,935 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 5339 transitions. Word has length 38 [2021-10-04 18:49:29,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:29,936 INFO L470 AbstractCegarLoop]: Abstraction has 1956 states and 5339 transitions. [2021-10-04 18:49:29,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-04 18:49:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 5339 transitions. [2021-10-04 18:49:29,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:29,940 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:29,941 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:29,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-04 18:49:29,941 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-04 18:49:29,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:29,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1681381784, now seen corresponding path program 34 times [2021-10-04 18:49:29,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:29,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237875541] [2021-10-04 18:49:29,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:29,942 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:30,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:30,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:30,047 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237875541] [2021-10-04 18:49:30,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237875541] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:30,048 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:30,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:49:30,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89852449] [2021-10-04 18:49:30,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:49:30,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:30,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:49:30,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:49:30,050 INFO L87 Difference]: Start difference. First operand 1956 states and 5339 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-04 18:49:30,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:30,508 INFO L93 Difference]: Finished difference Result 2972 states and 8017 transitions. [2021-10-04 18:49:30,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-04 18:49:30,508 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:30,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:30,513 INFO L225 Difference]: With dead ends: 2972 [2021-10-04 18:49:30,513 INFO L226 Difference]: Without dead ends: 2888 [2021-10-04 18:49:30,514 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 144.9ms TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:49:30,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2021-10-04 18:49:30,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1956. [2021-10-04 18:49:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1956 states, 1955 states have (on average 2.729923273657289) internal successors, (5337), 1955 states have internal predecessors, (5337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:30,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 5337 transitions. [2021-10-04 18:49:30,553 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 5337 transitions. Word has length 38 [2021-10-04 18:49:30,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:30,554 INFO L470 AbstractCegarLoop]: Abstraction has 1956 states and 5337 transitions. [2021-10-04 18:49:30,554 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-04 18:49:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 5337 transitions. [2021-10-04 18:49:30,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:30,560 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:30,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-04 18:49:30,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-04 18:49:30,561 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-04 18:49:30,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:30,562 INFO L82 PathProgramCache]: Analyzing trace with hash -982102132, now seen corresponding path program 35 times [2021-10-04 18:49:30,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:30,562 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646939461] [2021-10-04 18:49:30,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:30,563 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:30,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:30,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:30,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646939461] [2021-10-04 18:49:30,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646939461] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:30,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:30,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:30,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092589591] [2021-10-04 18:49:30,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:30,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:30,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:30,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:30,682 INFO L87 Difference]: Start difference. First operand 1956 states and 5337 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:31,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:31,290 INFO L93 Difference]: Finished difference Result 2598 states and 6755 transitions. [2021-10-04 18:49:31,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-04 18:49:31,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-04 18:49:31,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:31,296 INFO L225 Difference]: With dead ends: 2598 [2021-10-04 18:49:31,296 INFO L226 Difference]: Without dead ends: 2508 [2021-10-04 18:49:31,297 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 199.8ms TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2021-10-04 18:49:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2021-10-04 18:49:31,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 1682. [2021-10-04 18:49:31,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1681 states have (on average 2.6698393813206427) internal successors, (4488), 1681 states have internal predecessors, (4488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 4488 transitions. [2021-10-04 18:49:31,330 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 4488 transitions. Word has length 38 [2021-10-04 18:49:31,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:31,331 INFO L470 AbstractCegarLoop]: Abstraction has 1682 states and 4488 transitions. [2021-10-04 18:49:31,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:31,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 4488 transitions. [2021-10-04 18:49:31,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:31,334 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:31,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-04 18:49:31,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-04 18:49:31,334 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-04 18:49:31,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:31,335 INFO L82 PathProgramCache]: Analyzing trace with hash 220660494, now seen corresponding path program 36 times [2021-10-04 18:49:31,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:31,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46381507] [2021-10-04 18:49:31,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:31,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:31,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-04 18:49:31,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:31,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46381507] [2021-10-04 18:49:31,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46381507] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:31,431 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:31,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:49:31,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25233745] [2021-10-04 18:49:31,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:49:31,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:31,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:49:31,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:49:31,433 INFO L87 Difference]: Start difference. First operand 1682 states and 4488 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-04 18:49:31,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:31,833 INFO L93 Difference]: Finished difference Result 1972 states and 5219 transitions. [2021-10-04 18:49:31,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:49:31,834 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-04 18:49:31,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:31,839 INFO L225 Difference]: With dead ends: 1972 [2021-10-04 18:49:31,839 INFO L226 Difference]: Without dead ends: 1958 [2021-10-04 18:49:31,840 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 161.4ms TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:49:31,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2021-10-04 18:49:31,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1682. [2021-10-04 18:49:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1681 states have (on average 2.6662700773349197) internal successors, (4482), 1681 states have internal predecessors, (4482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 4482 transitions. [2021-10-04 18:49:31,878 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 4482 transitions. Word has length 38 [2021-10-04 18:49:31,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:31,878 INFO L470 AbstractCegarLoop]: Abstraction has 1682 states and 4482 transitions. [2021-10-04 18:49:31,878 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-04 18:49:31,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 4482 transitions. [2021-10-04 18:49:31,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:31,883 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:31,883 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:31,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-04 18:49:31,884 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-04 18:49:31,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:31,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1820405946, now seen corresponding path program 37 times [2021-10-04 18:49:31,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:31,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534864799] [2021-10-04 18:49:31,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:31,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:31,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:31,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:31,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534864799] [2021-10-04 18:49:31,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534864799] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:31,978 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:31,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:49:31,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471889796] [2021-10-04 18:49:31,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:49:31,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:31,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:49:31,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:49:31,980 INFO L87 Difference]: Start difference. First operand 1682 states and 4482 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-04 18:49:32,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:32,495 INFO L93 Difference]: Finished difference Result 3052 states and 8148 transitions. [2021-10-04 18:49:32,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-04 18:49:32,501 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-04 18:49:32,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:32,508 INFO L225 Difference]: With dead ends: 3052 [2021-10-04 18:49:32,508 INFO L226 Difference]: Without dead ends: 3010 [2021-10-04 18:49:32,509 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 178.9ms TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2021-10-04 18:49:32,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2021-10-04 18:49:32,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 1794. [2021-10-04 18:49:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1794 states, 1793 states have (on average 2.6815393195761295) internal successors, (4808), 1793 states have internal predecessors, (4808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 4808 transitions. [2021-10-04 18:49:32,553 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 4808 transitions. Word has length 38 [2021-10-04 18:49:32,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:32,554 INFO L470 AbstractCegarLoop]: Abstraction has 1794 states and 4808 transitions. [2021-10-04 18:49:32,554 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-04 18:49:32,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 4808 transitions. [2021-10-04 18:49:32,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:32,558 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:32,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-04 18:49:32,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-04 18:49:32,559 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-04 18:49:32,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:32,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1977001668, now seen corresponding path program 38 times [2021-10-04 18:49:32,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:32,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459904308] [2021-10-04 18:49:32,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:32,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:32,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:32,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:32,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459904308] [2021-10-04 18:49:32,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459904308] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:32,681 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:32,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:32,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859865613] [2021-10-04 18:49:32,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:32,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:32,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:32,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:32,683 INFO L87 Difference]: Start difference. First operand 1794 states and 4808 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:33,117 INFO L93 Difference]: Finished difference Result 2240 states and 5916 transitions. [2021-10-04 18:49:33,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:49:33,117 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:33,121 INFO L225 Difference]: With dead ends: 2240 [2021-10-04 18:49:33,122 INFO L226 Difference]: Without dead ends: 2154 [2021-10-04 18:49:33,122 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 143.1ms TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:49:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2021-10-04 18:49:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1884. [2021-10-04 18:49:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1883 states have (on average 2.651619755708975) internal successors, (4993), 1883 states have internal predecessors, (4993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:33,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 4993 transitions. [2021-10-04 18:49:33,160 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 4993 transitions. Word has length 38 [2021-10-04 18:49:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:33,160 INFO L470 AbstractCegarLoop]: Abstraction has 1884 states and 4993 transitions. [2021-10-04 18:49:33,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:33,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 4993 transitions. [2021-10-04 18:49:33,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:33,164 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:33,164 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:33,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-04 18:49:33,165 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-04 18:49:33,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:33,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1434981776, now seen corresponding path program 39 times [2021-10-04 18:49:33,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:33,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136348835] [2021-10-04 18:49:33,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:33,167 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:33,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:33,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:33,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136348835] [2021-10-04 18:49:33,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136348835] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:33,286 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:33,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:33,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233342588] [2021-10-04 18:49:33,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:33,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:33,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:33,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:33,288 INFO L87 Difference]: Start difference. First operand 1884 states and 4993 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:33,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:33,946 INFO L93 Difference]: Finished difference Result 2894 states and 7482 transitions. [2021-10-04 18:49:33,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-04 18:49:33,949 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:33,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:33,955 INFO L225 Difference]: With dead ends: 2894 [2021-10-04 18:49:33,955 INFO L226 Difference]: Without dead ends: 2730 [2021-10-04 18:49:33,956 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 253.8ms TimeCoverageRelationStatistics Valid=214, Invalid=778, Unknown=0, NotChecked=0, Total=992 [2021-10-04 18:49:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2021-10-04 18:49:33,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 1910. [2021-10-04 18:49:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1910 states, 1909 states have (on average 2.6636982713462545) internal successors, (5085), 1909 states have internal predecessors, (5085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 5085 transitions. [2021-10-04 18:49:33,987 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 5085 transitions. Word has length 38 [2021-10-04 18:49:33,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:33,987 INFO L470 AbstractCegarLoop]: Abstraction has 1910 states and 5085 transitions. [2021-10-04 18:49:33,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:33,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 5085 transitions. [2021-10-04 18:49:33,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:33,991 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:33,991 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:33,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-04 18:49:33,992 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-04 18:49:33,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:33,992 INFO L82 PathProgramCache]: Analyzing trace with hash 666450324, now seen corresponding path program 40 times [2021-10-04 18:49:33,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:33,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112486160] [2021-10-04 18:49:33,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:33,993 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:34,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:34,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:34,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112486160] [2021-10-04 18:49:34,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112486160] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:34,089 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:34,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:49:34,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832057007] [2021-10-04 18:49:34,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:49:34,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:34,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:49:34,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:49:34,091 INFO L87 Difference]: Start difference. First operand 1910 states and 5085 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-04 18:49:34,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:34,533 INFO L93 Difference]: Finished difference Result 2850 states and 7318 transitions. [2021-10-04 18:49:34,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-04 18:49:34,534 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-04 18:49:34,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:34,538 INFO L225 Difference]: With dead ends: 2850 [2021-10-04 18:49:34,538 INFO L226 Difference]: Without dead ends: 2826 [2021-10-04 18:49:34,538 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 148.6ms TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:49:34,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2021-10-04 18:49:34,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 1820. [2021-10-04 18:49:34,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 1819 states have (on average 2.645959318306762) internal successors, (4813), 1819 states have internal predecessors, (4813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:34,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 4813 transitions. [2021-10-04 18:49:34,588 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 4813 transitions. Word has length 38 [2021-10-04 18:49:34,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:34,589 INFO L470 AbstractCegarLoop]: Abstraction has 1820 states and 4813 transitions. [2021-10-04 18:49:34,589 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-04 18:49:34,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 4813 transitions. [2021-10-04 18:49:34,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:34,592 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:34,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-04 18:49:34,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-04 18:49:34,593 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-04 18:49:34,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash 912486980, now seen corresponding path program 41 times [2021-10-04 18:49:34,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:34,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145447982] [2021-10-04 18:49:34,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:34,595 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:34,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-04 18:49:34,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:34,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145447982] [2021-10-04 18:49:34,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145447982] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:34,700 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:34,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:34,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976128461] [2021-10-04 18:49:34,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:34,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:34,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:34,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:34,701 INFO L87 Difference]: Start difference. First operand 1820 states and 4813 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:35,236 INFO L93 Difference]: Finished difference Result 2530 states and 6367 transitions. [2021-10-04 18:49:35,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-04 18:49:35,237 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:35,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:35,241 INFO L225 Difference]: With dead ends: 2530 [2021-10-04 18:49:35,241 INFO L226 Difference]: Without dead ends: 2416 [2021-10-04 18:49:35,241 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 178.6ms TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2021-10-04 18:49:35,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2021-10-04 18:49:35,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 1474. [2021-10-04 18:49:35,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1473 states have (on average 2.5736591989137816) internal successors, (3791), 1473 states have internal predecessors, (3791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 3791 transitions. [2021-10-04 18:49:35,265 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 3791 transitions. Word has length 38 [2021-10-04 18:49:35,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:35,266 INFO L470 AbstractCegarLoop]: Abstraction has 1474 states and 3791 transitions. [2021-10-04 18:49:35,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:35,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 3791 transitions. [2021-10-04 18:49:35,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:35,269 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:35,269 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:35,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-04 18:49:35,270 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-04 18:49:35,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:35,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1358672242, now seen corresponding path program 42 times [2021-10-04 18:49:35,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:35,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406213004] [2021-10-04 18:49:35,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:35,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:35,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:35,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:35,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406213004] [2021-10-04 18:49:35,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406213004] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:35,350 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:35,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:49:35,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764089043] [2021-10-04 18:49:35,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:49:35,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:35,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:49:35,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:49:35,352 INFO L87 Difference]: Start difference. First operand 1474 states and 3791 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-04 18:49:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:35,651 INFO L93 Difference]: Finished difference Result 1850 states and 4761 transitions. [2021-10-04 18:49:35,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:49:35,656 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-04 18:49:35,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:35,659 INFO L225 Difference]: With dead ends: 1850 [2021-10-04 18:49:35,659 INFO L226 Difference]: Without dead ends: 1796 [2021-10-04 18:49:35,660 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 101.4ms TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2021-10-04 18:49:35,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2021-10-04 18:49:35,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1542. [2021-10-04 18:49:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 2.580791693705386) internal successors, (3977), 1541 states have internal predecessors, (3977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:35,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 3977 transitions. [2021-10-04 18:49:35,683 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 3977 transitions. Word has length 38 [2021-10-04 18:49:35,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:35,684 INFO L470 AbstractCegarLoop]: Abstraction has 1542 states and 3977 transitions. [2021-10-04 18:49:35,684 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-04 18:49:35,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 3977 transitions. [2021-10-04 18:49:35,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:35,687 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:35,687 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:35,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-04 18:49:35,688 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-04 18:49:35,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:35,688 INFO L82 PathProgramCache]: Analyzing trace with hash 513731170, now seen corresponding path program 43 times [2021-10-04 18:49:35,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:35,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568594473] [2021-10-04 18:49:35,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:35,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49: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-04 18:49:35,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:35,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568594473] [2021-10-04 18:49:35,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568594473] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:35,802 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:35,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:49:35,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859415940] [2021-10-04 18:49:35,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:49:35,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:35,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:49:35,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:49:35,805 INFO L87 Difference]: Start difference. First operand 1542 states and 3977 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-04 18:49:36,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:36,338 INFO L93 Difference]: Finished difference Result 1990 states and 5025 transitions. [2021-10-04 18:49:36,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-04 18:49:36,338 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-04 18:49:36,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:36,343 INFO L225 Difference]: With dead ends: 1990 [2021-10-04 18:49:36,343 INFO L226 Difference]: Without dead ends: 1940 [2021-10-04 18:49:36,344 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 231.7ms TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2021-10-04 18:49:36,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2021-10-04 18:49:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1602. [2021-10-04 18:49:36,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1601 states have (on average 2.570893191755153) internal successors, (4116), 1601 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:36,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 4116 transitions. [2021-10-04 18:49:36,378 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 4116 transitions. Word has length 38 [2021-10-04 18:49:36,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:36,379 INFO L470 AbstractCegarLoop]: Abstraction has 1602 states and 4116 transitions. [2021-10-04 18:49:36,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-04 18:49:36,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 4116 transitions. [2021-10-04 18:49:36,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:36,384 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:36,384 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:36,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-04 18:49:36,384 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-04 18:49:36,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:36,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1385777014, now seen corresponding path program 44 times [2021-10-04 18:49:36,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:36,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180547152] [2021-10-04 18:49:36,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:36,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:36,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:36,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:36,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180547152] [2021-10-04 18:49:36,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180547152] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:36,495 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:36,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:36,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700515351] [2021-10-04 18:49:36,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:36,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:36,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:36,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:36,497 INFO L87 Difference]: Start difference. First operand 1602 states and 4116 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:37,097 INFO L93 Difference]: Finished difference Result 2554 states and 6427 transitions. [2021-10-04 18:49:37,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-10-04 18:49:37,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-04 18:49:37,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:37,103 INFO L225 Difference]: With dead ends: 2554 [2021-10-04 18:49:37,103 INFO L226 Difference]: Without dead ends: 2514 [2021-10-04 18:49:37,104 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 243.2ms TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2021-10-04 18:49:37,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2021-10-04 18:49:37,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 1692. [2021-10-04 18:49:37,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1691 states have (on average 2.584861028976937) internal successors, (4371), 1691 states have internal predecessors, (4371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:37,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 4371 transitions. [2021-10-04 18:49:37,146 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 4371 transitions. Word has length 38 [2021-10-04 18:49:37,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:37,147 INFO L470 AbstractCegarLoop]: Abstraction has 1692 states and 4371 transitions. [2021-10-04 18:49:37,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:37,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 4371 transitions. [2021-10-04 18:49:37,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:37,151 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:37,151 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:37,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-04 18:49:37,152 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-04 18:49:37,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:37,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1431792320, now seen corresponding path program 45 times [2021-10-04 18:49:37,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:37,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400714986] [2021-10-04 18:49:37,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:37,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:37,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-04 18:49:37,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:37,271 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400714986] [2021-10-04 18:49:37,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400714986] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:37,271 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:37,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:49:37,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382963962] [2021-10-04 18:49:37,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:49:37,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:37,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:49:37,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:49:37,273 INFO L87 Difference]: Start difference. First operand 1692 states and 4371 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-04 18:49:37,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:37,972 INFO L93 Difference]: Finished difference Result 2676 states and 6655 transitions. [2021-10-04 18:49:37,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-10-04 18:49:37,973 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-04 18:49:37,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:37,977 INFO L225 Difference]: With dead ends: 2676 [2021-10-04 18:49:37,977 INFO L226 Difference]: Without dead ends: 2618 [2021-10-04 18:49:37,978 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 276.8ms TimeCoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2021-10-04 18:49:37,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2021-10-04 18:49:38,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 1672. [2021-10-04 18:49:38,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 2.5846798324356675) internal successors, (4319), 1671 states have internal predecessors, (4319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 4319 transitions. [2021-10-04 18:49:38,005 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 4319 transitions. Word has length 38 [2021-10-04 18:49:38,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:38,005 INFO L470 AbstractCegarLoop]: Abstraction has 1672 states and 4319 transitions. [2021-10-04 18:49:38,005 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-04 18:49:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 4319 transitions. [2021-10-04 18:49:38,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:38,008 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:38,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-04 18:49:38,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-10-04 18:49:38,008 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-04 18:49:38,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:38,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1592411618, now seen corresponding path program 46 times [2021-10-04 18:49:38,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:38,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523102257] [2021-10-04 18:49:38,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:38,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:38,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:38,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:38,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523102257] [2021-10-04 18:49:38,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523102257] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:38,115 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:38,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:49:38,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123038125] [2021-10-04 18:49:38,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:49:38,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:38,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:49:38,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:49:38,116 INFO L87 Difference]: Start difference. First operand 1672 states and 4319 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-04 18:49:38,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:38,498 INFO L93 Difference]: Finished difference Result 1950 states and 4991 transitions. [2021-10-04 18:49:38,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:49:38,499 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-04 18:49:38,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:38,502 INFO L225 Difference]: With dead ends: 1950 [2021-10-04 18:49:38,503 INFO L226 Difference]: Without dead ends: 1926 [2021-10-04 18:49:38,503 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 178.6ms TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2021-10-04 18:49:38,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2021-10-04 18:49:38,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1670. [2021-10-04 18:49:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1669 states have (on average 2.5847813061713603) internal successors, (4314), 1669 states have internal predecessors, (4314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:38,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 4314 transitions. [2021-10-04 18:49:38,536 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 4314 transitions. Word has length 38 [2021-10-04 18:49:38,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:38,536 INFO L470 AbstractCegarLoop]: Abstraction has 1670 states and 4314 transitions. [2021-10-04 18:49:38,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:38,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 4314 transitions. [2021-10-04 18:49:38,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:38,540 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:38,540 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:38,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-04 18:49:38,541 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-04 18:49:38,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:38,541 INFO L82 PathProgramCache]: Analyzing trace with hash 365018610, now seen corresponding path program 47 times [2021-10-04 18:49:38,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:38,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564688278] [2021-10-04 18:49:38,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:38,542 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:38,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-04 18:49:38,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:38,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564688278] [2021-10-04 18:49:38,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564688278] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:38,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:38,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:38,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129728396] [2021-10-04 18:49:38,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:38,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:38,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:38,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:38,653 INFO L87 Difference]: Start difference. First operand 1670 states and 4314 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:39,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:39,126 INFO L93 Difference]: Finished difference Result 1978 states and 4961 transitions. [2021-10-04 18:49:39,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:49:39,127 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:39,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:39,131 INFO L225 Difference]: With dead ends: 1978 [2021-10-04 18:49:39,132 INFO L226 Difference]: Without dead ends: 1898 [2021-10-04 18:49:39,132 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 155.9ms TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:49:39,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2021-10-04 18:49:39,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1636. [2021-10-04 18:49:39,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1635 states have (on average 2.5718654434250765) internal successors, (4205), 1635 states have internal predecessors, (4205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:39,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 4205 transitions. [2021-10-04 18:49:39,164 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 4205 transitions. Word has length 38 [2021-10-04 18:49:39,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:39,164 INFO L470 AbstractCegarLoop]: Abstraction has 1636 states and 4205 transitions. [2021-10-04 18:49:39,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:39,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 4205 transitions. [2021-10-04 18:49:39,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:39,168 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:39,168 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:39,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-04 18:49:39,168 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-04 18:49:39,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:39,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1115270448, now seen corresponding path program 48 times [2021-10-04 18:49:39,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:39,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324161377] [2021-10-04 18:49:39,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:39,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:39,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-04 18:49:39,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:39,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324161377] [2021-10-04 18:49:39,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324161377] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:39,270 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:39,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:39,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910182400] [2021-10-04 18:49:39,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:39,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:39,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:39,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:39,272 INFO L87 Difference]: Start difference. First operand 1636 states and 4205 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:39,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:39,881 INFO L93 Difference]: Finished difference Result 2346 states and 5837 transitions. [2021-10-04 18:49:39,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-04 18:49:39,882 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:39,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:39,885 INFO L225 Difference]: With dead ends: 2346 [2021-10-04 18:49:39,885 INFO L226 Difference]: Without dead ends: 2316 [2021-10-04 18:49:39,886 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 218.9ms TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2021-10-04 18:49:39,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2021-10-04 18:49:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 1660. [2021-10-04 18:49:39,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1660 states, 1659 states have (on average 2.5780590717299576) internal successors, (4277), 1659 states have internal predecessors, (4277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 4277 transitions. [2021-10-04 18:49:39,910 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 4277 transitions. Word has length 38 [2021-10-04 18:49:39,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:39,910 INFO L470 AbstractCegarLoop]: Abstraction has 1660 states and 4277 transitions. [2021-10-04 18:49:39,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:39,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 4277 transitions. [2021-10-04 18:49:39,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:39,913 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:39,913 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:39,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-10-04 18:49:39,914 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-04 18:49:39,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:39,914 INFO L82 PathProgramCache]: Analyzing trace with hash -275293628, now seen corresponding path program 49 times [2021-10-04 18:49:39,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:39,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407709714] [2021-10-04 18:49:39,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:39,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:40,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:40,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:40,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407709714] [2021-10-04 18:49:40,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407709714] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:40,011 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:40,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:49:40,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159530410] [2021-10-04 18:49:40,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:49:40,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:40,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:49:40,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:49:40,013 INFO L87 Difference]: Start difference. First operand 1660 states and 4277 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-04 18:49:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:40,453 INFO L93 Difference]: Finished difference Result 2364 states and 5981 transitions. [2021-10-04 18:49:40,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-04 18:49:40,454 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-04 18:49:40,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:40,458 INFO L225 Difference]: With dead ends: 2364 [2021-10-04 18:49:40,459 INFO L226 Difference]: Without dead ends: 2346 [2021-10-04 18:49:40,459 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 168.4ms TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2021-10-04 18:49:40,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2021-10-04 18:49:40,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 1678. [2021-10-04 18:49:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1677 states have (on average 2.577221228384019) internal successors, (4322), 1677 states have internal predecessors, (4322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 4322 transitions. [2021-10-04 18:49:40,499 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 4322 transitions. Word has length 38 [2021-10-04 18:49:40,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:40,499 INFO L470 AbstractCegarLoop]: Abstraction has 1678 states and 4322 transitions. [2021-10-04 18:49:40,499 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-04 18:49:40,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 4322 transitions. [2021-10-04 18:49:40,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:40,503 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:40,503 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:40,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-10-04 18:49:40,504 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-04 18:49:40,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:40,505 INFO L82 PathProgramCache]: Analyzing trace with hash -229278322, now seen corresponding path program 50 times [2021-10-04 18:49:40,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:40,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483703090] [2021-10-04 18:49:40,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:40,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:40,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:40,623 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483703090] [2021-10-04 18:49:40,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483703090] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:40,624 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:40,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:40,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638950107] [2021-10-04 18:49:40,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:40,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:40,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:40,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:40,626 INFO L87 Difference]: Start difference. First operand 1678 states and 4322 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:41,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:41,121 INFO L93 Difference]: Finished difference Result 2368 states and 5983 transitions. [2021-10-04 18:49:41,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-04 18:49:41,121 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:41,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:41,126 INFO L225 Difference]: With dead ends: 2368 [2021-10-04 18:49:41,126 INFO L226 Difference]: Without dead ends: 2352 [2021-10-04 18:49:41,127 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 205.0ms TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2021-10-04 18:49:41,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2021-10-04 18:49:41,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 1676. [2021-10-04 18:49:41,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1676 states, 1675 states have (on average 2.5773134328358207) internal successors, (4317), 1675 states have internal predecessors, (4317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:41,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 4317 transitions. [2021-10-04 18:49:41,155 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 4317 transitions. Word has length 38 [2021-10-04 18:49:41,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:41,155 INFO L470 AbstractCegarLoop]: Abstraction has 1676 states and 4317 transitions. [2021-10-04 18:49:41,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:41,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 4317 transitions. [2021-10-04 18:49:41,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:41,159 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:41,159 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:41,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-10-04 18:49:41,160 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-04 18:49:41,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:41,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1218265080, now seen corresponding path program 51 times [2021-10-04 18:49:41,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:41,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209708487] [2021-10-04 18:49:41,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:41,161 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:41,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-04 18:49:41,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:41,257 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209708487] [2021-10-04 18:49:41,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209708487] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:41,257 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:41,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:49:41,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830283029] [2021-10-04 18:49:41,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:49:41,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:41,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:49:41,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:49:41,259 INFO L87 Difference]: Start difference. First operand 1676 states and 4317 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-04 18:49:41,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:41,730 INFO L93 Difference]: Finished difference Result 2408 states and 6061 transitions. [2021-10-04 18:49:41,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-04 18:49:41,731 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-04 18:49:41,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:41,734 INFO L225 Difference]: With dead ends: 2408 [2021-10-04 18:49:41,734 INFO L226 Difference]: Without dead ends: 2390 [2021-10-04 18:49:41,736 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 164.8ms TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:49:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2021-10-04 18:49:41,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 1670. [2021-10-04 18:49:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1669 states have (on average 2.5727980826842423) internal successors, (4294), 1669 states have internal predecessors, (4294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:41,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 4294 transitions. [2021-10-04 18:49:41,764 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 4294 transitions. Word has length 38 [2021-10-04 18:49:41,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:41,765 INFO L470 AbstractCegarLoop]: Abstraction has 1670 states and 4294 transitions. [2021-10-04 18:49:41,765 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-04 18:49:41,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 4294 transitions. [2021-10-04 18:49:41,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:41,767 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:41,768 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:41,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-10-04 18:49:41,768 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-04 18:49:41,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:41,769 INFO L82 PathProgramCache]: Analyzing trace with hash 875541774, now seen corresponding path program 52 times [2021-10-04 18:49:41,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:41,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75385337] [2021-10-04 18:49:41,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:41,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:41,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:41,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:41,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75385337] [2021-10-04 18:49:41,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75385337] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:41,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:41,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:49:41,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090782367] [2021-10-04 18:49:41,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:49:41,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:41,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:49:41,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:49:41,878 INFO L87 Difference]: Start difference. First operand 1670 states and 4294 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-04 18:49:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:42,295 INFO L93 Difference]: Finished difference Result 2416 states and 6065 transitions. [2021-10-04 18:49:42,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-04 18:49:42,295 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-04 18:49:42,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:42,300 INFO L225 Difference]: With dead ends: 2416 [2021-10-04 18:49:42,301 INFO L226 Difference]: Without dead ends: 2402 [2021-10-04 18:49:42,301 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 150.8ms TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:49:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2021-10-04 18:49:42,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 1674. [2021-10-04 18:49:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1673 states have (on average 2.5762104004781827) internal successors, (4310), 1673 states have internal predecessors, (4310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:42,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 4310 transitions. [2021-10-04 18:49:42,361 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 4310 transitions. Word has length 38 [2021-10-04 18:49:42,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:42,361 INFO L470 AbstractCegarLoop]: Abstraction has 1674 states and 4310 transitions. [2021-10-04 18:49:42,362 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-04 18:49:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 4310 transitions. [2021-10-04 18:49:42,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:42,365 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:42,365 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:42,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-10-04 18:49:42,366 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-04 18:49:42,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:42,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1574821426, now seen corresponding path program 53 times [2021-10-04 18:49:42,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:42,367 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384690325] [2021-10-04 18:49:42,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:42,367 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:42,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:42,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:42,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384690325] [2021-10-04 18:49:42,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384690325] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:42,477 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:42,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:42,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047651373] [2021-10-04 18:49:42,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:42,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:42,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:42,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:42,479 INFO L87 Difference]: Start difference. First operand 1674 states and 4310 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:43,030 INFO L93 Difference]: Finished difference Result 2380 states and 5997 transitions. [2021-10-04 18:49:43,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-04 18:49:43,030 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:43,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:43,035 INFO L225 Difference]: With dead ends: 2380 [2021-10-04 18:49:43,036 INFO L226 Difference]: Without dead ends: 2356 [2021-10-04 18:49:43,036 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 200.0ms TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2021-10-04 18:49:43,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2021-10-04 18:49:43,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 1658. [2021-10-04 18:49:43,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1657 states have (on average 2.5769462884731444) internal successors, (4270), 1657 states have internal predecessors, (4270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 4270 transitions. [2021-10-04 18:49:43,074 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 4270 transitions. Word has length 38 [2021-10-04 18:49:43,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:43,075 INFO L470 AbstractCegarLoop]: Abstraction has 1658 states and 4270 transitions. [2021-10-04 18:49:43,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-04 18:49:43,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 4270 transitions. [2021-10-04 18:49:43,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:43,078 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:43,079 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:43,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-10-04 18:49:43,079 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-04 18:49:43,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:43,080 INFO L82 PathProgramCache]: Analyzing trace with hash 2084132568, now seen corresponding path program 54 times [2021-10-04 18:49:43,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:43,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218053569] [2021-10-04 18:49:43,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:43,080 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:43,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:43,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218053569] [2021-10-04 18:49:43,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218053569] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:43,190 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:43,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:49:43,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698200707] [2021-10-04 18:49:43,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:49:43,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:43,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:49:43,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:49:43,192 INFO L87 Difference]: Start difference. First operand 1658 states and 4270 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-04 18:49:43,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:43,602 INFO L93 Difference]: Finished difference Result 1942 states and 4937 transitions. [2021-10-04 18:49:43,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:49:43,603 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-04 18:49:43,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:43,607 INFO L225 Difference]: With dead ends: 1942 [2021-10-04 18:49:43,607 INFO L226 Difference]: Without dead ends: 1924 [2021-10-04 18:49:43,608 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 189.1ms TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2021-10-04 18:49:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2021-10-04 18:49:43,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1660. [2021-10-04 18:49:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1660 states, 1659 states have (on average 2.5756479807112718) internal successors, (4273), 1659 states have internal predecessors, (4273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 4273 transitions. [2021-10-04 18:49:43,639 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 4273 transitions. Word has length 38 [2021-10-04 18:49:43,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:43,639 INFO L470 AbstractCegarLoop]: Abstraction has 1660 states and 4273 transitions. [2021-10-04 18:49:43,640 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-04 18:49:43,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 4273 transitions. [2021-10-04 18:49:43,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:43,643 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:43,643 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:43,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-10-04 18:49:43,643 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-04 18:49:43,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:43,644 INFO L82 PathProgramCache]: Analyzing trace with hash 13381370, now seen corresponding path program 55 times [2021-10-04 18:49:43,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:43,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634403602] [2021-10-04 18:49:43,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:43,645 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:43,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:43,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634403602] [2021-10-04 18:49:43,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634403602] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:43,756 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:43,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:49:43,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111840251] [2021-10-04 18:49:43,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:49:43,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:43,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:49:43,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:49:43,758 INFO L87 Difference]: Start difference. First operand 1660 states and 4273 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-04 18:49:44,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:44,201 INFO L93 Difference]: Finished difference Result 1942 states and 4929 transitions. [2021-10-04 18:49:44,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:49:44,201 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-04 18:49:44,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:44,204 INFO L225 Difference]: With dead ends: 1942 [2021-10-04 18:49:44,204 INFO L226 Difference]: Without dead ends: 1926 [2021-10-04 18:49:44,204 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 183.7ms TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:49:44,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2021-10-04 18:49:44,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1666. [2021-10-04 18:49:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1665 states have (on average 2.571771771771772) internal successors, (4282), 1665 states have internal predecessors, (4282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 4282 transitions. [2021-10-04 18:49:44,225 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 4282 transitions. Word has length 38 [2021-10-04 18:49:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:44,226 INFO L470 AbstractCegarLoop]: Abstraction has 1666 states and 4282 transitions. [2021-10-04 18:49:44,226 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-04 18:49:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 4282 transitions. [2021-10-04 18:49:44,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:44,228 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:44,228 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:44,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-10-04 18:49:44,228 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-04 18:49:44,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:44,229 INFO L82 PathProgramCache]: Analyzing trace with hash -2035914928, now seen corresponding path program 56 times [2021-10-04 18:49:44,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:44,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742689307] [2021-10-04 18:49:44,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:44,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:44,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:44,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742689307] [2021-10-04 18:49:44,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742689307] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:44,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:44,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:49:44,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853799491] [2021-10-04 18:49:44,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:49:44,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:44,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:49:44,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:49:44,336 INFO L87 Difference]: Start difference. First operand 1666 states and 4282 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-04 18:49:45,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:45,020 INFO L93 Difference]: Finished difference Result 2504 states and 6220 transitions. [2021-10-04 18:49:45,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-04 18:49:45,021 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-04 18:49:45,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:45,025 INFO L225 Difference]: With dead ends: 2504 [2021-10-04 18:49:45,025 INFO L226 Difference]: Without dead ends: 2470 [2021-10-04 18:49:45,025 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 279.2ms TimeCoverageRelationStatistics Valid=218, Invalid=838, Unknown=0, NotChecked=0, Total=1056 [2021-10-04 18:49:45,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2021-10-04 18:49:45,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 1656. [2021-10-04 18:49:45,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1655 states have (on average 2.5758308157099696) internal successors, (4263), 1655 states have internal predecessors, (4263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:45,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 4263 transitions. [2021-10-04 18:49:45,049 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 4263 transitions. Word has length 38 [2021-10-04 18:49:45,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:45,049 INFO L470 AbstractCegarLoop]: Abstraction has 1656 states and 4263 transitions. [2021-10-04 18:49:45,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-04 18:49:45,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 4263 transitions. [2021-10-04 18:49:45,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:45,051 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:45,052 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:45,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-10-04 18:49:45,052 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-04 18:49:45,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:45,052 INFO L82 PathProgramCache]: Analyzing trace with hash -692902130, now seen corresponding path program 57 times [2021-10-04 18:49:45,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:45,052 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433700686] [2021-10-04 18:49:45,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:45,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:45,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:45,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:45,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433700686] [2021-10-04 18:49:45,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433700686] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:45,148 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:45,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:45,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540126656] [2021-10-04 18:49:45,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:45,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:45,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:45,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:45,150 INFO L87 Difference]: Start difference. First operand 1656 states and 4263 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:45,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:45,648 INFO L93 Difference]: Finished difference Result 2068 states and 5195 transitions. [2021-10-04 18:49:45,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-04 18:49:45,648 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:45,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:45,652 INFO L225 Difference]: With dead ends: 2068 [2021-10-04 18:49:45,652 INFO L226 Difference]: Without dead ends: 2034 [2021-10-04 18:49:45,653 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 233.6ms TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2021-10-04 18:49:45,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2021-10-04 18:49:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 1742. [2021-10-04 18:49:45,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1742 states, 1741 states have (on average 2.568638713383113) internal successors, (4472), 1741 states have internal predecessors, (4472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:45,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 4472 transitions. [2021-10-04 18:49:45,676 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 4472 transitions. Word has length 38 [2021-10-04 18:49:45,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:45,677 INFO L470 AbstractCegarLoop]: Abstraction has 1742 states and 4472 transitions. [2021-10-04 18:49:45,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:45,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 4472 transitions. [2021-10-04 18:49:45,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:45,679 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:45,679 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:45,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-10-04 18:49:45,680 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-04 18:49:45,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:45,680 INFO L82 PathProgramCache]: Analyzing trace with hash 906843322, now seen corresponding path program 58 times [2021-10-04 18:49:45,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:45,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234200183] [2021-10-04 18:49:45,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:45,681 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:45,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:45,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:45,773 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234200183] [2021-10-04 18:49:45,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234200183] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:45,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:45,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:45,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607603856] [2021-10-04 18:49:45,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:45,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:45,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:45,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:45,775 INFO L87 Difference]: Start difference. First operand 1742 states and 4472 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:46,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:46,434 INFO L93 Difference]: Finished difference Result 2968 states and 7346 transitions. [2021-10-04 18:49:46,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-10-04 18:49:46,435 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:46,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:46,441 INFO L225 Difference]: With dead ends: 2968 [2021-10-04 18:49:46,441 INFO L226 Difference]: Without dead ends: 2870 [2021-10-04 18:49:46,441 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 250.0ms TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2021-10-04 18:49:46,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2021-10-04 18:49:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 1888. [2021-10-04 18:49:46,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1887 states have (on average 2.5686274509803924) internal successors, (4847), 1887 states have internal predecessors, (4847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 4847 transitions. [2021-10-04 18:49:46,483 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 4847 transitions. Word has length 38 [2021-10-04 18:49:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:46,484 INFO L470 AbstractCegarLoop]: Abstraction has 1888 states and 4847 transitions. [2021-10-04 18:49:46,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-04 18:49:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 4847 transitions. [2021-10-04 18:49:46,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:46,488 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:46,488 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:46,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-10-04 18:49:46,488 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-04 18:49:46,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:46,489 INFO L82 PathProgramCache]: Analyzing trace with hash -284904270, now seen corresponding path program 59 times [2021-10-04 18:49:46,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:46,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13082489] [2021-10-04 18:49:46,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:46,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:46,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-04 18:49:46,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:46,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13082489] [2021-10-04 18:49:46,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13082489] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:46,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:46,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:46,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347047898] [2021-10-04 18:49:46,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:46,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:46,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:46,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:46,595 INFO L87 Difference]: Start difference. First operand 1888 states and 4847 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:46,898 INFO L93 Difference]: Finished difference Result 2046 states and 5175 transitions. [2021-10-04 18:49:46,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-04 18:49:46,898 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:46,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:46,901 INFO L225 Difference]: With dead ends: 2046 [2021-10-04 18:49:46,902 INFO L226 Difference]: Without dead ends: 2026 [2021-10-04 18:49:46,902 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 155.9ms TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:49:46,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2021-10-04 18:49:46,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 1884. [2021-10-04 18:49:46,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1883 states have (on average 2.569304301646309) internal successors, (4838), 1883 states have internal predecessors, (4838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 4838 transitions. [2021-10-04 18:49:46,925 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 4838 transitions. Word has length 38 [2021-10-04 18:49:46,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:46,925 INFO L470 AbstractCegarLoop]: Abstraction has 1884 states and 4838 transitions. [2021-10-04 18:49:46,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:46,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 4838 transitions. [2021-10-04 18:49:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:46,927 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:46,928 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:46,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-10-04 18:49:46,928 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-04 18:49:46,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:46,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1294661346, now seen corresponding path program 60 times [2021-10-04 18:49:46,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:46,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603928653] [2021-10-04 18:49:46,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:46,929 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:47,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-04 18:49:47,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:47,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603928653] [2021-10-04 18:49:47,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603928653] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:47,022 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:47,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:47,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845030088] [2021-10-04 18:49:47,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:47,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:47,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:47,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:47,023 INFO L87 Difference]: Start difference. First operand 1884 states and 4838 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:47,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:47,434 INFO L93 Difference]: Finished difference Result 2068 states and 5221 transitions. [2021-10-04 18:49:47,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:49:47,435 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:47,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:47,438 INFO L225 Difference]: With dead ends: 2068 [2021-10-04 18:49:47,438 INFO L226 Difference]: Without dead ends: 2052 [2021-10-04 18:49:47,438 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 147.0ms TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:49:47,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2021-10-04 18:49:47,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 1890. [2021-10-04 18:49:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1889 states have (on average 2.5659078877713077) internal successors, (4847), 1889 states have internal predecessors, (4847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:47,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 4847 transitions. [2021-10-04 18:49:47,473 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 4847 transitions. Word has length 38 [2021-10-04 18:49:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:47,473 INFO L470 AbstractCegarLoop]: Abstraction has 1890 states and 4847 transitions. [2021-10-04 18:49:47,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 4847 transitions. [2021-10-04 18:49:47,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:47,477 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:47,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-04 18:49:47,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-10-04 18:49:47,478 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-04 18:49:47,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:47,478 INFO L82 PathProgramCache]: Analyzing trace with hash -2117322098, now seen corresponding path program 61 times [2021-10-04 18:49:47,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:47,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183805515] [2021-10-04 18:49:47,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:47,479 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:47,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:47,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183805515] [2021-10-04 18:49:47,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183805515] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:47,573 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:47,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:47,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989429280] [2021-10-04 18:49:47,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:47,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:47,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:47,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:47,575 INFO L87 Difference]: Start difference. First operand 1890 states and 4847 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:48,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:48,174 INFO L93 Difference]: Finished difference Result 2666 states and 6654 transitions. [2021-10-04 18:49:48,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-04 18:49:48,175 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:48,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:48,182 INFO L225 Difference]: With dead ends: 2666 [2021-10-04 18:49:48,183 INFO L226 Difference]: Without dead ends: 2636 [2021-10-04 18:49:48,183 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 221.2ms TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2021-10-04 18:49:48,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2021-10-04 18:49:48,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 1914. [2021-10-04 18:49:48,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 2.571353894406691) internal successors, (4919), 1913 states have internal predecessors, (4919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:48,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 4919 transitions. [2021-10-04 18:49:48,227 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 4919 transitions. Word has length 38 [2021-10-04 18:49:48,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:48,227 INFO L470 AbstractCegarLoop]: Abstraction has 1914 states and 4919 transitions. [2021-10-04 18:49:48,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 4919 transitions. [2021-10-04 18:49:48,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:48,231 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:48,231 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:48,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-10-04 18:49:48,232 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-04 18:49:48,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:48,232 INFO L82 PathProgramCache]: Analyzing trace with hash -15889998, now seen corresponding path program 62 times [2021-10-04 18:49:48,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:48,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055013070] [2021-10-04 18:49:48,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:48,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:48,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:48,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055013070] [2021-10-04 18:49:48,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055013070] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:48,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:48,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:49:48,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611336592] [2021-10-04 18:49:48,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:49:48,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:48,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:49:48,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:49:48,342 INFO L87 Difference]: Start difference. First operand 1914 states and 4919 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-04 18:49:48,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:48,835 INFO L93 Difference]: Finished difference Result 2620 states and 6576 transitions. [2021-10-04 18:49:48,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-04 18:49:48,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-04 18:49:48,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:48,840 INFO L225 Difference]: With dead ends: 2620 [2021-10-04 18:49:48,840 INFO L226 Difference]: Without dead ends: 2596 [2021-10-04 18:49:48,841 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 174.1ms TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2021-10-04 18:49:48,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2596 states. [2021-10-04 18:49:48,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2596 to 1946. [2021-10-04 18:49:48,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1945 states have (on average 2.5691516709511566) internal successors, (4997), 1945 states have internal predecessors, (4997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:48,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 4997 transitions. [2021-10-04 18:49:48,876 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 4997 transitions. Word has length 38 [2021-10-04 18:49:48,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:48,876 INFO L470 AbstractCegarLoop]: Abstraction has 1946 states and 4997 transitions. [2021-10-04 18:49:48,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-04 18:49:48,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 4997 transitions. [2021-10-04 18:49:48,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:48,879 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:48,879 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:48,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-10-04 18:49:48,880 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-04 18:49:48,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:48,880 INFO L82 PathProgramCache]: Analyzing trace with hash 230146658, now seen corresponding path program 63 times [2021-10-04 18:49:48,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:48,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221484453] [2021-10-04 18:49:48,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:48,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:48,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:48,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:48,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221484453] [2021-10-04 18:49:48,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221484453] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:48,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:48,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:48,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045305656] [2021-10-04 18:49:48,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:48,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:48,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:48,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:48,982 INFO L87 Difference]: Start difference. First operand 1946 states and 4997 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:49,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:49,505 INFO L93 Difference]: Finished difference Result 2612 states and 6547 transitions. [2021-10-04 18:49:49,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-04 18:49:49,505 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:49,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:49,511 INFO L225 Difference]: With dead ends: 2612 [2021-10-04 18:49:49,511 INFO L226 Difference]: Without dead ends: 2596 [2021-10-04 18:49:49,512 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 194.1ms TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2021-10-04 18:49:49,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2596 states. [2021-10-04 18:49:49,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2596 to 1942. [2021-10-04 18:49:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1942 states, 1941 states have (on average 2.5687789799072642) internal successors, (4986), 1941 states have internal predecessors, (4986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:49,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 4986 transitions. [2021-10-04 18:49:49,562 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 4986 transitions. Word has length 38 [2021-10-04 18:49:49,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:49,562 INFO L470 AbstractCegarLoop]: Abstraction has 1942 states and 4986 transitions. [2021-10-04 18:49:49,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 4986 transitions. [2021-10-04 18:49:49,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:49,568 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:49,569 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:49,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-10-04 18:49:49,569 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-04 18:49:49,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:49,570 INFO L82 PathProgramCache]: Analyzing trace with hash -840795358, now seen corresponding path program 64 times [2021-10-04 18:49:49,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:49,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553536462] [2021-10-04 18:49:49,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:49,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:49,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:49,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553536462] [2021-10-04 18:49:49,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553536462] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:49,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:49,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:49:49,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385875016] [2021-10-04 18:49:49,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:49:49,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:49,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:49:49,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:49:49,679 INFO L87 Difference]: Start difference. First operand 1942 states and 4986 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-04 18:49:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:50,095 INFO L93 Difference]: Finished difference Result 2698 states and 6718 transitions. [2021-10-04 18:49:50,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-04 18:49:50,096 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-04 18:49:50,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:50,101 INFO L225 Difference]: With dead ends: 2698 [2021-10-04 18:49:50,101 INFO L226 Difference]: Without dead ends: 2680 [2021-10-04 18:49:50,101 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 128.6ms TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:49:50,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2680 states. [2021-10-04 18:49:50,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2680 to 1946. [2021-10-04 18:49:50,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1945 states have (on average 2.5660668380462726) internal successors, (4991), 1945 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:50,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 4991 transitions. [2021-10-04 18:49:50,128 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 4991 transitions. Word has length 38 [2021-10-04 18:49:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:50,128 INFO L470 AbstractCegarLoop]: Abstraction has 1946 states and 4991 transitions. [2021-10-04 18:49:50,129 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-04 18:49:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 4991 transitions. [2021-10-04 18:49:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:50,131 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:50,131 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:50,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-10-04 18:49:50,131 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-04 18:49:50,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:50,132 INFO L82 PathProgramCache]: Analyzing trace with hash 968256626, now seen corresponding path program 65 times [2021-10-04 18:49:50,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:50,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81606770] [2021-10-04 18:49:50,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:50,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:50,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:50,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:50,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81606770] [2021-10-04 18:49:50,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81606770] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:50,222 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:50,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:49:50,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719138680] [2021-10-04 18:49:50,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:49:50,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:50,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:49:50,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:49:50,223 INFO L87 Difference]: Start difference. First operand 1946 states and 4991 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-04 18:49:50,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:50,662 INFO L93 Difference]: Finished difference Result 2696 states and 6700 transitions. [2021-10-04 18:49:50,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-04 18:49:50,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-04 18:49:50,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:50,667 INFO L225 Difference]: With dead ends: 2696 [2021-10-04 18:49:50,667 INFO L226 Difference]: Without dead ends: 2664 [2021-10-04 18:49:50,667 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 150.9ms TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:49:50,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2021-10-04 18:49:50,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 1910. [2021-10-04 18:49:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1910 states, 1909 states have (on average 2.5699319015191198) internal successors, (4906), 1909 states have internal predecessors, (4906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 4906 transitions. [2021-10-04 18:49:50,693 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 4906 transitions. Word has length 38 [2021-10-04 18:49:50,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:50,694 INFO L470 AbstractCegarLoop]: Abstraction has 1910 states and 4906 transitions. [2021-10-04 18:49:50,694 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-04 18:49:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 4906 transitions. [2021-10-04 18:49:50,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:50,696 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:50,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-04 18:49:50,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-10-04 18:49:50,697 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-04 18:49:50,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:50,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1216146078, now seen corresponding path program 66 times [2021-10-04 18:49:50,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:50,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853562380] [2021-10-04 18:49:50,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:50,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:50,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:50,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:50,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853562380] [2021-10-04 18:49:50,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853562380] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:50,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:50,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:49:50,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422317108] [2021-10-04 18:49:50,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:49:50,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:50,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:49:50,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:49:50,806 INFO L87 Difference]: Start difference. First operand 1910 states and 4906 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-04 18:49:51,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:51,169 INFO L93 Difference]: Finished difference Result 2042 states and 5170 transitions. [2021-10-04 18:49:51,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:49:51,169 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-04 18:49:51,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:51,174 INFO L225 Difference]: With dead ends: 2042 [2021-10-04 18:49:51,174 INFO L226 Difference]: Without dead ends: 2024 [2021-10-04 18:49:51,175 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 173.6ms TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2021-10-04 18:49:51,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2021-10-04 18:49:51,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 1912. [2021-10-04 18:49:51,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1912 states, 1911 states have (on average 2.568812140240712) internal successors, (4909), 1911 states have internal predecessors, (4909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 4909 transitions. [2021-10-04 18:49:51,201 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 4909 transitions. Word has length 38 [2021-10-04 18:49:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:51,202 INFO L470 AbstractCegarLoop]: Abstraction has 1912 states and 4909 transitions. [2021-10-04 18:49:51,202 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-04 18:49:51,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 4909 transitions. [2021-10-04 18:49:51,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:51,204 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:51,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-04 18:49:51,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-10-04 18:49:51,205 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-04 18:49:51,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:51,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1008070020, now seen corresponding path program 67 times [2021-10-04 18:49:51,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:51,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411326293] [2021-10-04 18:49:51,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:51,205 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:51,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:51,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411326293] [2021-10-04 18:49:51,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411326293] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:51,332 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:51,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:49:51,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407528244] [2021-10-04 18:49:51,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:49:51,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:51,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:49:51,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:49:51,334 INFO L87 Difference]: Start difference. First operand 1912 states and 4909 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-04 18:49:51,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:51,799 INFO L93 Difference]: Finished difference Result 2100 states and 5298 transitions. [2021-10-04 18:49:51,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:49:51,799 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-04 18:49:51,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:51,802 INFO L225 Difference]: With dead ends: 2100 [2021-10-04 18:49:51,803 INFO L226 Difference]: Without dead ends: 2084 [2021-10-04 18:49:51,803 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 192.9ms TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:49:51,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2021-10-04 18:49:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 1918. [2021-10-04 18:49:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1918 states, 1917 states have (on average 2.56546687532603) internal successors, (4918), 1917 states have internal predecessors, (4918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 4918 transitions. [2021-10-04 18:49:51,840 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 4918 transitions. Word has length 38 [2021-10-04 18:49:51,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:51,840 INFO L470 AbstractCegarLoop]: Abstraction has 1918 states and 4918 transitions. [2021-10-04 18:49:51,840 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-04 18:49:51,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 4918 transitions. [2021-10-04 18:49:51,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:51,844 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:51,844 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:51,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-10-04 18:49:51,845 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-04 18:49:51,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:51,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1940676970, now seen corresponding path program 68 times [2021-10-04 18:49:51,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:51,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811995751] [2021-10-04 18:49:51,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:51,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:51,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:51,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811995751] [2021-10-04 18:49:51,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811995751] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:51,954 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:51,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:49:51,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524891995] [2021-10-04 18:49:51,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:49:51,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:51,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:49:51,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:49:51,956 INFO L87 Difference]: Start difference. First operand 1918 states and 4918 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-04 18:49:52,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:52,664 INFO L93 Difference]: Finished difference Result 2776 states and 6866 transitions. [2021-10-04 18:49:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-04 18:49:52,665 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-04 18:49:52,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:52,669 INFO L225 Difference]: With dead ends: 2776 [2021-10-04 18:49:52,669 INFO L226 Difference]: Without dead ends: 2736 [2021-10-04 18:49:52,669 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 299.5ms TimeCoverageRelationStatistics Valid=218, Invalid=838, Unknown=0, NotChecked=0, Total=1056 [2021-10-04 18:49:52,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2021-10-04 18:49:52,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 1902. [2021-10-04 18:49:52,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1901 states have (on average 2.57127827459232) internal successors, (4888), 1901 states have internal predecessors, (4888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:52,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 4888 transitions. [2021-10-04 18:49:52,696 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 4888 transitions. Word has length 38 [2021-10-04 18:49:52,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:52,696 INFO L470 AbstractCegarLoop]: Abstraction has 1902 states and 4888 transitions. [2021-10-04 18:49:52,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-04 18:49:52,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 4888 transitions. [2021-10-04 18:49:52,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:52,698 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:52,699 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:52,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-10-04 18:49:52,699 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-04 18:49:52,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:52,699 INFO L82 PathProgramCache]: Analyzing trace with hash -224928786, now seen corresponding path program 69 times [2021-10-04 18:49:52,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:52,699 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344022467] [2021-10-04 18:49:52,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:52,700 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:52,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-04 18:49:52,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:52,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344022467] [2021-10-04 18:49:52,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344022467] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:52,778 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:52,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:49:52,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962541525] [2021-10-04 18:49:52,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:49:52,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:52,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:49:52,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:49:52,779 INFO L87 Difference]: Start difference. First operand 1902 states and 4888 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-04 18:49:53,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:53,053 INFO L93 Difference]: Finished difference Result 1892 states and 4774 transitions. [2021-10-04 18:49:53,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:49:53,054 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-04 18:49:53,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:53,058 INFO L225 Difference]: With dead ends: 1892 [2021-10-04 18:49:53,058 INFO L226 Difference]: Without dead ends: 1838 [2021-10-04 18:49:53,059 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 89.5ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-10-04 18:49:53,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2021-10-04 18:49:53,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1812. [2021-10-04 18:49:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1811 states have (on average 2.5367200441744893) internal successors, (4594), 1811 states have internal predecessors, (4594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 4594 transitions. [2021-10-04 18:49:53,092 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 4594 transitions. Word has length 38 [2021-10-04 18:49:53,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:53,093 INFO L470 AbstractCegarLoop]: Abstraction has 1812 states and 4594 transitions. [2021-10-04 18:49:53,093 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-04 18:49:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 4594 transitions. [2021-10-04 18:49:53,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:53,097 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:53,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-04 18:49:53,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-10-04 18:49:53,098 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-04 18:49:53,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:53,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1069869858, now seen corresponding path program 70 times [2021-10-04 18:49:53,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:53,099 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315510950] [2021-10-04 18:49:53,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:53,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:53,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:53,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:53,196 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315510950] [2021-10-04 18:49:53,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315510950] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:53,197 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:53,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:53,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797015787] [2021-10-04 18:49:53,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:53,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:53,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:53,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:53,199 INFO L87 Difference]: Start difference. First operand 1812 states and 4594 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:53,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:53,715 INFO L93 Difference]: Finished difference Result 2022 states and 5020 transitions. [2021-10-04 18:49:53,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-04 18:49:53,716 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:53,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:53,720 INFO L225 Difference]: With dead ends: 2022 [2021-10-04 18:49:53,721 INFO L226 Difference]: Without dead ends: 2002 [2021-10-04 18:49:53,721 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 212.3ms TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2021-10-04 18:49:53,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2021-10-04 18:49:53,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1812. [2021-10-04 18:49:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1811 states have (on average 2.533406957482054) internal successors, (4588), 1811 states have internal predecessors, (4588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:53,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 4588 transitions. [2021-10-04 18:49:53,756 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 4588 transitions. Word has length 38 [2021-10-04 18:49:53,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:53,756 INFO L470 AbstractCegarLoop]: Abstraction has 1812 states and 4588 transitions. [2021-10-04 18:49:53,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-04 18:49:53,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 4588 transitions. [2021-10-04 18:49:53,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:53,760 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:53,760 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:53,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-10-04 18:49:53,761 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-04 18:49:53,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:53,762 INFO L82 PathProgramCache]: Analyzing trace with hash -197824014, now seen corresponding path program 71 times [2021-10-04 18:49:53,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:53,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879819846] [2021-10-04 18:49:53,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:53,762 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:53,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-04 18:49:53,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:53,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879819846] [2021-10-04 18:49:53,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879819846] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:53,856 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:53,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:49:53,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637582497] [2021-10-04 18:49:53,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:49:53,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:53,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:49:53,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:49:53,858 INFO L87 Difference]: Start difference. First operand 1812 states and 4588 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-04 18:49:54,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:54,377 INFO L93 Difference]: Finished difference Result 2534 states and 6191 transitions. [2021-10-04 18:49:54,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-04 18:49:54,377 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-04 18:49:54,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:54,383 INFO L225 Difference]: With dead ends: 2534 [2021-10-04 18:49:54,383 INFO L226 Difference]: Without dead ends: 2516 [2021-10-04 18:49:54,384 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 187.9ms TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2021-10-04 18:49:54,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2021-10-04 18:49:54,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 1814. [2021-10-04 18:49:54,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1813 states have (on average 2.532266960838389) internal successors, (4591), 1813 states have internal predecessors, (4591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 4591 transitions. [2021-10-04 18:49:54,430 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 4591 transitions. Word has length 38 [2021-10-04 18:49:54,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:54,431 INFO L470 AbstractCegarLoop]: Abstraction has 1814 states and 4591 transitions. [2021-10-04 18:49:54,431 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-04 18:49:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 4591 transitions. [2021-10-04 18:49:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:54,436 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:54,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-04 18:49:54,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-10-04 18:49:54,437 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-04 18:49:54,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:54,438 INFO L82 PathProgramCache]: Analyzing trace with hash -151808708, now seen corresponding path program 72 times [2021-10-04 18:49:54,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:54,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205003174] [2021-10-04 18:49:54,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:54,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:54,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-04 18:49:54,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:54,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205003174] [2021-10-04 18:49:54,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205003174] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:54,550 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:54,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:54,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305653028] [2021-10-04 18:49:54,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:54,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:54,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:54,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:54,552 INFO L87 Difference]: Start difference. First operand 1814 states and 4591 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:55,168 INFO L93 Difference]: Finished difference Result 2594 states and 6319 transitions. [2021-10-04 18:49:55,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-04 18:49:55,168 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:55,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:55,172 INFO L225 Difference]: With dead ends: 2594 [2021-10-04 18:49:55,172 INFO L226 Difference]: Without dead ends: 2572 [2021-10-04 18:49:55,172 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 236.3ms TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2021-10-04 18:49:55,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2021-10-04 18:49:55,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 1806. [2021-10-04 18:49:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1805 states have (on average 2.535734072022161) internal successors, (4577), 1805 states have internal predecessors, (4577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 4577 transitions. [2021-10-04 18:49:55,197 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 4577 transitions. Word has length 38 [2021-10-04 18:49:55,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:55,198 INFO L470 AbstractCegarLoop]: Abstraction has 1806 states and 4577 transitions. [2021-10-04 18:49:55,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:55,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 4577 transitions. [2021-10-04 18:49:55,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:55,201 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:55,201 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:55,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-10-04 18:49:55,201 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-04 18:49:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash 8810590, now seen corresponding path program 73 times [2021-10-04 18:49:55,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:55,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223738611] [2021-10-04 18:49:55,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:55,202 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:55,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:55,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:55,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223738611] [2021-10-04 18:49:55,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223738611] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:55,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:55,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:49:55,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176322450] [2021-10-04 18:49:55,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:49:55,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:55,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:49:55,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:49:55,310 INFO L87 Difference]: Start difference. First operand 1806 states and 4577 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-04 18:49:55,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:55,911 INFO L93 Difference]: Finished difference Result 2014 states and 4998 transitions. [2021-10-04 18:49:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-04 18:49:55,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-04 18:49:55,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:55,914 INFO L225 Difference]: With dead ends: 2014 [2021-10-04 18:49:55,914 INFO L226 Difference]: Without dead ends: 1990 [2021-10-04 18:49:55,915 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 276.0ms TimeCoverageRelationStatistics Valid=197, Invalid=615, Unknown=0, NotChecked=0, Total=812 [2021-10-04 18:49:55,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2021-10-04 18:49:55,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1804. [2021-10-04 18:49:55,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 2.535773710482529) internal successors, (4572), 1803 states have internal predecessors, (4572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:55,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 4572 transitions. [2021-10-04 18:49:55,939 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 4572 transitions. Word has length 38 [2021-10-04 18:49:55,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:55,939 INFO L470 AbstractCegarLoop]: Abstraction has 1804 states and 4572 transitions. [2021-10-04 18:49:55,939 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-04 18:49:55,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 4572 transitions. [2021-10-04 18:49:55,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:55,942 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:55,942 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:55,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-10-04 18:49:55,943 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-04 18:49:55,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:55,943 INFO L82 PathProgramCache]: Analyzing trace with hash 805498388, now seen corresponding path program 74 times [2021-10-04 18:49:55,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:55,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746331963] [2021-10-04 18:49:55,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:55,944 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:56,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:56,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746331963] [2021-10-04 18:49:56,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746331963] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:56,054 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:56,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:49:56,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378288538] [2021-10-04 18:49:56,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:49:56,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:56,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:49:56,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:49:56,056 INFO L87 Difference]: Start difference. First operand 1804 states and 4572 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-04 18:49:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:56,569 INFO L93 Difference]: Finished difference Result 1920 states and 4792 transitions. [2021-10-04 18:49:56,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-04 18:49:56,570 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-04 18:49:56,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:56,573 INFO L225 Difference]: With dead ends: 1920 [2021-10-04 18:49:56,573 INFO L226 Difference]: Without dead ends: 1886 [2021-10-04 18:49:56,573 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 224.1ms TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2021-10-04 18:49:56,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2021-10-04 18:49:56,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1798. [2021-10-04 18:49:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1797 states have (on average 2.5336672231496937) internal successors, (4553), 1797 states have internal predecessors, (4553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 4553 transitions. [2021-10-04 18:49:56,596 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 4553 transitions. Word has length 38 [2021-10-04 18:49:56,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:56,596 INFO L470 AbstractCegarLoop]: Abstraction has 1798 states and 4553 transitions. [2021-10-04 18:49:56,596 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-04 18:49:56,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 4553 transitions. [2021-10-04 18:49:56,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:56,598 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:56,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-04 18:49:56,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-10-04 18:49:56,599 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-04 18:49:56,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:56,600 INFO L82 PathProgramCache]: Analyzing trace with hash -210858896, now seen corresponding path program 75 times [2021-10-04 18:49:56,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:56,600 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58059861] [2021-10-04 18:49:56,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:56,600 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:56,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:56,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58059861] [2021-10-04 18:49:56,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58059861] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:56,681 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:56,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:49:56,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089965666] [2021-10-04 18:49:56,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:49:56,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:56,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:49:56,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:49:56,683 INFO L87 Difference]: Start difference. First operand 1798 states and 4553 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-04 18:49:57,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:57,031 INFO L93 Difference]: Finished difference Result 1652 states and 4092 transitions. [2021-10-04 18:49:57,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:49:57,031 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-04 18:49:57,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:57,034 INFO L225 Difference]: With dead ends: 1652 [2021-10-04 18:49:57,034 INFO L226 Difference]: Without dead ends: 1588 [2021-10-04 18:49:57,034 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 142.3ms TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2021-10-04 18:49:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2021-10-04 18:49:57,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1516. [2021-10-04 18:49:57,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 1515 states have (on average 2.5366336633663367) internal successors, (3843), 1515 states have internal predecessors, (3843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 3843 transitions. [2021-10-04 18:49:57,052 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 3843 transitions. Word has length 38 [2021-10-04 18:49:57,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:57,052 INFO L470 AbstractCegarLoop]: Abstraction has 1516 states and 3843 transitions. [2021-10-04 18:49:57,052 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-04 18:49:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 3843 transitions. [2021-10-04 18:49:57,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:57,054 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:57,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-04 18:49:57,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-10-04 18:49:57,055 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-04 18:49:57,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:57,055 INFO L82 PathProgramCache]: Analyzing trace with hash 782386808, now seen corresponding path program 76 times [2021-10-04 18:49:57,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:57,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757656445] [2021-10-04 18:49:57,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:57,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:57,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:57,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757656445] [2021-10-04 18:49:57,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757656445] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:57,170 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:57,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:49:57,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998579279] [2021-10-04 18:49:57,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:49:57,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:57,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:49:57,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:49:57,172 INFO L87 Difference]: Start difference. First operand 1516 states and 3843 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-04 18:49:57,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:57,706 INFO L93 Difference]: Finished difference Result 1636 states and 4076 transitions. [2021-10-04 18:49:57,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-04 18:49:57,707 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:57,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:57,709 INFO L225 Difference]: With dead ends: 1636 [2021-10-04 18:49:57,709 INFO L226 Difference]: Without dead ends: 1612 [2021-10-04 18:49:57,710 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 253.7ms TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2021-10-04 18:49:57,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2021-10-04 18:49:57,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1514. [2021-10-04 18:49:57,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1513 states have (on average 2.5366820885657635) internal successors, (3838), 1513 states have internal predecessors, (3838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 3838 transitions. [2021-10-04 18:49:57,727 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 3838 transitions. Word has length 38 [2021-10-04 18:49:57,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:57,728 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 3838 transitions. [2021-10-04 18:49:57,728 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-04 18:49:57,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 3838 transitions. [2021-10-04 18:49:57,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:57,730 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:57,730 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:57,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-10-04 18:49:57,730 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-04 18:49:57,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:57,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1085318438, now seen corresponding path program 77 times [2021-10-04 18:49:57,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:57,731 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844916487] [2021-10-04 18:49:57,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:57,731 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:57,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:57,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844916487] [2021-10-04 18:49:57,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844916487] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:57,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:57,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:49:57,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729316334] [2021-10-04 18:49:57,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:49:57,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:57,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:49:57,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:49:57,829 INFO L87 Difference]: Start difference. First operand 1514 states and 3838 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-04 18:49:58,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:58,225 INFO L93 Difference]: Finished difference Result 2118 states and 5268 transitions. [2021-10-04 18:49:58,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-04 18:49:58,226 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-04 18:49:58,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:58,229 INFO L225 Difference]: With dead ends: 2118 [2021-10-04 18:49:58,229 INFO L226 Difference]: Without dead ends: 2078 [2021-10-04 18:49:58,230 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 152.1ms TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:49:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2021-10-04 18:49:58,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1518. [2021-10-04 18:49:58,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1517 states have (on average 2.5379037574159526) internal successors, (3850), 1517 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:58,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 3850 transitions. [2021-10-04 18:49:58,250 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 3850 transitions. Word has length 38 [2021-10-04 18:49:58,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:58,250 INFO L470 AbstractCegarLoop]: Abstraction has 1518 states and 3850 transitions. [2021-10-04 18:49:58,250 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-04 18:49:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 3850 transitions. [2021-10-04 18:49:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:58,252 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:58,252 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:58,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-10-04 18:49:58,252 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-04 18:49:58,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:58,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1039303132, now seen corresponding path program 78 times [2021-10-04 18:49:58,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:58,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108713738] [2021-10-04 18:49:58,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:58,254 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:58,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:58,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108713738] [2021-10-04 18:49:58,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108713738] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:58,347 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:58,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:49:58,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101679923] [2021-10-04 18:49:58,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:49:58,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:58,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:49:58,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:49:58,349 INFO L87 Difference]: Start difference. First operand 1518 states and 3850 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:58,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:58,848 INFO L93 Difference]: Finished difference Result 2090 states and 5165 transitions. [2021-10-04 18:49:58,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-04 18:49:58,849 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:49:58,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:58,852 INFO L225 Difference]: With dead ends: 2090 [2021-10-04 18:49:58,852 INFO L226 Difference]: Without dead ends: 2074 [2021-10-04 18:49:58,852 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 189.7ms TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2021-10-04 18:49:58,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2021-10-04 18:49:58,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 1516. [2021-10-04 18:49:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 1515 states have (on average 2.537953795379538) internal successors, (3845), 1515 states have internal predecessors, (3845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 3845 transitions. [2021-10-04 18:49:58,873 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 3845 transitions. Word has length 38 [2021-10-04 18:49:58,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:58,873 INFO L470 AbstractCegarLoop]: Abstraction has 1516 states and 3845 transitions. [2021-10-04 18:49:58,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-04 18:49:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 3845 transitions. [2021-10-04 18:49:58,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:58,875 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:58,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-04 18:49:58,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-10-04 18:49:58,876 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-04 18:49:58,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:58,876 INFO L82 PathProgramCache]: Analyzing trace with hash -2028289890, now seen corresponding path program 79 times [2021-10-04 18:49:58,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:58,876 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945727305] [2021-10-04 18:49:58,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:58,877 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:58,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:58,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:58,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945727305] [2021-10-04 18:49:58,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945727305] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:58,968 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:58,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:49:58,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853838717] [2021-10-04 18:49:58,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:49:58,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:58,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:49:58,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:49:58,969 INFO L87 Difference]: Start difference. First operand 1516 states and 3845 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-04 18:49:59,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:59,386 INFO L93 Difference]: Finished difference Result 2088 states and 5151 transitions. [2021-10-04 18:49:59,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-04 18:49:59,386 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-04 18:49:59,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:59,389 INFO L225 Difference]: With dead ends: 2088 [2021-10-04 18:49:59,389 INFO L226 Difference]: Without dead ends: 2048 [2021-10-04 18:49:59,390 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 144.2ms TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:49:59,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2021-10-04 18:49:59,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 1504. [2021-10-04 18:49:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1503 states have (on average 2.5302727877578177) internal successors, (3803), 1503 states have internal predecessors, (3803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:59,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 3803 transitions. [2021-10-04 18:49:59,410 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 3803 transitions. Word has length 38 [2021-10-04 18:49:59,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:59,411 INFO L470 AbstractCegarLoop]: Abstraction has 1504 states and 3803 transitions. [2021-10-04 18:49:59,411 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-04 18:49:59,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 3803 transitions. [2021-10-04 18:49:59,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:59,413 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:59,413 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:59,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-10-04 18:49:59,413 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-04 18:49:59,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:59,413 INFO L82 PathProgramCache]: Analyzing trace with hash 65516964, now seen corresponding path program 80 times [2021-10-04 18:49:59,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:59,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860462973] [2021-10-04 18:49:59,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:59,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:49:59,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:49:59,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:49:59,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860462973] [2021-10-04 18:49:59,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860462973] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:49:59,503 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:49:59,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:49:59,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566212086] [2021-10-04 18:49:59,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:49:59,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:49:59,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:49:59,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:49:59,504 INFO L87 Difference]: Start difference. First operand 1504 states and 3803 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-04 18:49:59,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:49:59,928 INFO L93 Difference]: Finished difference Result 2026 states and 5008 transitions. [2021-10-04 18:49:59,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-04 18:49:59,929 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-04 18:49:59,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:49:59,932 INFO L225 Difference]: With dead ends: 2026 [2021-10-04 18:49:59,932 INFO L226 Difference]: Without dead ends: 2012 [2021-10-04 18:49:59,932 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 152.1ms TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:49:59,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2021-10-04 18:49:59,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 1502. [2021-10-04 18:49:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1501 states have (on average 2.530313124583611) internal successors, (3798), 1501 states have internal predecessors, (3798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:49:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 3798 transitions. [2021-10-04 18:49:59,952 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 3798 transitions. Word has length 38 [2021-10-04 18:49:59,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:49:59,952 INFO L470 AbstractCegarLoop]: Abstraction has 1502 states and 3798 transitions. [2021-10-04 18:49:59,952 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-04 18:49:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 3798 transitions. [2021-10-04 18:49:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:49:59,954 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:49:59,954 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:49:59,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-10-04 18:49:59,955 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-04 18:49:59,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:49:59,955 INFO L82 PathProgramCache]: Analyzing trace with hash 764796616, now seen corresponding path program 81 times [2021-10-04 18:49:59,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:49:59,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012879423] [2021-10-04 18:49:59,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:49:59,956 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:49:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:00,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-04 18:50:00,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:00,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012879423] [2021-10-04 18:50:00,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012879423] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:00,060 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:00,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:00,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800069172] [2021-10-04 18:50:00,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:00,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:00,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:00,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:00,062 INFO L87 Difference]: Start difference. First operand 1502 states and 3798 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:00,585 INFO L93 Difference]: Finished difference Result 2062 states and 5072 transitions. [2021-10-04 18:50:00,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-04 18:50:00,585 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:00,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:00,589 INFO L225 Difference]: With dead ends: 2062 [2021-10-04 18:50:00,589 INFO L226 Difference]: Without dead ends: 2030 [2021-10-04 18:50:00,589 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 210.2ms TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2021-10-04 18:50:00,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2021-10-04 18:50:00,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 1480. [2021-10-04 18:50:00,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1479 states have (on average 2.5253549695740367) internal successors, (3735), 1479 states have internal predecessors, (3735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:00,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 3735 transitions. [2021-10-04 18:50:00,608 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 3735 transitions. Word has length 38 [2021-10-04 18:50:00,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:00,609 INFO L470 AbstractCegarLoop]: Abstraction has 1480 states and 3735 transitions. [2021-10-04 18:50:00,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:00,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 3735 transitions. [2021-10-04 18:50:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:00,611 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:00,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-04 18:50:00,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-10-04 18:50:00,611 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-04 18:50:00,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:00,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1274107758, now seen corresponding path program 82 times [2021-10-04 18:50:00,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:00,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525816868] [2021-10-04 18:50:00,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:00,612 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:00,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:00,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525816868] [2021-10-04 18:50:00,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525816868] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:00,707 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:00,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:00,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008653915] [2021-10-04 18:50:00,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:00,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:00,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:00,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:00,708 INFO L87 Difference]: Start difference. First operand 1480 states and 3735 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-04 18:50:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:01,143 INFO L93 Difference]: Finished difference Result 1606 states and 3965 transitions. [2021-10-04 18:50:01,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:50:01,143 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-04 18:50:01,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:01,146 INFO L225 Difference]: With dead ends: 1606 [2021-10-04 18:50:01,146 INFO L226 Difference]: Without dead ends: 1584 [2021-10-04 18:50:01,146 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 196.6ms TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:50:01,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2021-10-04 18:50:01,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1476. [2021-10-04 18:50:01,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1475 states have (on average 2.526779661016949) internal successors, (3727), 1475 states have internal predecessors, (3727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 3727 transitions. [2021-10-04 18:50:01,164 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 3727 transitions. Word has length 38 [2021-10-04 18:50:01,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:01,164 INFO L470 AbstractCegarLoop]: Abstraction has 1476 states and 3727 transitions. [2021-10-04 18:50:01,164 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-04 18:50:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 3727 transitions. [2021-10-04 18:50:01,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:01,166 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:01,166 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:01,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-10-04 18:50:01,167 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-04 18:50:01,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:01,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1131021346, now seen corresponding path program 83 times [2021-10-04 18:50:01,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:01,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886538105] [2021-10-04 18:50:01,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:01,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:01,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:01,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:01,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886538105] [2021-10-04 18:50:01,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886538105] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:01,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:01,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:01,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152238066] [2021-10-04 18:50:01,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:01,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:01,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:01,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:01,276 INFO L87 Difference]: Start difference. First operand 1476 states and 3727 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-04 18:50:01,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:01,760 INFO L93 Difference]: Finished difference Result 1604 states and 3955 transitions. [2021-10-04 18:50:01,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-04 18:50:01,760 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:01,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:01,763 INFO L225 Difference]: With dead ends: 1604 [2021-10-04 18:50:01,763 INFO L226 Difference]: Without dead ends: 1580 [2021-10-04 18:50:01,763 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 209.1ms TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2021-10-04 18:50:01,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2021-10-04 18:50:01,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1470. [2021-10-04 18:50:01,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 1469 states have (on average 2.5268890401633763) internal successors, (3712), 1469 states have internal predecessors, (3712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 3712 transitions. [2021-10-04 18:50:01,781 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 3712 transitions. Word has length 38 [2021-10-04 18:50:01,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:01,781 INFO L470 AbstractCegarLoop]: Abstraction has 1470 states and 3712 transitions. [2021-10-04 18:50:01,781 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-04 18:50:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 3712 transitions. [2021-10-04 18:50:01,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:01,783 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:01,783 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:01,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-10-04 18:50:01,783 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-04 18:50:01,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:01,784 INFO L82 PathProgramCache]: Analyzing trace with hash 201625720, now seen corresponding path program 84 times [2021-10-04 18:50:01,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:01,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721330985] [2021-10-04 18:50:01,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:01,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:01,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:01,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721330985] [2021-10-04 18:50:01,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721330985] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:01,883 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:01,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:01,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395030185] [2021-10-04 18:50:01,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:01,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:01,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:01,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:01,884 INFO L87 Difference]: Start difference. First operand 1470 states and 3712 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-04 18:50:02,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:02,414 INFO L93 Difference]: Finished difference Result 1586 states and 3927 transitions. [2021-10-04 18:50:02,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-04 18:50:02,415 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-04 18:50:02,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:02,417 INFO L225 Difference]: With dead ends: 1586 [2021-10-04 18:50:02,417 INFO L226 Difference]: Without dead ends: 1560 [2021-10-04 18:50:02,418 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 218.8ms TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2021-10-04 18:50:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2021-10-04 18:50:02,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1462. [2021-10-04 18:50:02,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1461 states have (on average 2.5270362765229293) internal successors, (3692), 1461 states have internal predecessors, (3692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 3692 transitions. [2021-10-04 18:50:02,437 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 3692 transitions. Word has length 38 [2021-10-04 18:50:02,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:02,437 INFO L470 AbstractCegarLoop]: Abstraction has 1462 states and 3692 transitions. [2021-10-04 18:50:02,437 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-04 18:50:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 3692 transitions. [2021-10-04 18:50:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:02,440 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:02,440 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:02,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-10-04 18:50:02,440 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-04 18:50:02,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:02,441 INFO L82 PathProgramCache]: Analyzing trace with hash 376545520, now seen corresponding path program 85 times [2021-10-04 18:50:02,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:02,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095673700] [2021-10-04 18:50:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:02,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:02,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-04 18:50:02,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:02,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095673700] [2021-10-04 18:50:02,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095673700] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:02,542 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:02,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:02,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843246880] [2021-10-04 18:50:02,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:02,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:02,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:02,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:02,544 INFO L87 Difference]: Start difference. First operand 1462 states and 3692 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:03,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:03,100 INFO L93 Difference]: Finished difference Result 2134 states and 5265 transitions. [2021-10-04 18:50:03,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-04 18:50:03,101 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:03,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:03,104 INFO L225 Difference]: With dead ends: 2134 [2021-10-04 18:50:03,104 INFO L226 Difference]: Without dead ends: 2090 [2021-10-04 18:50:03,104 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 222.1ms TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2021-10-04 18:50:03,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2021-10-04 18:50:03,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 1438. [2021-10-04 18:50:03,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 1437 states have (on average 2.535838552540014) internal successors, (3644), 1437 states have internal predecessors, (3644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 3644 transitions. [2021-10-04 18:50:03,126 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 3644 transitions. Word has length 38 [2021-10-04 18:50:03,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:03,126 INFO L470 AbstractCegarLoop]: Abstraction has 1438 states and 3644 transitions. [2021-10-04 18:50:03,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-04 18:50:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 3644 transitions. [2021-10-04 18:50:03,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:03,129 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:03,129 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:03,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-10-04 18:50:03,129 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-04 18:50:03,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:03,130 INFO L82 PathProgramCache]: Analyzing trace with hash 889478410, now seen corresponding path program 86 times [2021-10-04 18:50:03,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:03,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566576551] [2021-10-04 18:50:03,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:03,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:03,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:03,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566576551] [2021-10-04 18:50:03,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566576551] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:03,214 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:03,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:50:03,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297615824] [2021-10-04 18:50:03,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:50:03,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:03,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:50:03,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:50:03,216 INFO L87 Difference]: Start difference. First operand 1438 states and 3644 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-04 18:50:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:03,585 INFO L93 Difference]: Finished difference Result 1544 states and 3850 transitions. [2021-10-04 18:50:03,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-04 18:50:03,585 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-04 18:50:03,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:03,587 INFO L225 Difference]: With dead ends: 1544 [2021-10-04 18:50:03,587 INFO L226 Difference]: Without dead ends: 1530 [2021-10-04 18:50:03,588 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 140.5ms TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:50:03,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2021-10-04 18:50:03,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1438. [2021-10-04 18:50:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 1437 states have (on average 2.531663187195546) internal successors, (3638), 1437 states have internal predecessors, (3638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:03,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 3638 transitions. [2021-10-04 18:50:03,605 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 3638 transitions. Word has length 38 [2021-10-04 18:50:03,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:03,605 INFO L470 AbstractCegarLoop]: Abstraction has 1438 states and 3638 transitions. [2021-10-04 18:50:03,605 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-04 18:50:03,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 3638 transitions. [2021-10-04 18:50:03,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:03,607 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:03,607 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:03,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-10-04 18:50:03,607 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-04 18:50:03,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:03,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1805743434, now seen corresponding path program 87 times [2021-10-04 18:50:03,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:03,608 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432781103] [2021-10-04 18:50:03,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:03,608 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:03,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:03,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:03,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432781103] [2021-10-04 18:50:03,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432781103] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:03,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:03,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:50:03,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37778790] [2021-10-04 18:50:03,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:50:03,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:03,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:50:03,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:50:03,692 INFO L87 Difference]: Start difference. First operand 1438 states and 3638 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-04 18:50:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:04,274 INFO L93 Difference]: Finished difference Result 2148 states and 5241 transitions. [2021-10-04 18:50:04,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-04 18:50:04,275 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-04 18:50:04,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:04,279 INFO L225 Difference]: With dead ends: 2148 [2021-10-04 18:50:04,280 INFO L226 Difference]: Without dead ends: 2106 [2021-10-04 18:50:04,280 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 207.5ms TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2021-10-04 18:50:04,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2021-10-04 18:50:04,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 1422. [2021-10-04 18:50:04,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1421 states have (on average 2.539057002111189) internal successors, (3608), 1421 states have internal predecessors, (3608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 3608 transitions. [2021-10-04 18:50:04,312 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 3608 transitions. Word has length 38 [2021-10-04 18:50:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:04,313 INFO L470 AbstractCegarLoop]: Abstraction has 1422 states and 3608 transitions. [2021-10-04 18:50:04,313 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-04 18:50:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 3608 transitions. [2021-10-04 18:50:04,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:04,316 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:04,316 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:04,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-10-04 18:50:04,316 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-04 18:50:04,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:04,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1297476270, now seen corresponding path program 88 times [2021-10-04 18:50:04,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:04,317 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681858460] [2021-10-04 18:50:04,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:04,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:04,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-04 18:50:04,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:04,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681858460] [2021-10-04 18:50:04,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681858460] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:04,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:04,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:04,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442058486] [2021-10-04 18:50:04,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:04,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:04,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:04,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:04,435 INFO L87 Difference]: Start difference. First operand 1422 states and 3608 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:04,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:04,915 INFO L93 Difference]: Finished difference Result 1528 states and 3810 transitions. [2021-10-04 18:50:04,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-04 18:50:04,915 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:04,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:04,918 INFO L225 Difference]: With dead ends: 1528 [2021-10-04 18:50:04,918 INFO L226 Difference]: Without dead ends: 1508 [2021-10-04 18:50:04,918 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 214.1ms TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:50:04,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2021-10-04 18:50:04,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1422. [2021-10-04 18:50:04,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1421 states have (on average 2.5362420830401127) internal successors, (3604), 1421 states have internal predecessors, (3604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 3604 transitions. [2021-10-04 18:50:04,938 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 3604 transitions. Word has length 38 [2021-10-04 18:50:04,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:04,938 INFO L470 AbstractCegarLoop]: Abstraction has 1422 states and 3604 transitions. [2021-10-04 18:50:04,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-04 18:50:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 3604 transitions. [2021-10-04 18:50:04,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:04,941 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:04,941 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:04,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-10-04 18:50:04,941 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-04 18:50:04,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:04,941 INFO L82 PathProgramCache]: Analyzing trace with hash -966412604, now seen corresponding path program 89 times [2021-10-04 18:50:04,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:04,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549511211] [2021-10-04 18:50:04,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:04,942 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:05,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-04 18:50:05,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:05,036 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549511211] [2021-10-04 18:50:05,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549511211] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:05,036 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:05,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:05,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403531475] [2021-10-04 18:50:05,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:05,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:05,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:05,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:05,038 INFO L87 Difference]: Start difference. First operand 1422 states and 3604 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:05,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:05,525 INFO L93 Difference]: Finished difference Result 1532 states and 3811 transitions. [2021-10-04 18:50:05,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-04 18:50:05,526 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:05,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:05,529 INFO L225 Difference]: With dead ends: 1532 [2021-10-04 18:50:05,530 INFO L226 Difference]: Without dead ends: 1498 [2021-10-04 18:50:05,530 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 171.9ms TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:50:05,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2021-10-04 18:50:05,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1410. [2021-10-04 18:50:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1409 states have (on average 2.5330021291696236) internal successors, (3569), 1409 states have internal predecessors, (3569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 3569 transitions. [2021-10-04 18:50:05,555 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 3569 transitions. Word has length 38 [2021-10-04 18:50:05,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:05,556 INFO L470 AbstractCegarLoop]: Abstraction has 1410 states and 3569 transitions. [2021-10-04 18:50:05,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:05,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 3569 transitions. [2021-10-04 18:50:05,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:05,559 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:05,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-04 18:50:05,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-10-04 18:50:05,560 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-04 18:50:05,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:05,560 INFO L82 PathProgramCache]: Analyzing trace with hash -340137644, now seen corresponding path program 90 times [2021-10-04 18:50:05,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:05,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941861913] [2021-10-04 18:50:05,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:05,561 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:05,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:05,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:05,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941861913] [2021-10-04 18:50:05,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941861913] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:05,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:05,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:05,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313840594] [2021-10-04 18:50:05,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:05,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:05,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:05,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:05,655 INFO L87 Difference]: Start difference. First operand 1410 states and 3569 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:06,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:06,058 INFO L93 Difference]: Finished difference Result 1508 states and 3760 transitions. [2021-10-04 18:50:06,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-04 18:50:06,059 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:06,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:06,061 INFO L225 Difference]: With dead ends: 1508 [2021-10-04 18:50:06,061 INFO L226 Difference]: Without dead ends: 1488 [2021-10-04 18:50:06,061 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 188.8ms TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:50:06,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2021-10-04 18:50:06,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1406. [2021-10-04 18:50:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1405 states have (on average 2.5338078291814945) internal successors, (3560), 1405 states have internal predecessors, (3560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 3560 transitions. [2021-10-04 18:50:06,078 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 3560 transitions. Word has length 38 [2021-10-04 18:50:06,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:06,078 INFO L470 AbstractCegarLoop]: Abstraction has 1406 states and 3560 transitions. [2021-10-04 18:50:06,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:06,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 3560 transitions. [2021-10-04 18:50:06,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:06,080 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:06,080 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:06,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-10-04 18:50:06,081 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-04 18:50:06,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:06,081 INFO L82 PathProgramCache]: Analyzing trace with hash -71123372, now seen corresponding path program 91 times [2021-10-04 18:50:06,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:06,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702377646] [2021-10-04 18:50:06,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:06,081 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:06,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:06,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702377646] [2021-10-04 18:50:06,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702377646] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:06,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:06,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:50:06,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189120891] [2021-10-04 18:50:06,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:50:06,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:06,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:50:06,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:50:06,173 INFO L87 Difference]: Start difference. First operand 1406 states and 3560 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-04 18:50:06,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:06,604 INFO L93 Difference]: Finished difference Result 2212 states and 5465 transitions. [2021-10-04 18:50:06,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-04 18:50:06,605 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-04 18:50:06,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:06,608 INFO L225 Difference]: With dead ends: 2212 [2021-10-04 18:50:06,608 INFO L226 Difference]: Without dead ends: 2164 [2021-10-04 18:50:06,609 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 169.0ms TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:50:06,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2021-10-04 18:50:06,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 1408. [2021-10-04 18:50:06,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1407 states have (on average 2.5366027007818053) internal successors, (3569), 1407 states have internal predecessors, (3569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 3569 transitions. [2021-10-04 18:50:06,629 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 3569 transitions. Word has length 38 [2021-10-04 18:50:06,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:06,629 INFO L470 AbstractCegarLoop]: Abstraction has 1408 states and 3569 transitions. [2021-10-04 18:50:06,629 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-04 18:50:06,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 3569 transitions. [2021-10-04 18:50:06,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:06,631 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:06,631 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:06,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-10-04 18:50:06,631 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-04 18:50:06,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:06,631 INFO L82 PathProgramCache]: Analyzing trace with hash 174913284, now seen corresponding path program 92 times [2021-10-04 18:50:06,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:06,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20367998] [2021-10-04 18:50:06,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:06,632 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:06,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:06,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:06,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20367998] [2021-10-04 18:50:06,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20367998] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:06,729 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:06,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:06,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363872916] [2021-10-04 18:50:06,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:06,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:06,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:06,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:06,731 INFO L87 Difference]: Start difference. First operand 1408 states and 3569 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:07,225 INFO L93 Difference]: Finished difference Result 2006 states and 4954 transitions. [2021-10-04 18:50:07,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-04 18:50:07,225 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:07,229 INFO L225 Difference]: With dead ends: 2006 [2021-10-04 18:50:07,229 INFO L226 Difference]: Without dead ends: 1982 [2021-10-04 18:50:07,229 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 202.9ms TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2021-10-04 18:50:07,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2021-10-04 18:50:07,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1390. [2021-10-04 18:50:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1389 states have (on average 2.525557955363571) internal successors, (3508), 1389 states have internal predecessors, (3508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:07,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 3508 transitions. [2021-10-04 18:50:07,248 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 3508 transitions. Word has length 38 [2021-10-04 18:50:07,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:07,249 INFO L470 AbstractCegarLoop]: Abstraction has 1390 states and 3508 transitions. [2021-10-04 18:50:07,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:07,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 3508 transitions. [2021-10-04 18:50:07,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:07,250 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:07,251 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:07,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-10-04 18:50:07,251 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-04 18:50:07,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:07,251 INFO L82 PathProgramCache]: Analyzing trace with hash -896028732, now seen corresponding path program 93 times [2021-10-04 18:50:07,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:07,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681227177] [2021-10-04 18:50:07,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:07,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:07,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:07,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:07,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681227177] [2021-10-04 18:50:07,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681227177] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:07,331 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:07,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:50:07,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470233354] [2021-10-04 18:50:07,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:50:07,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:07,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:50:07,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:50:07,332 INFO L87 Difference]: Start difference. First operand 1390 states and 3508 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-04 18:50:07,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:07,718 INFO L93 Difference]: Finished difference Result 1994 states and 4880 transitions. [2021-10-04 18:50:07,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:50:07,719 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-04 18:50:07,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:07,725 INFO L225 Difference]: With dead ends: 1994 [2021-10-04 18:50:07,725 INFO L226 Difference]: Without dead ends: 1958 [2021-10-04 18:50:07,725 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 132.2ms TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:50:07,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2021-10-04 18:50:07,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1372. [2021-10-04 18:50:07,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1371 states have (on average 2.5229759299781183) internal successors, (3459), 1371 states have internal predecessors, (3459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 3459 transitions. [2021-10-04 18:50:07,762 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 3459 transitions. Word has length 38 [2021-10-04 18:50:07,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:07,762 INFO L470 AbstractCegarLoop]: Abstraction has 1372 states and 3459 transitions. [2021-10-04 18:50:07,762 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-04 18:50:07,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 3459 transitions. [2021-10-04 18:50:07,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:07,765 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:07,765 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:07,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-10-04 18:50:07,767 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-04 18:50:07,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:07,767 INFO L82 PathProgramCache]: Analyzing trace with hash 913023252, now seen corresponding path program 94 times [2021-10-04 18:50:07,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:07,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28198151] [2021-10-04 18:50:07,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:07,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:07,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:07,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28198151] [2021-10-04 18:50:07,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28198151] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:07,863 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:07,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:50:07,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149236662] [2021-10-04 18:50:07,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:50:07,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:07,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:50:07,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:50:07,864 INFO L87 Difference]: Start difference. First operand 1372 states and 3459 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-04 18:50:08,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:08,282 INFO L93 Difference]: Finished difference Result 1930 states and 4728 transitions. [2021-10-04 18:50:08,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-04 18:50:08,283 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-04 18:50:08,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:08,287 INFO L225 Difference]: With dead ends: 1930 [2021-10-04 18:50:08,287 INFO L226 Difference]: Without dead ends: 1898 [2021-10-04 18:50:08,288 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 155.5ms TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:50:08,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2021-10-04 18:50:08,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1336. [2021-10-04 18:50:08,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1335 states have (on average 2.5235955056179775) internal successors, (3369), 1335 states have internal predecessors, (3369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 3369 transitions. [2021-10-04 18:50:08,306 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 3369 transitions. Word has length 38 [2021-10-04 18:50:08,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:08,307 INFO L470 AbstractCegarLoop]: Abstraction has 1336 states and 3369 transitions. [2021-10-04 18:50:08,307 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-04 18:50:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 3369 transitions. [2021-10-04 18:50:08,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:08,308 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:08,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-04 18:50:08,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-10-04 18:50:08,309 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-04 18:50:08,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:08,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1271379452, now seen corresponding path program 95 times [2021-10-04 18:50:08,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:08,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780367933] [2021-10-04 18:50:08,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:08,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:08,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:08,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780367933] [2021-10-04 18:50:08,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780367933] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:08,417 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:08,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:08,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004970260] [2021-10-04 18:50:08,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:08,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:08,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:08,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:08,419 INFO L87 Difference]: Start difference. First operand 1336 states and 3369 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-04 18:50:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:08,879 INFO L93 Difference]: Finished difference Result 1438 states and 3563 transitions. [2021-10-04 18:50:08,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:50:08,879 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-04 18:50:08,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:08,883 INFO L225 Difference]: With dead ends: 1438 [2021-10-04 18:50:08,883 INFO L226 Difference]: Without dead ends: 1414 [2021-10-04 18:50:08,883 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 225.2ms TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:50:08,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2021-10-04 18:50:08,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1330. [2021-10-04 18:50:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1329 states have (on average 2.525959367945824) internal successors, (3357), 1329 states have internal predecessors, (3357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 3357 transitions. [2021-10-04 18:50:08,900 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 3357 transitions. Word has length 38 [2021-10-04 18:50:08,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:08,900 INFO L470 AbstractCegarLoop]: Abstraction has 1330 states and 3357 transitions. [2021-10-04 18:50:08,900 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-04 18:50:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 3357 transitions. [2021-10-04 18:50:08,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:08,902 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:08,902 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:08,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-10-04 18:50:08,903 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-04 18:50:08,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:08,903 INFO L82 PathProgramCache]: Analyzing trace with hash 229862420, now seen corresponding path program 96 times [2021-10-04 18:50:08,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:08,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291724927] [2021-10-04 18:50:08,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:08,903 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:09,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-04 18:50:09,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:09,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291724927] [2021-10-04 18:50:09,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291724927] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:09,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:09,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:09,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067402863] [2021-10-04 18:50:09,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:09,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:09,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:09,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:09,005 INFO L87 Difference]: Start difference. First operand 1330 states and 3357 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-04 18:50:09,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:09,476 INFO L93 Difference]: Finished difference Result 1450 states and 3578 transitions. [2021-10-04 18:50:09,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-04 18:50:09,476 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-04 18:50:09,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:09,479 INFO L225 Difference]: With dead ends: 1450 [2021-10-04 18:50:09,479 INFO L226 Difference]: Without dead ends: 1426 [2021-10-04 18:50:09,480 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 187.3ms TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2021-10-04 18:50:09,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2021-10-04 18:50:09,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1324. [2021-10-04 18:50:09,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1323 states have (on average 2.526077097505669) internal successors, (3342), 1323 states have internal predecessors, (3342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:09,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 3342 transitions. [2021-10-04 18:50:09,495 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 3342 transitions. Word has length 38 [2021-10-04 18:50:09,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:09,495 INFO L470 AbstractCegarLoop]: Abstraction has 1324 states and 3342 transitions. [2021-10-04 18:50:09,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-04 18:50:09,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 3342 transitions. [2021-10-04 18:50:09,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:09,497 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:09,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-04 18:50:09,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-10-04 18:50:09,498 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-04 18:50:09,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:09,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1562509486, now seen corresponding path program 97 times [2021-10-04 18:50:09,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:09,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890266767] [2021-10-04 18:50:09,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:09,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:09,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-04 18:50:09,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:09,608 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890266767] [2021-10-04 18:50:09,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890266767] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:09,609 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:09,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:09,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759724188] [2021-10-04 18:50:09,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:09,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:09,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:09,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:09,611 INFO L87 Difference]: Start difference. First operand 1324 states and 3342 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-04 18:50:10,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:10,054 INFO L93 Difference]: Finished difference Result 1408 states and 3509 transitions. [2021-10-04 18:50:10,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-04 18:50:10,054 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:10,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:10,058 INFO L225 Difference]: With dead ends: 1408 [2021-10-04 18:50:10,058 INFO L226 Difference]: Without dead ends: 1382 [2021-10-04 18:50:10,058 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 187.8ms TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:50:10,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2021-10-04 18:50:10,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1316. [2021-10-04 18:50:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1315 states have (on average 2.526235741444867) internal successors, (3322), 1315 states have internal predecessors, (3322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 3322 transitions. [2021-10-04 18:50:10,078 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 3322 transitions. Word has length 38 [2021-10-04 18:50:10,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:10,079 INFO L470 AbstractCegarLoop]: Abstraction has 1316 states and 3322 transitions. [2021-10-04 18:50:10,079 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-04 18:50:10,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 3322 transitions. [2021-10-04 18:50:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:10,081 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:10,081 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:10,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-10-04 18:50:10,081 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-04 18:50:10,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:10,082 INFO L82 PathProgramCache]: Analyzing trace with hash 424365238, now seen corresponding path program 98 times [2021-10-04 18:50:10,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:10,082 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466048234] [2021-10-04 18:50:10,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:10,082 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:10,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:10,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466048234] [2021-10-04 18:50:10,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466048234] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:10,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:10,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:10,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545396818] [2021-10-04 18:50:10,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:10,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:10,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:10,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:10,175 INFO L87 Difference]: Start difference. First operand 1316 states and 3322 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:10,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:10,731 INFO L93 Difference]: Finished difference Result 2108 states and 5214 transitions. [2021-10-04 18:50:10,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-04 18:50:10,732 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:10,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:10,737 INFO L225 Difference]: With dead ends: 2108 [2021-10-04 18:50:10,737 INFO L226 Difference]: Without dead ends: 2046 [2021-10-04 18:50:10,737 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 200.6ms TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2021-10-04 18:50:10,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2021-10-04 18:50:10,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1274. [2021-10-04 18:50:10,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1273 states have (on average 2.5428122545168894) internal successors, (3237), 1273 states have internal predecessors, (3237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 3237 transitions. [2021-10-04 18:50:10,755 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 3237 transitions. Word has length 38 [2021-10-04 18:50:10,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:10,756 INFO L470 AbstractCegarLoop]: Abstraction has 1274 states and 3237 transitions. [2021-10-04 18:50:10,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 3237 transitions. [2021-10-04 18:50:10,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:10,757 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:10,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-04 18:50:10,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-10-04 18:50:10,758 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-04 18:50:10,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:10,758 INFO L82 PathProgramCache]: Analyzing trace with hash 179852972, now seen corresponding path program 99 times [2021-10-04 18:50:10,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:10,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330972322] [2021-10-04 18:50:10,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:10,759 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:10,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:10,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:10,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330972322] [2021-10-04 18:50:10,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330972322] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:10,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:10,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:50:10,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301412965] [2021-10-04 18:50:10,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:50:10,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:10,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:50:10,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:50:10,868 INFO L87 Difference]: Start difference. First operand 1274 states and 3237 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-04 18:50:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:11,084 INFO L93 Difference]: Finished difference Result 1346 states and 3395 transitions. [2021-10-04 18:50:11,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-04 18:50:11,084 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-04 18:50:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:11,087 INFO L225 Difference]: With dead ends: 1346 [2021-10-04 18:50:11,088 INFO L226 Difference]: Without dead ends: 1282 [2021-10-04 18:50:11,088 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 73.4ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-10-04 18:50:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2021-10-04 18:50:11,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2021-10-04 18:50:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 2.530054644808743) internal successors, (3241), 1281 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:11,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 3241 transitions. [2021-10-04 18:50:11,107 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 3241 transitions. Word has length 38 [2021-10-04 18:50:11,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:11,107 INFO L470 AbstractCegarLoop]: Abstraction has 1282 states and 3241 transitions. [2021-10-04 18:50:11,107 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-04 18:50:11,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 3241 transitions. [2021-10-04 18:50:11,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:11,109 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:11,109 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:11,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-10-04 18:50:11,109 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-04 18:50:11,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:11,110 INFO L82 PathProgramCache]: Analyzing trace with hash -489093180, now seen corresponding path program 100 times [2021-10-04 18:50:11,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:11,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190104416] [2021-10-04 18:50:11,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:11,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:11,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:11,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:11,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190104416] [2021-10-04 18:50:11,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190104416] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:11,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:11,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:50:11,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882464846] [2021-10-04 18:50:11,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:50:11,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:11,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:50:11,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:50:11,194 INFO L87 Difference]: Start difference. First operand 1282 states and 3241 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-04 18:50:11,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:11,565 INFO L93 Difference]: Finished difference Result 1412 states and 3490 transitions. [2021-10-04 18:50:11,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-04 18:50:11,566 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-04 18:50:11,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:11,569 INFO L225 Difference]: With dead ends: 1412 [2021-10-04 18:50:11,569 INFO L226 Difference]: Without dead ends: 1350 [2021-10-04 18:50:11,569 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 145.0ms TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:50:11,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2021-10-04 18:50:11,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1286. [2021-10-04 18:50:11,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1285 states have (on average 2.5299610894941633) internal successors, (3251), 1285 states have internal predecessors, (3251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:11,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 3251 transitions. [2021-10-04 18:50:11,589 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 3251 transitions. Word has length 38 [2021-10-04 18:50:11,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:11,589 INFO L470 AbstractCegarLoop]: Abstraction has 1286 states and 3251 transitions. [2021-10-04 18:50:11,589 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-04 18:50:11,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 3251 transitions. [2021-10-04 18:50:11,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:11,591 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:11,591 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:11,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-10-04 18:50:11,591 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-04 18:50:11,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:11,592 INFO L82 PathProgramCache]: Analyzing trace with hash 832987292, now seen corresponding path program 101 times [2021-10-04 18:50:11,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:11,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035268963] [2021-10-04 18:50:11,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:11,592 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:11,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:11,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:11,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035268963] [2021-10-04 18:50:11,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035268963] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:11,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:11,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:50:11,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619586360] [2021-10-04 18:50:11,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:50:11,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:11,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:50:11,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:50:11,676 INFO L87 Difference]: Start difference. First operand 1286 states and 3251 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-04 18:50:11,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:11,897 INFO L93 Difference]: Finished difference Result 1384 states and 3468 transitions. [2021-10-04 18:50:11,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:50:11,897 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-04 18:50:11,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:11,900 INFO L225 Difference]: With dead ends: 1384 [2021-10-04 18:50:11,900 INFO L226 Difference]: Without dead ends: 1332 [2021-10-04 18:50:11,900 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 86.4ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-10-04 18:50:11,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2021-10-04 18:50:11,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1294. [2021-10-04 18:50:11,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1293 states have (on average 2.5297757153905645) internal successors, (3271), 1293 states have internal predecessors, (3271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 3271 transitions. [2021-10-04 18:50:11,915 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 3271 transitions. Word has length 38 [2021-10-04 18:50:11,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:11,915 INFO L470 AbstractCegarLoop]: Abstraction has 1294 states and 3271 transitions. [2021-10-04 18:50:11,916 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-04 18:50:11,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 3271 transitions. [2021-10-04 18:50:11,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:11,917 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:11,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-04 18:50:11,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-10-04 18:50:11,918 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-04 18:50:11,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:11,918 INFO L82 PathProgramCache]: Analyzing trace with hash 130354994, now seen corresponding path program 102 times [2021-10-04 18:50:11,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:11,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863214571] [2021-10-04 18:50:11,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:11,918 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:11,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:11,997 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863214571] [2021-10-04 18:50:11,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863214571] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:11,997 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:11,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:50:11,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681710120] [2021-10-04 18:50:11,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:50:11,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:11,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:50:11,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:50:11,999 INFO L87 Difference]: Start difference. First operand 1294 states and 3271 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-04 18:50:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:12,231 INFO L93 Difference]: Finished difference Result 1480 states and 3696 transitions. [2021-10-04 18:50:12,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:50:12,232 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-04 18:50:12,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:12,234 INFO L225 Difference]: With dead ends: 1480 [2021-10-04 18:50:12,234 INFO L226 Difference]: Without dead ends: 1404 [2021-10-04 18:50:12,235 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 70.8ms TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2021-10-04 18:50:12,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2021-10-04 18:50:12,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1290. [2021-10-04 18:50:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 1289 states have (on average 2.5376260667183863) internal successors, (3271), 1289 states have internal predecessors, (3271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 3271 transitions. [2021-10-04 18:50:12,250 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 3271 transitions. Word has length 38 [2021-10-04 18:50:12,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:12,250 INFO L470 AbstractCegarLoop]: Abstraction has 1290 states and 3271 transitions. [2021-10-04 18:50:12,251 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-04 18:50:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 3271 transitions. [2021-10-04 18:50:12,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:12,252 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:12,252 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:12,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-10-04 18:50:12,253 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-04 18:50:12,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:12,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1321353032, now seen corresponding path program 103 times [2021-10-04 18:50:12,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:12,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144905848] [2021-10-04 18:50:12,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:12,253 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:12,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-04 18:50:12,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:12,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144905848] [2021-10-04 18:50:12,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144905848] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:12,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:12,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:12,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812338226] [2021-10-04 18:50:12,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:12,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:12,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:12,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:12,371 INFO L87 Difference]: Start difference. First operand 1290 states and 3271 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-04 18:50:12,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:12,804 INFO L93 Difference]: Finished difference Result 1322 states and 3321 transitions. [2021-10-04 18:50:12,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:50:12,804 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:12,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:12,809 INFO L225 Difference]: With dead ends: 1322 [2021-10-04 18:50:12,809 INFO L226 Difference]: Without dead ends: 1294 [2021-10-04 18:50:12,810 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 205.0ms TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:50:12,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2021-10-04 18:50:12,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1290. [2021-10-04 18:50:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 1289 states have (on average 2.5329712955779673) internal successors, (3265), 1289 states have internal predecessors, (3265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 3265 transitions. [2021-10-04 18:50:12,834 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 3265 transitions. Word has length 38 [2021-10-04 18:50:12,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:12,834 INFO L470 AbstractCegarLoop]: Abstraction has 1290 states and 3265 transitions. [2021-10-04 18:50:12,835 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-04 18:50:12,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 3265 transitions. [2021-10-04 18:50:12,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:12,838 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:12,838 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:12,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-10-04 18:50:12,838 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-04 18:50:12,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:12,839 INFO L82 PathProgramCache]: Analyzing trace with hash -618547322, now seen corresponding path program 104 times [2021-10-04 18:50:12,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:12,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209526450] [2021-10-04 18:50:12,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:12,840 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:12,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:12,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:12,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209526450] [2021-10-04 18:50:12,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209526450] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:12,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:12,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:50:12,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465442447] [2021-10-04 18:50:12,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:50:12,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:12,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:50:12,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:50:12,928 INFO L87 Difference]: Start difference. First operand 1290 states and 3265 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-04 18:50:13,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:13,339 INFO L93 Difference]: Finished difference Result 1444 states and 3576 transitions. [2021-10-04 18:50:13,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-04 18:50:13,339 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:13,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:13,341 INFO L225 Difference]: With dead ends: 1444 [2021-10-04 18:50:13,342 INFO L226 Difference]: Without dead ends: 1426 [2021-10-04 18:50:13,342 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 165.4ms TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:50:13,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2021-10-04 18:50:13,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1292. [2021-10-04 18:50:13,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1291 states have (on average 2.5329202168861347) internal successors, (3270), 1291 states have internal predecessors, (3270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:13,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 3270 transitions. [2021-10-04 18:50:13,357 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 3270 transitions. Word has length 38 [2021-10-04 18:50:13,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:13,357 INFO L470 AbstractCegarLoop]: Abstraction has 1292 states and 3270 transitions. [2021-10-04 18:50:13,357 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-04 18:50:13,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 3270 transitions. [2021-10-04 18:50:13,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:13,359 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:13,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-04 18:50:13,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-10-04 18:50:13,359 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-04 18:50:13,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:13,359 INFO L82 PathProgramCache]: Analyzing trace with hash 2088137578, now seen corresponding path program 105 times [2021-10-04 18:50:13,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:13,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132818327] [2021-10-04 18:50:13,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:13,360 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:13,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-04 18:50:13,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:13,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132818327] [2021-10-04 18:50:13,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132818327] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:13,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:13,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:13,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101521402] [2021-10-04 18:50:13,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:13,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:13,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:13,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:13,460 INFO L87 Difference]: Start difference. First operand 1292 states and 3270 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:13,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:13,944 INFO L93 Difference]: Finished difference Result 1440 states and 3564 transitions. [2021-10-04 18:50:13,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-04 18:50:13,944 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:13,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:13,948 INFO L225 Difference]: With dead ends: 1440 [2021-10-04 18:50:13,948 INFO L226 Difference]: Without dead ends: 1424 [2021-10-04 18:50:13,948 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 197.2ms TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2021-10-04 18:50:13,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2021-10-04 18:50:13,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1298. [2021-10-04 18:50:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1297 states have (on average 2.531225905936777) internal successors, (3283), 1297 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 3283 transitions. [2021-10-04 18:50:13,973 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 3283 transitions. Word has length 38 [2021-10-04 18:50:13,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:13,973 INFO L470 AbstractCegarLoop]: Abstraction has 1298 states and 3283 transitions. [2021-10-04 18:50:13,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:13,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 3283 transitions. [2021-10-04 18:50:13,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:13,976 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:13,976 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:13,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-10-04 18:50:13,977 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-04 18:50:13,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:13,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1529471604, now seen corresponding path program 106 times [2021-10-04 18:50:13,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:13,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428651194] [2021-10-04 18:50:13,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:13,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:14,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:14,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428651194] [2021-10-04 18:50:14,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428651194] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:14,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:14,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:14,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189441665] [2021-10-04 18:50:14,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:14,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:14,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:14,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:14,087 INFO L87 Difference]: Start difference. First operand 1298 states and 3283 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:14,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:14,496 INFO L93 Difference]: Finished difference Result 1384 states and 3444 transitions. [2021-10-04 18:50:14,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-04 18:50:14,496 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:14,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:14,499 INFO L225 Difference]: With dead ends: 1384 [2021-10-04 18:50:14,499 INFO L226 Difference]: Without dead ends: 1358 [2021-10-04 18:50:14,499 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 187.6ms TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:50:14,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2021-10-04 18:50:14,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1292. [2021-10-04 18:50:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1291 states have (on average 2.53137103020914) internal successors, (3268), 1291 states have internal predecessors, (3268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:14,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 3268 transitions. [2021-10-04 18:50:14,514 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 3268 transitions. Word has length 38 [2021-10-04 18:50:14,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:14,515 INFO L470 AbstractCegarLoop]: Abstraction has 1292 states and 3268 transitions. [2021-10-04 18:50:14,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-04 18:50:14,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 3268 transitions. [2021-10-04 18:50:14,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:14,516 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:14,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-04 18:50:14,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-10-04 18:50:14,517 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-04 18:50:14,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:14,517 INFO L82 PathProgramCache]: Analyzing trace with hash -589110762, now seen corresponding path program 107 times [2021-10-04 18:50:14,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:14,517 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851640183] [2021-10-04 18:50:14,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:14,517 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:14,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:14,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851640183] [2021-10-04 18:50:14,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851640183] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:14,617 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:14,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:14,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140650326] [2021-10-04 18:50:14,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:14,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:14,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:14,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:14,619 INFO L87 Difference]: Start difference. First operand 1292 states and 3268 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-04 18:50:15,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:15,120 INFO L93 Difference]: Finished difference Result 1380 states and 3432 transitions. [2021-10-04 18:50:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-04 18:50:15,121 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-04 18:50:15,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:15,123 INFO L225 Difference]: With dead ends: 1380 [2021-10-04 18:50:15,123 INFO L226 Difference]: Without dead ends: 1350 [2021-10-04 18:50:15,123 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 232.1ms TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2021-10-04 18:50:15,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2021-10-04 18:50:15,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1284. [2021-10-04 18:50:15,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 1283 states have (on average 2.533125487139517) internal successors, (3250), 1283 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:15,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 3250 transitions. [2021-10-04 18:50:15,138 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 3250 transitions. Word has length 38 [2021-10-04 18:50:15,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:15,139 INFO L470 AbstractCegarLoop]: Abstraction has 1284 states and 3250 transitions. [2021-10-04 18:50:15,139 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-04 18:50:15,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 3250 transitions. [2021-10-04 18:50:15,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:15,141 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:15,141 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:15,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-10-04 18:50:15,141 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-04 18:50:15,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:15,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1870916004, now seen corresponding path program 108 times [2021-10-04 18:50:15,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:15,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923634182] [2021-10-04 18:50:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:15,142 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:15,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-04 18:50:15,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:15,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923634182] [2021-10-04 18:50:15,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923634182] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:15,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:15,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:15,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952541565] [2021-10-04 18:50:15,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:15,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:15,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:15,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:15,254 INFO L87 Difference]: Start difference. First operand 1284 states and 3250 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-04 18:50:15,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:15,726 INFO L93 Difference]: Finished difference Result 1340 states and 3334 transitions. [2021-10-04 18:50:15,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-04 18:50:15,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-04 18:50:15,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:15,729 INFO L225 Difference]: With dead ends: 1340 [2021-10-04 18:50:15,730 INFO L226 Difference]: Without dead ends: 1316 [2021-10-04 18:50:15,730 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 212.6ms TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2021-10-04 18:50:15,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2021-10-04 18:50:15,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1278. [2021-10-04 18:50:15,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 1277 states have (on average 2.5332811276429132) internal successors, (3235), 1277 states have internal predecessors, (3235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 3235 transitions. [2021-10-04 18:50:15,755 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 3235 transitions. Word has length 38 [2021-10-04 18:50:15,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:15,756 INFO L470 AbstractCegarLoop]: Abstraction has 1278 states and 3235 transitions. [2021-10-04 18:50:15,756 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-04 18:50:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 3235 transitions. [2021-10-04 18:50:15,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:15,758 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:15,759 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:15,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-10-04 18:50:15,759 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-04 18:50:15,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:15,760 INFO L82 PathProgramCache]: Analyzing trace with hash -401667014, now seen corresponding path program 109 times [2021-10-04 18:50:15,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:15,760 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341112546] [2021-10-04 18:50:15,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:15,760 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:15,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-04 18:50:15,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:15,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341112546] [2021-10-04 18:50:15,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341112546] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:15,862 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:15,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:15,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122889802] [2021-10-04 18:50:15,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:15,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:15,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:15,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:15,863 INFO L87 Difference]: Start difference. First operand 1278 states and 3235 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-04 18:50:16,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:16,385 INFO L93 Difference]: Finished difference Result 1372 states and 3406 transitions. [2021-10-04 18:50:16,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-04 18:50:16,385 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-04 18:50:16,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:16,387 INFO L225 Difference]: With dead ends: 1372 [2021-10-04 18:50:16,387 INFO L226 Difference]: Without dead ends: 1346 [2021-10-04 18:50:16,388 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 256.7ms TimeCoverageRelationStatistics Valid=180, Invalid=576, Unknown=0, NotChecked=0, Total=756 [2021-10-04 18:50:16,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2021-10-04 18:50:16,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1286. [2021-10-04 18:50:16,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1285 states have (on average 2.5268482490272373) internal successors, (3247), 1285 states have internal predecessors, (3247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:16,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 3247 transitions. [2021-10-04 18:50:16,402 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 3247 transitions. Word has length 38 [2021-10-04 18:50:16,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:16,403 INFO L470 AbstractCegarLoop]: Abstraction has 1286 states and 3247 transitions. [2021-10-04 18:50:16,403 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-04 18:50:16,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 3247 transitions. [2021-10-04 18:50:16,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:16,404 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:16,405 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:16,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2021-10-04 18:50:16,405 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-04 18:50:16,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:16,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1460119182, now seen corresponding path program 110 times [2021-10-04 18:50:16,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:16,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484893359] [2021-10-04 18:50:16,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:16,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:16,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-04 18:50:16,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:16,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484893359] [2021-10-04 18:50:16,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484893359] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:16,495 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:16,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:16,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189610992] [2021-10-04 18:50:16,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:16,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:16,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:16,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:16,497 INFO L87 Difference]: Start difference. First operand 1286 states and 3247 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:16,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:16,933 INFO L93 Difference]: Finished difference Result 1356 states and 3376 transitions. [2021-10-04 18:50:16,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-04 18:50:16,934 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:16,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:16,936 INFO L225 Difference]: With dead ends: 1356 [2021-10-04 18:50:16,936 INFO L226 Difference]: Without dead ends: 1318 [2021-10-04 18:50:16,936 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 207.9ms TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2021-10-04 18:50:16,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2021-10-04 18:50:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1272. [2021-10-04 18:50:16,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1271 states have (on average 2.5334382376081823) internal successors, (3220), 1271 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 3220 transitions. [2021-10-04 18:50:16,951 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 3220 transitions. Word has length 38 [2021-10-04 18:50:16,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:16,952 INFO L470 AbstractCegarLoop]: Abstraction has 1272 states and 3220 transitions. [2021-10-04 18:50:16,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:16,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 3220 transitions. [2021-10-04 18:50:16,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:16,953 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:16,953 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:16,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-10-04 18:50:16,954 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-04 18:50:16,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:16,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1978498408, now seen corresponding path program 111 times [2021-10-04 18:50:16,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:16,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386807656] [2021-10-04 18:50:16,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:16,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:17,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:17,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:17,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386807656] [2021-10-04 18:50:17,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386807656] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:17,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:17,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:50:17,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064797820] [2021-10-04 18:50:17,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:50:17,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:17,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:50:17,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:50:17,043 INFO L87 Difference]: Start difference. First operand 1272 states and 3220 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-04 18:50:17,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:17,444 INFO L93 Difference]: Finished difference Result 1442 states and 3585 transitions. [2021-10-04 18:50:17,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:50:17,444 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-04 18:50:17,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:17,447 INFO L225 Difference]: With dead ends: 1442 [2021-10-04 18:50:17,447 INFO L226 Difference]: Without dead ends: 1424 [2021-10-04 18:50:17,447 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 160.8ms TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:50:17,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2021-10-04 18:50:17,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1276. [2021-10-04 18:50:17,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1275 states have (on average 2.5349019607843135) internal successors, (3232), 1275 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 3232 transitions. [2021-10-04 18:50:17,463 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 3232 transitions. Word has length 38 [2021-10-04 18:50:17,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:17,463 INFO L470 AbstractCegarLoop]: Abstraction has 1276 states and 3232 transitions. [2021-10-04 18:50:17,463 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-04 18:50:17,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 3232 transitions. [2021-10-04 18:50:17,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:17,465 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:17,465 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:17,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-10-04 18:50:17,465 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-04 18:50:17,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:17,466 INFO L82 PathProgramCache]: Analyzing trace with hash 390216012, now seen corresponding path program 112 times [2021-10-04 18:50:17,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:17,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145989848] [2021-10-04 18:50:17,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:17,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:17,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-04 18:50:17,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:17,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145989848] [2021-10-04 18:50:17,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145989848] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:17,556 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:17,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:17,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86825403] [2021-10-04 18:50:17,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:17,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:17,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:17,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:17,558 INFO L87 Difference]: Start difference. First operand 1276 states and 3232 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:18,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:18,013 INFO L93 Difference]: Finished difference Result 1430 states and 3555 transitions. [2021-10-04 18:50:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:50:18,013 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:18,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:18,016 INFO L225 Difference]: With dead ends: 1430 [2021-10-04 18:50:18,016 INFO L226 Difference]: Without dead ends: 1414 [2021-10-04 18:50:18,016 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 198.8ms TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:50:18,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2021-10-04 18:50:18,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1288. [2021-10-04 18:50:18,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1287 states have (on average 2.537684537684538) internal successors, (3266), 1287 states have internal predecessors, (3266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 3266 transitions. [2021-10-04 18:50:18,031 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 3266 transitions. Word has length 38 [2021-10-04 18:50:18,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:18,032 INFO L470 AbstractCegarLoop]: Abstraction has 1288 states and 3266 transitions. [2021-10-04 18:50:18,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:18,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 3266 transitions. [2021-10-04 18:50:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:18,033 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:18,034 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:18,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-10-04 18:50:18,034 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-04 18:50:18,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:18,034 INFO L82 PathProgramCache]: Analyzing trace with hash -168449962, now seen corresponding path program 113 times [2021-10-04 18:50:18,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:18,035 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835909608] [2021-10-04 18:50:18,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:18,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:18,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:18,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835909608] [2021-10-04 18:50:18,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835909608] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:18,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:18,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:18,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773845541] [2021-10-04 18:50:18,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:18,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:18,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:18,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:18,135 INFO L87 Difference]: Start difference. First operand 1288 states and 3266 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:18,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:18,547 INFO L93 Difference]: Finished difference Result 1380 states and 3444 transitions. [2021-10-04 18:50:18,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-04 18:50:18,548 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:18,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:18,550 INFO L225 Difference]: With dead ends: 1380 [2021-10-04 18:50:18,550 INFO L226 Difference]: Without dead ends: 1354 [2021-10-04 18:50:18,550 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 219.3ms TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:50:18,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2021-10-04 18:50:18,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1282. [2021-10-04 18:50:18,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 2.5331772053083528) internal successors, (3245), 1281 states have internal predecessors, (3245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:18,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 3245 transitions. [2021-10-04 18:50:18,568 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 3245 transitions. Word has length 38 [2021-10-04 18:50:18,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:18,568 INFO L470 AbstractCegarLoop]: Abstraction has 1282 states and 3245 transitions. [2021-10-04 18:50:18,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:18,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 3245 transitions. [2021-10-04 18:50:18,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:18,570 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:18,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-04 18:50:18,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-10-04 18:50:18,570 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-04 18:50:18,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:18,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2007934968, now seen corresponding path program 114 times [2021-10-04 18:50:18,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:18,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600497695] [2021-10-04 18:50:18,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:18,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:18,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:18,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600497695] [2021-10-04 18:50:18,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600497695] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:18,681 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:18,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:18,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723714487] [2021-10-04 18:50:18,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:18,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:18,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:18,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:18,683 INFO L87 Difference]: Start difference. First operand 1282 states and 3245 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-04 18:50:19,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:19,184 INFO L93 Difference]: Finished difference Result 1376 states and 3426 transitions. [2021-10-04 18:50:19,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-04 18:50:19,185 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-04 18:50:19,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:19,187 INFO L225 Difference]: With dead ends: 1376 [2021-10-04 18:50:19,187 INFO L226 Difference]: Without dead ends: 1352 [2021-10-04 18:50:19,187 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 258.5ms TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2021-10-04 18:50:19,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2021-10-04 18:50:19,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1280. [2021-10-04 18:50:19,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 2.5332290852228305) internal successors, (3240), 1279 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 3240 transitions. [2021-10-04 18:50:19,202 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 3240 transitions. Word has length 38 [2021-10-04 18:50:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:19,203 INFO L470 AbstractCegarLoop]: Abstraction has 1280 states and 3240 transitions. [2021-10-04 18:50:19,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-04 18:50:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 3240 transitions. [2021-10-04 18:50:19,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:19,204 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:19,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-04 18:50:19,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-10-04 18:50:19,205 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-04 18:50:19,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:19,205 INFO L82 PathProgramCache]: Analyzing trace with hash -2023954056, now seen corresponding path program 115 times [2021-10-04 18:50:19,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:19,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168503511] [2021-10-04 18:50:19,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:19,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:19,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-04 18:50:19,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:19,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168503511] [2021-10-04 18:50:19,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168503511] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:19,292 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:19,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:19,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054686045] [2021-10-04 18:50:19,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:19,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:19,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:19,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:19,294 INFO L87 Difference]: Start difference. First operand 1280 states and 3240 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:19,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:19,646 INFO L93 Difference]: Finished difference Result 1390 states and 3457 transitions. [2021-10-04 18:50:19,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-04 18:50:19,647 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:19,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:19,651 INFO L225 Difference]: With dead ends: 1390 [2021-10-04 18:50:19,651 INFO L226 Difference]: Without dead ends: 1374 [2021-10-04 18:50:19,652 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 167.7ms TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:50:19,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2021-10-04 18:50:19,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1282. [2021-10-04 18:50:19,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 2.531615925058548) internal successors, (3243), 1281 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 3243 transitions. [2021-10-04 18:50:19,683 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 3243 transitions. Word has length 38 [2021-10-04 18:50:19,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:19,684 INFO L470 AbstractCegarLoop]: Abstraction has 1282 states and 3243 transitions. [2021-10-04 18:50:19,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-04 18:50:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 3243 transitions. [2021-10-04 18:50:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:19,688 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:19,688 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:19,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-10-04 18:50:19,689 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-04 18:50:19,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:19,689 INFO L82 PathProgramCache]: Analyzing trace with hash -219854308, now seen corresponding path program 116 times [2021-10-04 18:50:19,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:19,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927331997] [2021-10-04 18:50:19,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:19,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:19,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:19,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:19,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927331997] [2021-10-04 18:50:19,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927331997] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:19,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:19,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:19,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233798584] [2021-10-04 18:50:19,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:19,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:19,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:19,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:19,801 INFO L87 Difference]: Start difference. First operand 1282 states and 3243 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:20,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:20,121 INFO L93 Difference]: Finished difference Result 1384 states and 3444 transitions. [2021-10-04 18:50:20,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-04 18:50:20,121 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:20,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:20,124 INFO L225 Difference]: With dead ends: 1384 [2021-10-04 18:50:20,124 INFO L226 Difference]: Without dead ends: 1370 [2021-10-04 18:50:20,124 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 151.4ms TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:50:20,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2021-10-04 18:50:20,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1286. [2021-10-04 18:50:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1285 states have (on average 2.5299610894941633) internal successors, (3251), 1285 states have internal predecessors, (3251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:20,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 3251 transitions. [2021-10-04 18:50:20,146 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 3251 transitions. Word has length 38 [2021-10-04 18:50:20,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:20,147 INFO L470 AbstractCegarLoop]: Abstraction has 1286 states and 3251 transitions. [2021-10-04 18:50:20,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:20,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 3251 transitions. [2021-10-04 18:50:20,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:20,149 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:20,149 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:20,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-10-04 18:50:20,149 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-04 18:50:20,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:20,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1573571256, now seen corresponding path program 117 times [2021-10-04 18:50:20,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:20,149 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61956311] [2021-10-04 18:50:20,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:20,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:20,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:20,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61956311] [2021-10-04 18:50:20,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61956311] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:20,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:20,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:50:20,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755840619] [2021-10-04 18:50:20,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:50:20,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:20,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:50:20,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:50:20,240 INFO L87 Difference]: Start difference. First operand 1286 states and 3251 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-04 18:50:20,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:20,600 INFO L93 Difference]: Finished difference Result 1370 states and 3403 transitions. [2021-10-04 18:50:20,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:50:20,600 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-04 18:50:20,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:20,602 INFO L225 Difference]: With dead ends: 1370 [2021-10-04 18:50:20,603 INFO L226 Difference]: Without dead ends: 1342 [2021-10-04 18:50:20,603 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 147.8ms TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:50:20,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2021-10-04 18:50:20,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1274. [2021-10-04 18:50:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1273 states have (on average 2.5318146111547524) internal successors, (3223), 1273 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 3223 transitions. [2021-10-04 18:50:20,618 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 3223 transitions. Word has length 38 [2021-10-04 18:50:20,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:20,618 INFO L470 AbstractCegarLoop]: Abstraction has 1274 states and 3223 transitions. [2021-10-04 18:50:20,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:20,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 3223 transitions. [2021-10-04 18:50:20,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:20,620 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:20,620 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:20,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-10-04 18:50:20,620 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-04 18:50:20,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:20,620 INFO L82 PathProgramCache]: Analyzing trace with hash 823006876, now seen corresponding path program 118 times [2021-10-04 18:50:20,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:20,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866278888] [2021-10-04 18:50:20,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:20,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:20,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:20,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866278888] [2021-10-04 18:50:20,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866278888] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:20,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:20,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:20,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963775704] [2021-10-04 18:50:20,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:20,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:20,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:20,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:20,730 INFO L87 Difference]: Start difference. First operand 1274 states and 3223 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-04 18:50:21,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:21,150 INFO L93 Difference]: Finished difference Result 1360 states and 3390 transitions. [2021-10-04 18:50:21,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-04 18:50:21,151 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-04 18:50:21,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:21,154 INFO L225 Difference]: With dead ends: 1360 [2021-10-04 18:50:21,154 INFO L226 Difference]: Without dead ends: 1342 [2021-10-04 18:50:21,155 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 220.9ms TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2021-10-04 18:50:21,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2021-10-04 18:50:21,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1282. [2021-10-04 18:50:21,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 2.5253708040593286) internal successors, (3235), 1281 states have internal predecessors, (3235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 3235 transitions. [2021-10-04 18:50:21,179 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 3235 transitions. Word has length 38 [2021-10-04 18:50:21,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:21,179 INFO L470 AbstractCegarLoop]: Abstraction has 1282 states and 3235 transitions. [2021-10-04 18:50:21,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-04 18:50:21,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 3235 transitions. [2021-10-04 18:50:21,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:21,182 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:21,182 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:21,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-10-04 18:50:21,183 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-04 18:50:21,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:21,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1610174224, now seen corresponding path program 119 times [2021-10-04 18:50:21,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:21,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569597706] [2021-10-04 18:50:21,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:21,184 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:21,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-04 18:50:21,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:21,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569597706] [2021-10-04 18:50:21,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569597706] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:21,295 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:21,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:21,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429439758] [2021-10-04 18:50:21,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:21,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:21,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:21,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:21,296 INFO L87 Difference]: Start difference. First operand 1282 states and 3235 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:21,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:21,685 INFO L93 Difference]: Finished difference Result 1352 states and 3372 transitions. [2021-10-04 18:50:21,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:50:21,686 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:21,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:21,689 INFO L225 Difference]: With dead ends: 1352 [2021-10-04 18:50:21,689 INFO L226 Difference]: Without dead ends: 1312 [2021-10-04 18:50:21,689 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 183.4ms TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:50:21,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2021-10-04 18:50:21,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1266. [2021-10-04 18:50:21,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 2.533596837944664) internal successors, (3205), 1265 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 3205 transitions. [2021-10-04 18:50:21,712 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 3205 transitions. Word has length 38 [2021-10-04 18:50:21,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:21,712 INFO L470 AbstractCegarLoop]: Abstraction has 1266 states and 3205 transitions. [2021-10-04 18:50:21,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:21,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 3205 transitions. [2021-10-04 18:50:21,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:21,716 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:21,716 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:21,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-10-04 18:50:21,717 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-04 18:50:21,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:21,717 INFO L82 PathProgramCache]: Analyzing trace with hash -185002474, now seen corresponding path program 120 times [2021-10-04 18:50:21,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:21,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437663617] [2021-10-04 18:50:21,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:21,718 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:21,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:21,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437663617] [2021-10-04 18:50:21,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437663617] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:21,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:21,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:21,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499493647] [2021-10-04 18:50:21,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:21,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:21,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:21,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:21,829 INFO L87 Difference]: Start difference. First operand 1266 states and 3205 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-04 18:50:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:22,316 INFO L93 Difference]: Finished difference Result 1406 states and 3476 transitions. [2021-10-04 18:50:22,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-04 18:50:22,317 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:22,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:22,319 INFO L225 Difference]: With dead ends: 1406 [2021-10-04 18:50:22,319 INFO L226 Difference]: Without dead ends: 1286 [2021-10-04 18:50:22,319 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 232.5ms TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2021-10-04 18:50:22,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2021-10-04 18:50:22,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1268. [2021-10-04 18:50:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1267 states have (on average 2.5138121546961325) internal successors, (3185), 1267 states have internal predecessors, (3185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 3185 transitions. [2021-10-04 18:50:22,336 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 3185 transitions. Word has length 38 [2021-10-04 18:50:22,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:22,336 INFO L470 AbstractCegarLoop]: Abstraction has 1268 states and 3185 transitions. [2021-10-04 18:50:22,336 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-04 18:50:22,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 3185 transitions. [2021-10-04 18:50:22,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:22,338 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:22,339 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:22,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-10-04 18:50:22,339 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-04 18:50:22,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:22,340 INFO L82 PathProgramCache]: Analyzing trace with hash 783226548, now seen corresponding path program 121 times [2021-10-04 18:50:22,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:22,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423692658] [2021-10-04 18:50:22,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:22,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:22,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-04 18:50:22,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:22,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423692658] [2021-10-04 18:50:22,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423692658] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:22,453 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:22,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:22,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795342380] [2021-10-04 18:50:22,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:22,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:22,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:22,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:22,455 INFO L87 Difference]: Start difference. First operand 1268 states and 3185 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-04 18:50:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:22,954 INFO L93 Difference]: Finished difference Result 1296 states and 3233 transitions. [2021-10-04 18:50:22,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-04 18:50:22,955 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-04 18:50:22,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:22,957 INFO L225 Difference]: With dead ends: 1296 [2021-10-04 18:50:22,957 INFO L226 Difference]: Without dead ends: 1274 [2021-10-04 18:50:22,957 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 271.4ms TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2021-10-04 18:50:22,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2021-10-04 18:50:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1270. [2021-10-04 18:50:22,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1269 states have (on average 2.512214342001576) internal successors, (3188), 1269 states have internal predecessors, (3188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 3188 transitions. [2021-10-04 18:50:22,974 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 3188 transitions. Word has length 38 [2021-10-04 18:50:22,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:22,974 INFO L470 AbstractCegarLoop]: Abstraction has 1270 states and 3188 transitions. [2021-10-04 18:50:22,974 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-04 18:50:22,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 3188 transitions. [2021-10-04 18:50:22,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:22,976 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:22,976 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:22,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2021-10-04 18:50:22,976 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-04 18:50:22,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:22,976 INFO L82 PathProgramCache]: Analyzing trace with hash 19043690, now seen corresponding path program 122 times [2021-10-04 18:50:22,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:22,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447244803] [2021-10-04 18:50:22,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:22,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:23,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:23,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:23,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447244803] [2021-10-04 18:50:23,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447244803] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:23,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:23,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:23,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11093520] [2021-10-04 18:50:23,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:23,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:23,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:23,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:23,076 INFO L87 Difference]: Start difference. First operand 1270 states and 3188 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:23,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:23,506 INFO L93 Difference]: Finished difference Result 1328 states and 3295 transitions. [2021-10-04 18:50:23,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-04 18:50:23,507 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:23,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:23,509 INFO L225 Difference]: With dead ends: 1328 [2021-10-04 18:50:23,509 INFO L226 Difference]: Without dead ends: 1308 [2021-10-04 18:50:23,509 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 200.6ms TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:50:23,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2021-10-04 18:50:23,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1276. [2021-10-04 18:50:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1275 states have (on average 2.5074509803921567) internal successors, (3197), 1275 states have internal predecessors, (3197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 3197 transitions. [2021-10-04 18:50:23,524 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 3197 transitions. Word has length 38 [2021-10-04 18:50:23,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:23,524 INFO L470 AbstractCegarLoop]: Abstraction has 1276 states and 3197 transitions. [2021-10-04 18:50:23,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:23,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 3197 transitions. [2021-10-04 18:50:23,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:23,526 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:23,526 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:23,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-10-04 18:50:23,527 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-04 18:50:23,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:23,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1835383850, now seen corresponding path program 123 times [2021-10-04 18:50:23,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:23,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788004409] [2021-10-04 18:50:23,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:23,528 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:23,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:23,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788004409] [2021-10-04 18:50:23,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788004409] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:23,618 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:23,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:23,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952707192] [2021-10-04 18:50:23,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:23,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:23,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:23,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:23,620 INFO L87 Difference]: Start difference. First operand 1276 states and 3197 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:24,262 INFO L93 Difference]: Finished difference Result 1756 states and 4240 transitions. [2021-10-04 18:50:24,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-10-04 18:50:24,263 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:24,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:24,265 INFO L225 Difference]: With dead ends: 1756 [2021-10-04 18:50:24,265 INFO L226 Difference]: Without dead ends: 1500 [2021-10-04 18:50:24,265 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 260.2ms TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2021-10-04 18:50:24,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2021-10-04 18:50:24,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1258. [2021-10-04 18:50:24,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 2.517104216388226) internal successors, (3164), 1257 states have internal predecessors, (3164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:24,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 3164 transitions. [2021-10-04 18:50:24,280 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 3164 transitions. Word has length 38 [2021-10-04 18:50:24,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:24,281 INFO L470 AbstractCegarLoop]: Abstraction has 1258 states and 3164 transitions. [2021-10-04 18:50:24,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:24,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 3164 transitions. [2021-10-04 18:50:24,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:24,282 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:24,282 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:24,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2021-10-04 18:50:24,283 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-04 18:50:24,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:24,284 INFO L82 PathProgramCache]: Analyzing trace with hash 902609728, now seen corresponding path program 124 times [2021-10-04 18:50:24,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:24,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366986152] [2021-10-04 18:50:24,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:24,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:24,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-04 18:50:24,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:24,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366986152] [2021-10-04 18:50:24,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366986152] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:24,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:24,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:24,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998444268] [2021-10-04 18:50:24,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:24,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:24,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:24,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:24,380 INFO L87 Difference]: Start difference. First operand 1258 states and 3164 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-04 18:50:24,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:24,843 INFO L93 Difference]: Finished difference Result 1354 states and 3333 transitions. [2021-10-04 18:50:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-04 18:50:24,843 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-04 18:50:24,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:24,846 INFO L225 Difference]: With dead ends: 1354 [2021-10-04 18:50:24,846 INFO L226 Difference]: Without dead ends: 1330 [2021-10-04 18:50:24,846 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 228.7ms TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2021-10-04 18:50:24,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2021-10-04 18:50:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1252. [2021-10-04 18:50:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1251 states have (on average 2.5171862509992007) internal successors, (3149), 1251 states have internal predecessors, (3149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 3149 transitions. [2021-10-04 18:50:24,870 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 3149 transitions. Word has length 38 [2021-10-04 18:50:24,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:24,870 INFO L470 AbstractCegarLoop]: Abstraction has 1252 states and 3149 transitions. [2021-10-04 18:50:24,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-04 18:50:24,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 3149 transitions. [2021-10-04 18:50:24,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:24,873 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:24,874 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:24,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2021-10-04 18:50:24,874 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-04 18:50:24,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:24,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1923108578, now seen corresponding path program 125 times [2021-10-04 18:50:24,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:24,875 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854208066] [2021-10-04 18:50:24,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:24,875 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:24,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:24,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854208066] [2021-10-04 18:50:24,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854208066] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:24,994 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:24,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:24,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138283164] [2021-10-04 18:50:24,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:24,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:24,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:24,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:24,996 INFO L87 Difference]: Start difference. First operand 1252 states and 3149 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-04 18:50:25,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:25,433 INFO L93 Difference]: Finished difference Result 1322 states and 3281 transitions. [2021-10-04 18:50:25,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-04 18:50:25,434 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-04 18:50:25,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:25,436 INFO L225 Difference]: With dead ends: 1322 [2021-10-04 18:50:25,436 INFO L226 Difference]: Without dead ends: 1304 [2021-10-04 18:50:25,436 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 244.1ms TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2021-10-04 18:50:25,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2021-10-04 18:50:25,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1254. [2021-10-04 18:50:25,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 2.515562649640862) internal successors, (3152), 1253 states have internal predecessors, (3152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:25,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 3152 transitions. [2021-10-04 18:50:25,452 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 3152 transitions. Word has length 38 [2021-10-04 18:50:25,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:25,452 INFO L470 AbstractCegarLoop]: Abstraction has 1254 states and 3152 transitions. [2021-10-04 18:50:25,452 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-04 18:50:25,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 3152 transitions. [2021-10-04 18:50:25,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:25,454 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:25,454 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:25,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2021-10-04 18:50:25,454 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-04 18:50:25,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:25,454 INFO L82 PathProgramCache]: Analyzing trace with hash -604551974, now seen corresponding path program 126 times [2021-10-04 18:50:25,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:25,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261218657] [2021-10-04 18:50:25,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:25,455 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:25,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:25,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261218657] [2021-10-04 18:50:25,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261218657] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:25,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:25,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:25,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737062707] [2021-10-04 18:50:25,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:25,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:25,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:25,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:25,571 INFO L87 Difference]: Start difference. First operand 1254 states and 3152 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-04 18:50:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:26,036 INFO L93 Difference]: Finished difference Result 1330 states and 3299 transitions. [2021-10-04 18:50:26,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-04 18:50:26,036 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-04 18:50:26,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:26,038 INFO L225 Difference]: With dead ends: 1330 [2021-10-04 18:50:26,038 INFO L226 Difference]: Without dead ends: 1314 [2021-10-04 18:50:26,039 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 227.8ms TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2021-10-04 18:50:26,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2021-10-04 18:50:26,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1260. [2021-10-04 18:50:26,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 1259 states have (on average 2.510722795869738) internal successors, (3161), 1259 states have internal predecessors, (3161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:26,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 3161 transitions. [2021-10-04 18:50:26,054 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 3161 transitions. Word has length 38 [2021-10-04 18:50:26,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:26,054 INFO L470 AbstractCegarLoop]: Abstraction has 1260 states and 3161 transitions. [2021-10-04 18:50:26,054 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-04 18:50:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 3161 transitions. [2021-10-04 18:50:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:26,056 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:26,058 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:26,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-10-04 18:50:26,059 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-04 18:50:26,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:26,059 INFO L82 PathProgramCache]: Analyzing trace with hash 328054976, now seen corresponding path program 127 times [2021-10-04 18:50:26,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:26,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839741307] [2021-10-04 18:50:26,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:26,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:26,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:26,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:26,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839741307] [2021-10-04 18:50:26,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839741307] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:26,156 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:26,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:26,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899992064] [2021-10-04 18:50:26,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:26,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:26,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:26,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:26,158 INFO L87 Difference]: Start difference. First operand 1260 states and 3161 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:26,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:26,701 INFO L93 Difference]: Finished difference Result 1508 states and 3664 transitions. [2021-10-04 18:50:26,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-04 18:50:26,702 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:26,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:26,705 INFO L225 Difference]: With dead ends: 1508 [2021-10-04 18:50:26,705 INFO L226 Difference]: Without dead ends: 1470 [2021-10-04 18:50:26,705 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 215.8ms TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2021-10-04 18:50:26,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2021-10-04 18:50:26,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1246. [2021-10-04 18:50:26,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1245 states have (on average 2.517269076305221) internal successors, (3134), 1245 states have internal predecessors, (3134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:26,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 3134 transitions. [2021-10-04 18:50:26,723 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 3134 transitions. Word has length 38 [2021-10-04 18:50:26,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:26,724 INFO L470 AbstractCegarLoop]: Abstraction has 1246 states and 3134 transitions. [2021-10-04 18:50:26,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:26,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 3134 transitions. [2021-10-04 18:50:26,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:26,726 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:26,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-04 18:50:26,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2021-10-04 18:50:26,726 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-04 18:50:26,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:26,727 INFO L82 PathProgramCache]: Analyzing trace with hash -914695018, now seen corresponding path program 128 times [2021-10-04 18:50:26,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:26,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549992546] [2021-10-04 18:50:26,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:26,728 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:26,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:26,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:26,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549992546] [2021-10-04 18:50:26,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549992546] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:26,837 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:26,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:26,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279593846] [2021-10-04 18:50:26,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:26,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:26,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:26,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:26,838 INFO L87 Difference]: Start difference. First operand 1246 states and 3134 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-04 18:50:27,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:27,268 INFO L93 Difference]: Finished difference Result 1306 states and 3244 transitions. [2021-10-04 18:50:27,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:50:27,269 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-04 18:50:27,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:27,271 INFO L225 Difference]: With dead ends: 1306 [2021-10-04 18:50:27,271 INFO L226 Difference]: Without dead ends: 1284 [2021-10-04 18:50:27,271 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 221.9ms TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:50:27,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2021-10-04 18:50:27,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1246. [2021-10-04 18:50:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1245 states have (on average 2.5108433734939757) internal successors, (3126), 1245 states have internal predecessors, (3126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 3126 transitions. [2021-10-04 18:50:27,287 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 3126 transitions. Word has length 38 [2021-10-04 18:50:27,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:27,288 INFO L470 AbstractCegarLoop]: Abstraction has 1246 states and 3126 transitions. [2021-10-04 18:50:27,288 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-04 18:50:27,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 3126 transitions. [2021-10-04 18:50:27,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:27,290 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:27,290 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:27,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2021-10-04 18:50:27,290 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-04 18:50:27,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:27,290 INFO L82 PathProgramCache]: Analyzing trace with hash 761661880, now seen corresponding path program 129 times [2021-10-04 18:50:27,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:27,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592125719] [2021-10-04 18:50:27,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:27,291 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:27,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:27,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:27,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592125719] [2021-10-04 18:50:27,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592125719] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:27,380 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:27,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:27,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347644254] [2021-10-04 18:50:27,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:27,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:27,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:27,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:27,381 INFO L87 Difference]: Start difference. First operand 1246 states and 3126 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:27,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:27,858 INFO L93 Difference]: Finished difference Result 1506 states and 3670 transitions. [2021-10-04 18:50:27,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-04 18:50:27,858 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:27,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:27,861 INFO L225 Difference]: With dead ends: 1506 [2021-10-04 18:50:27,861 INFO L226 Difference]: Without dead ends: 1464 [2021-10-04 18:50:27,861 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 223.0ms TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2021-10-04 18:50:27,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2021-10-04 18:50:27,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1246. [2021-10-04 18:50:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1245 states have (on average 2.5092369477911647) internal successors, (3124), 1245 states have internal predecessors, (3124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 3124 transitions. [2021-10-04 18:50:27,877 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 3124 transitions. Word has length 38 [2021-10-04 18:50:27,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:27,877 INFO L470 AbstractCegarLoop]: Abstraction has 1246 states and 3124 transitions. [2021-10-04 18:50:27,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:27,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 3124 transitions. [2021-10-04 18:50:27,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:27,879 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:27,879 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:27,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2021-10-04 18:50:27,879 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-04 18:50:27,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:27,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1972779968, now seen corresponding path program 130 times [2021-10-04 18:50:27,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:27,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955771696] [2021-10-04 18:50:27,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:27,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:27,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-04 18:50:27,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:27,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955771696] [2021-10-04 18:50:27,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955771696] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:27,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:27,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:27,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351335884] [2021-10-04 18:50:27,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:27,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:27,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:27,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:27,997 INFO L87 Difference]: Start difference. First operand 1246 states and 3124 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-04 18:50:28,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:28,403 INFO L93 Difference]: Finished difference Result 1312 states and 3248 transitions. [2021-10-04 18:50:28,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-04 18:50:28,404 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-04 18:50:28,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:28,406 INFO L225 Difference]: With dead ends: 1312 [2021-10-04 18:50:28,406 INFO L226 Difference]: Without dead ends: 1294 [2021-10-04 18:50:28,406 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 207.0ms TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:50:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2021-10-04 18:50:28,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1244. [2021-10-04 18:50:28,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 1243 states have (on average 2.509251810136766) internal successors, (3119), 1243 states have internal predecessors, (3119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 3119 transitions. [2021-10-04 18:50:28,421 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 3119 transitions. Word has length 38 [2021-10-04 18:50:28,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:28,421 INFO L470 AbstractCegarLoop]: Abstraction has 1244 states and 3119 transitions. [2021-10-04 18:50:28,421 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-04 18:50:28,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 3119 transitions. [2021-10-04 18:50:28,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:28,423 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:28,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-04 18:50:28,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2021-10-04 18:50:28,423 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-04 18:50:28,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:28,423 INFO L82 PathProgramCache]: Analyzing trace with hash -654223364, now seen corresponding path program 131 times [2021-10-04 18:50:28,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:28,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069110561] [2021-10-04 18:50:28,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:28,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:28,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:28,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:28,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069110561] [2021-10-04 18:50:28,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069110561] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:28,549 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:28,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:28,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38953517] [2021-10-04 18:50:28,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:28,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:28,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:28,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:28,551 INFO L87 Difference]: Start difference. First operand 1244 states and 3119 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-04 18:50:28,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:28,921 INFO L93 Difference]: Finished difference Result 1320 states and 3266 transitions. [2021-10-04 18:50:28,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-04 18:50:28,921 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-04 18:50:28,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:28,923 INFO L225 Difference]: With dead ends: 1320 [2021-10-04 18:50:28,923 INFO L226 Difference]: Without dead ends: 1304 [2021-10-04 18:50:28,923 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 203.4ms TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:50:28,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2021-10-04 18:50:28,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1250. [2021-10-04 18:50:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 2.5044035228182544) internal successors, (3128), 1249 states have internal predecessors, (3128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:28,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 3128 transitions. [2021-10-04 18:50:28,938 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 3128 transitions. Word has length 38 [2021-10-04 18:50:28,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:28,938 INFO L470 AbstractCegarLoop]: Abstraction has 1250 states and 3128 transitions. [2021-10-04 18:50:28,938 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-04 18:50:28,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 3128 transitions. [2021-10-04 18:50:28,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:28,940 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:28,940 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:28,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2021-10-04 18:50:28,940 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-04 18:50:28,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:28,940 INFO L82 PathProgramCache]: Analyzing trace with hash 278383586, now seen corresponding path program 132 times [2021-10-04 18:50:28,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:28,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321141509] [2021-10-04 18:50:28,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:28,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:29,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-04 18:50:29,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:29,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321141509] [2021-10-04 18:50:29,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321141509] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:29,062 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:29,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:29,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566666641] [2021-10-04 18:50:29,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:29,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:29,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:29,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:29,063 INFO L87 Difference]: Start difference. First operand 1250 states and 3128 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-04 18:50:29,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:29,454 INFO L93 Difference]: Finished difference Result 1324 states and 3278 transitions. [2021-10-04 18:50:29,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-04 18:50:29,455 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-04 18:50:29,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:29,458 INFO L225 Difference]: With dead ends: 1324 [2021-10-04 18:50:29,458 INFO L226 Difference]: Without dead ends: 1314 [2021-10-04 18:50:29,458 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 197.0ms TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:50:29,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2021-10-04 18:50:29,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1252. [2021-10-04 18:50:29,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1251 states have (on average 2.5027977617905677) internal successors, (3131), 1251 states have internal predecessors, (3131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 3131 transitions. [2021-10-04 18:50:29,482 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 3131 transitions. Word has length 38 [2021-10-04 18:50:29,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:29,483 INFO L470 AbstractCegarLoop]: Abstraction has 1252 states and 3131 transitions. [2021-10-04 18:50:29,483 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-04 18:50:29,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 3131 transitions. [2021-10-04 18:50:29,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:29,486 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:29,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-04 18:50:29,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2021-10-04 18:50:29,486 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-04 18:50:29,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:29,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1838345480, now seen corresponding path program 133 times [2021-10-04 18:50:29,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:29,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625361180] [2021-10-04 18:50:29,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:29,488 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:29,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:29,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:29,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625361180] [2021-10-04 18:50:29,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625361180] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:29,615 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:29,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:29,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413366759] [2021-10-04 18:50:29,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:29,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:29,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:29,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:29,617 INFO L87 Difference]: Start difference. First operand 1252 states and 3131 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-04 18:50:30,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:30,047 INFO L93 Difference]: Finished difference Result 1418 states and 3480 transitions. [2021-10-04 18:50:30,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-04 18:50:30,048 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-04 18:50:30,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:30,050 INFO L225 Difference]: With dead ends: 1418 [2021-10-04 18:50:30,050 INFO L226 Difference]: Without dead ends: 1396 [2021-10-04 18:50:30,051 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 210.8ms TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:50:30,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2021-10-04 18:50:30,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1244. [2021-10-04 18:50:30,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 1243 states have (on average 2.507642799678198) internal successors, (3117), 1243 states have internal predecessors, (3117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:30,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 3117 transitions. [2021-10-04 18:50:30,067 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 3117 transitions. Word has length 38 [2021-10-04 18:50:30,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:30,067 INFO L470 AbstractCegarLoop]: Abstraction has 1244 states and 3117 transitions. [2021-10-04 18:50:30,067 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-04 18:50:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 3117 transitions. [2021-10-04 18:50:30,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:30,069 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:30,069 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:30,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2021-10-04 18:50:30,070 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-04 18:50:30,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:30,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1475534912, now seen corresponding path program 134 times [2021-10-04 18:50:30,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:30,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236418468] [2021-10-04 18:50:30,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:30,070 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:30,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-04 18:50:30,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:30,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236418468] [2021-10-04 18:50:30,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236418468] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:30,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:30,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:50:30,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058434360] [2021-10-04 18:50:30,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:50:30,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:30,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:50:30,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:50:30,147 INFO L87 Difference]: Start difference. First operand 1244 states and 3117 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-04 18:50:30,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:30,471 INFO L93 Difference]: Finished difference Result 1306 states and 3235 transitions. [2021-10-04 18:50:30,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:50:30,471 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-04 18:50:30,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:30,473 INFO L225 Difference]: With dead ends: 1306 [2021-10-04 18:50:30,473 INFO L226 Difference]: Without dead ends: 1290 [2021-10-04 18:50:30,473 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 122.3ms TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2021-10-04 18:50:30,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2021-10-04 18:50:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1238. [2021-10-04 18:50:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1237 states have (on average 2.50767987065481) internal successors, (3102), 1237 states have internal predecessors, (3102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:30,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 3102 transitions. [2021-10-04 18:50:30,488 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 3102 transitions. Word has length 38 [2021-10-04 18:50:30,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:30,488 INFO L470 AbstractCegarLoop]: Abstraction has 1238 states and 3102 transitions. [2021-10-04 18:50:30,488 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-04 18:50:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 3102 transitions. [2021-10-04 18:50:30,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:30,490 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:30,490 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:30,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2021-10-04 18:50:30,490 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-04 18:50:30,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:30,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1936448532, now seen corresponding path program 135 times [2021-10-04 18:50:30,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:30,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420609191] [2021-10-04 18:50:30,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:30,491 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:30,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:30,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420609191] [2021-10-04 18:50:30,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420609191] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:30,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:30,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:50:30,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054465286] [2021-10-04 18:50:30,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:50:30,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:30,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:50:30,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:50:30,580 INFO L87 Difference]: Start difference. First operand 1238 states and 3102 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-04 18:50:31,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:31,000 INFO L93 Difference]: Finished difference Result 1466 states and 3569 transitions. [2021-10-04 18:50:31,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:50:31,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-04 18:50:31,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:31,003 INFO L225 Difference]: With dead ends: 1466 [2021-10-04 18:50:31,003 INFO L226 Difference]: Without dead ends: 1436 [2021-10-04 18:50:31,004 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 167.6ms TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:50:31,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2021-10-04 18:50:31,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1238. [2021-10-04 18:50:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1237 states have (on average 2.50767987065481) internal successors, (3102), 1237 states have internal predecessors, (3102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:31,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 3102 transitions. [2021-10-04 18:50:31,019 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 3102 transitions. Word has length 38 [2021-10-04 18:50:31,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:31,019 INFO L470 AbstractCegarLoop]: Abstraction has 1238 states and 3102 transitions. [2021-10-04 18:50:31,019 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-04 18:50:31,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 3102 transitions. [2021-10-04 18:50:31,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:31,020 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:31,021 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:31,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2021-10-04 18:50:31,021 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-04 18:50:31,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:31,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1828255318, now seen corresponding path program 136 times [2021-10-04 18:50:31,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:31,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023709729] [2021-10-04 18:50:31,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:31,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:31,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-04 18:50:31,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:31,117 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023709729] [2021-10-04 18:50:31,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023709729] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:31,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:31,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:31,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736508135] [2021-10-04 18:50:31,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:31,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:31,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:31,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:31,118 INFO L87 Difference]: Start difference. First operand 1238 states and 3102 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:31,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:31,681 INFO L93 Difference]: Finished difference Result 1544 states and 3682 transitions. [2021-10-04 18:50:31,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-04 18:50:31,682 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:31,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:31,684 INFO L225 Difference]: With dead ends: 1544 [2021-10-04 18:50:31,684 INFO L226 Difference]: Without dead ends: 1336 [2021-10-04 18:50:31,684 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 217.6ms TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2021-10-04 18:50:31,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2021-10-04 18:50:31,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1122. [2021-10-04 18:50:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 2.4674397859054418) internal successors, (2766), 1121 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:31,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 2766 transitions. [2021-10-04 18:50:31,698 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 2766 transitions. Word has length 38 [2021-10-04 18:50:31,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:31,698 INFO L470 AbstractCegarLoop]: Abstraction has 1122 states and 2766 transitions. [2021-10-04 18:50:31,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:31,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 2766 transitions. [2021-10-04 18:50:31,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:31,700 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:31,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-04 18:50:31,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2021-10-04 18:50:31,701 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-04 18:50:31,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:31,701 INFO L82 PathProgramCache]: Analyzing trace with hash 705839872, now seen corresponding path program 137 times [2021-10-04 18:50:31,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:31,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398696419] [2021-10-04 18:50:31,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:31,702 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:31,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:31,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398696419] [2021-10-04 18:50:31,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398696419] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:31,794 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:31,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:31,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887690101] [2021-10-04 18:50:31,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:31,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:31,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:31,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:31,796 INFO L87 Difference]: Start difference. First operand 1122 states and 2766 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:32,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:32,251 INFO L93 Difference]: Finished difference Result 1312 states and 3144 transitions. [2021-10-04 18:50:32,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-04 18:50:32,251 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:32,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:32,253 INFO L225 Difference]: With dead ends: 1312 [2021-10-04 18:50:32,253 INFO L226 Difference]: Without dead ends: 1288 [2021-10-04 18:50:32,254 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 190.1ms TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2021-10-04 18:50:32,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2021-10-04 18:50:32,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1110. [2021-10-04 18:50:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1109 states have (on average 2.459873760144274) internal successors, (2728), 1109 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 2728 transitions. [2021-10-04 18:50:32,267 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 2728 transitions. Word has length 38 [2021-10-04 18:50:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:32,267 INFO L470 AbstractCegarLoop]: Abstraction has 1110 states and 2728 transitions. [2021-10-04 18:50:32,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:32,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 2728 transitions. [2021-10-04 18:50:32,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:32,269 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:32,269 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:32,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2021-10-04 18:50:32,269 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-04 18:50:32,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:32,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1307811072, now seen corresponding path program 138 times [2021-10-04 18:50:32,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:32,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543642866] [2021-10-04 18:50:32,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:32,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:32,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:32,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543642866] [2021-10-04 18:50:32,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543642866] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:32,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:32,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:50:32,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928207807] [2021-10-04 18:50:32,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:50:32,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:32,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:50:32,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:50:32,357 INFO L87 Difference]: Start difference. First operand 1110 states and 2728 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-04 18:50:32,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:32,756 INFO L93 Difference]: Finished difference Result 1086 states and 2546 transitions. [2021-10-04 18:50:32,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-04 18:50:32,757 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-04 18:50:32,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:32,758 INFO L225 Difference]: With dead ends: 1086 [2021-10-04 18:50:32,758 INFO L226 Difference]: Without dead ends: 966 [2021-10-04 18:50:32,761 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 171.3ms TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:50:32,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2021-10-04 18:50:32,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 794. [2021-10-04 18:50:32,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 2.4262295081967213) internal successors, (1924), 793 states have internal predecessors, (1924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1924 transitions. [2021-10-04 18:50:32,772 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1924 transitions. Word has length 38 [2021-10-04 18:50:32,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:32,774 INFO L470 AbstractCegarLoop]: Abstraction has 794 states and 1924 transitions. [2021-10-04 18:50:32,774 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-04 18:50:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1924 transitions. [2021-10-04 18:50:32,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:32,775 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:32,775 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:32,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2021-10-04 18:50:32,775 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-04 18:50:32,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:32,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1482565354, now seen corresponding path program 139 times [2021-10-04 18:50:32,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:32,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061717147] [2021-10-04 18:50:32,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:32,776 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:32,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-04 18:50:32,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:32,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061717147] [2021-10-04 18:50:32,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061717147] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:32,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:32,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:50:32,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639856549] [2021-10-04 18:50:32,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:50:32,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:32,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:50:32,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:50:32,854 INFO L87 Difference]: Start difference. First operand 794 states and 1924 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-04 18:50:33,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:33,214 INFO L93 Difference]: Finished difference Result 948 states and 2237 transitions. [2021-10-04 18:50:33,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-04 18:50:33,214 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-04 18:50:33,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:33,216 INFO L225 Difference]: With dead ends: 948 [2021-10-04 18:50:33,216 INFO L226 Difference]: Without dead ends: 918 [2021-10-04 18:50:33,216 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 131.2ms TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:50:33,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2021-10-04 18:50:33,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 770. [2021-10-04 18:50:33,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 2.431729518855657) internal successors, (1870), 769 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1870 transitions. [2021-10-04 18:50:33,226 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1870 transitions. Word has length 38 [2021-10-04 18:50:33,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:33,226 INFO L470 AbstractCegarLoop]: Abstraction has 770 states and 1870 transitions. [2021-10-04 18:50:33,226 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-04 18:50:33,226 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1870 transitions. [2021-10-04 18:50:33,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:33,227 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:33,227 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:33,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2021-10-04 18:50:33,227 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-04 18:50:33,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:33,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1120419600, now seen corresponding path program 140 times [2021-10-04 18:50:33,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:33,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124501940] [2021-10-04 18:50:33,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:33,228 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:33,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:33,296 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124501940] [2021-10-04 18:50:33,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124501940] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:33,297 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:33,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:50:33,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271305927] [2021-10-04 18:50:33,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:50:33,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:33,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:50:33,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:50:33,298 INFO L87 Difference]: Start difference. First operand 770 states and 1870 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-04 18:50:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:33,535 INFO L93 Difference]: Finished difference Result 856 states and 2037 transitions. [2021-10-04 18:50:33,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:50:33,536 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-04 18:50:33,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:33,537 INFO L225 Difference]: With dead ends: 856 [2021-10-04 18:50:33,537 INFO L226 Difference]: Without dead ends: 772 [2021-10-04 18:50:33,537 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 86.6ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-10-04 18:50:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2021-10-04 18:50:33,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 736. [2021-10-04 18:50:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 735 states have (on average 2.3714285714285714) internal successors, (1743), 735 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-04 18:50:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1743 transitions. [2021-10-04 18:50:33,546 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1743 transitions. Word has length 38 [2021-10-04 18:50:33,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:33,546 INFO L470 AbstractCegarLoop]: Abstraction has 736 states and 1743 transitions. [2021-10-04 18:50:33,546 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-04 18:50:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1743 transitions. [2021-10-04 18:50:33,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:33,547 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:33,547 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:33,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2021-10-04 18:50:33,548 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-04 18:50:33,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:33,548 INFO L82 PathProgramCache]: Analyzing trace with hash 438685318, now seen corresponding path program 141 times [2021-10-04 18:50:33,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:33,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869674859] [2021-10-04 18:50:33,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:33,549 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:33,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:33,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:33,641 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869674859] [2021-10-04 18:50:33,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869674859] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:33,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:33,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:33,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949419023] [2021-10-04 18:50:33,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:33,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:33,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:33,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:33,643 INFO L87 Difference]: Start difference. First operand 736 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-04 18:50:33,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:33,957 INFO L93 Difference]: Finished difference Result 842 states and 1962 transitions. [2021-10-04 18:50:33,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:50:33,957 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:33,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:33,959 INFO L225 Difference]: With dead ends: 842 [2021-10-04 18:50:33,959 INFO L226 Difference]: Without dead ends: 824 [2021-10-04 18:50:33,960 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 139.4ms TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:50:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2021-10-04 18:50:33,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 722. [2021-10-04 18:50:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 721 states have (on average 2.3717059639389735) internal successors, (1710), 721 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1710 transitions. [2021-10-04 18:50:33,969 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1710 transitions. Word has length 38 [2021-10-04 18:50:33,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:33,970 INFO L470 AbstractCegarLoop]: Abstraction has 722 states and 1710 transitions. [2021-10-04 18:50:33,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:33,970 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1710 transitions. [2021-10-04 18:50:33,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:33,971 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:33,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-04 18:50:33,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2021-10-04 18:50:33,971 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-04 18:50:33,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:33,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1149597078, now seen corresponding path program 142 times [2021-10-04 18:50:33,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:33,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660923123] [2021-10-04 18:50:33,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:33,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:34,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:34,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:34,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660923123] [2021-10-04 18:50:34,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660923123] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:34,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:34,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:34,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091413523] [2021-10-04 18:50:34,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:34,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:34,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:34,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:34,070 INFO L87 Difference]: Start difference. First operand 722 states and 1710 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-04 18:50:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:34,493 INFO L93 Difference]: Finished difference Result 830 states and 1932 transitions. [2021-10-04 18:50:34,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-04 18:50:34,493 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-04 18:50:34,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:34,495 INFO L225 Difference]: With dead ends: 830 [2021-10-04 18:50:34,495 INFO L226 Difference]: Without dead ends: 814 [2021-10-04 18:50:34,495 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 189.9ms TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:50:34,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2021-10-04 18:50:34,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 734. [2021-10-04 18:50:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 2.379263301500682) internal successors, (1744), 733 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:34,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1744 transitions. [2021-10-04 18:50:34,503 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1744 transitions. Word has length 38 [2021-10-04 18:50:34,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:34,504 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 1744 transitions. [2021-10-04 18:50:34,504 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-04 18:50:34,504 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1744 transitions. [2021-10-04 18:50:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:34,505 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:34,505 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:34,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2021-10-04 18:50:34,505 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-04 18:50:34,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:34,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1708263052, now seen corresponding path program 143 times [2021-10-04 18:50:34,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:34,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90145791] [2021-10-04 18:50:34,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:34,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:34,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-04 18:50:34,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:34,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90145791] [2021-10-04 18:50:34,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90145791] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:34,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:34,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:34,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115908788] [2021-10-04 18:50:34,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:34,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:34,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:34,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:34,597 INFO L87 Difference]: Start difference. First operand 734 states and 1744 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-04 18:50:34,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:34,975 INFO L93 Difference]: Finished difference Result 784 states and 1829 transitions. [2021-10-04 18:50:34,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-04 18:50:34,975 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-04 18:50:34,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:34,976 INFO L225 Difference]: With dead ends: 784 [2021-10-04 18:50:34,976 INFO L226 Difference]: Without dead ends: 758 [2021-10-04 18:50:34,977 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 182.0ms TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:50:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2021-10-04 18:50:34,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 728. [2021-10-04 18:50:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 727 states have (on average 2.370013755158184) internal successors, (1723), 727 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1723 transitions. [2021-10-04 18:50:34,986 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1723 transitions. Word has length 38 [2021-10-04 18:50:34,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:34,986 INFO L470 AbstractCegarLoop]: Abstraction has 728 states and 1723 transitions. [2021-10-04 18:50:34,986 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-04 18:50:34,986 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1723 transitions. [2021-10-04 18:50:34,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:34,987 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:34,987 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:34,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2021-10-04 18:50:34,987 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-04 18:50:34,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:34,988 INFO L82 PathProgramCache]: Analyzing trace with hash 468121878, now seen corresponding path program 144 times [2021-10-04 18:50:34,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:34,990 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858338764] [2021-10-04 18:50:34,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:34,991 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:35,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-04 18:50:35,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:35,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858338764] [2021-10-04 18:50:35,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858338764] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:35,100 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:35,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:35,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600473731] [2021-10-04 18:50:35,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:35,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:35,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:35,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:35,101 INFO L87 Difference]: Start difference. First operand 728 states and 1723 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-04 18:50:35,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:35,391 INFO L93 Difference]: Finished difference Result 778 states and 1808 transitions. [2021-10-04 18:50:35,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:50:35,392 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-04 18:50:35,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:35,393 INFO L225 Difference]: With dead ends: 778 [2021-10-04 18:50:35,393 INFO L226 Difference]: Without dead ends: 754 [2021-10-04 18:50:35,394 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 157.0ms TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:50:35,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2021-10-04 18:50:35,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 726. [2021-10-04 18:50:35,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 725 states have (on average 2.3696551724137933) internal successors, (1718), 725 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:35,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1718 transitions. [2021-10-04 18:50:35,402 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1718 transitions. Word has length 38 [2021-10-04 18:50:35,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:35,402 INFO L470 AbstractCegarLoop]: Abstraction has 726 states and 1718 transitions. [2021-10-04 18:50:35,402 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-04 18:50:35,402 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1718 transitions. [2021-10-04 18:50:35,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:35,403 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:35,403 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:35,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2021-10-04 18:50:35,404 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-04 18:50:35,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:35,404 INFO L82 PathProgramCache]: Analyzing trace with hash 731200150, now seen corresponding path program 145 times [2021-10-04 18:50:35,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:35,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354991786] [2021-10-04 18:50:35,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:35,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:35,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:35,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354991786] [2021-10-04 18:50:35,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354991786] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:35,492 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:35,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:35,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778649633] [2021-10-04 18:50:35,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:35,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:35,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:35,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:35,494 INFO L87 Difference]: Start difference. First operand 726 states and 1718 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:35,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:35,775 INFO L93 Difference]: Finished difference Result 798 states and 1852 transitions. [2021-10-04 18:50:35,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:50:35,775 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:35,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:35,777 INFO L225 Difference]: With dead ends: 798 [2021-10-04 18:50:35,777 INFO L226 Difference]: Without dead ends: 782 [2021-10-04 18:50:35,778 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 135.7ms TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:50:35,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2021-10-04 18:50:35,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 728. [2021-10-04 18:50:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 727 states have (on average 2.3672627235213204) internal successors, (1721), 727 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1721 transitions. [2021-10-04 18:50:35,786 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1721 transitions. Word has length 38 [2021-10-04 18:50:35,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:35,786 INFO L470 AbstractCegarLoop]: Abstraction has 728 states and 1721 transitions. [2021-10-04 18:50:35,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:35,787 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1721 transitions. [2021-10-04 18:50:35,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:35,788 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:35,788 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:35,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2021-10-04 18:50:35,788 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-04 18:50:35,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:35,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1759667398, now seen corresponding path program 146 times [2021-10-04 18:50:35,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:35,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303303794] [2021-10-04 18:50:35,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:35,789 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:35,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:35,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303303794] [2021-10-04 18:50:35,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303303794] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:35,894 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:35,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:35,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248743299] [2021-10-04 18:50:35,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:35,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:35,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:35,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:35,895 INFO L87 Difference]: Start difference. First operand 728 states and 1721 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:36,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:36,208 INFO L93 Difference]: Finished difference Result 806 states and 1868 transitions. [2021-10-04 18:50:36,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:50:36,208 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:36,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:36,210 INFO L225 Difference]: With dead ends: 806 [2021-10-04 18:50:36,210 INFO L226 Difference]: Without dead ends: 792 [2021-10-04 18:50:36,210 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 151.5ms TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:50:36,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2021-10-04 18:50:36,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 726. [2021-10-04 18:50:36,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 725 states have (on average 2.366896551724138) internal successors, (1716), 725 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1716 transitions. [2021-10-04 18:50:36,220 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1716 transitions. Word has length 38 [2021-10-04 18:50:36,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:36,220 INFO L470 AbstractCegarLoop]: Abstraction has 726 states and 1716 transitions. [2021-10-04 18:50:36,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:36,220 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1716 transitions. [2021-10-04 18:50:36,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:36,222 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:36,222 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:36,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2021-10-04 18:50:36,222 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-04 18:50:36,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:36,223 INFO L82 PathProgramCache]: Analyzing trace with hash 33758166, now seen corresponding path program 147 times [2021-10-04 18:50:36,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:36,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374857426] [2021-10-04 18:50:36,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:36,224 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:36,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:36,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:36,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374857426] [2021-10-04 18:50:36,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374857426] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:36,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:36,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:36,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205296527] [2021-10-04 18:50:36,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:36,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:36,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:36,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:36,327 INFO L87 Difference]: Start difference. First operand 726 states and 1716 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:36,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:36,631 INFO L93 Difference]: Finished difference Result 808 states and 1861 transitions. [2021-10-04 18:50:36,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:50:36,631 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:36,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:36,633 INFO L225 Difference]: With dead ends: 808 [2021-10-04 18:50:36,633 INFO L226 Difference]: Without dead ends: 792 [2021-10-04 18:50:36,633 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 129.7ms TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2021-10-04 18:50:36,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2021-10-04 18:50:36,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 732. [2021-10-04 18:50:36,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 2.359781121751026) internal successors, (1725), 731 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1725 transitions. [2021-10-04 18:50:36,641 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1725 transitions. Word has length 38 [2021-10-04 18:50:36,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:36,642 INFO L470 AbstractCegarLoop]: Abstraction has 732 states and 1725 transitions. [2021-10-04 18:50:36,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1725 transitions. [2021-10-04 18:50:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:36,643 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:36,643 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:36,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2021-10-04 18:50:36,643 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-04 18:50:36,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:36,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1898443408, now seen corresponding path program 148 times [2021-10-04 18:50:36,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:36,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592078388] [2021-10-04 18:50:36,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:36,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:36,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:36,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592078388] [2021-10-04 18:50:36,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592078388] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:36,740 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:36,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:36,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470470415] [2021-10-04 18:50:36,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:36,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:36,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:36,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:36,742 INFO L87 Difference]: Start difference. First operand 732 states and 1725 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:37,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:37,073 INFO L93 Difference]: Finished difference Result 818 states and 1886 transitions. [2021-10-04 18:50:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:50:37,074 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:37,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:37,075 INFO L225 Difference]: With dead ends: 818 [2021-10-04 18:50:37,075 INFO L226 Difference]: Without dead ends: 794 [2021-10-04 18:50:37,075 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 152.3ms TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:50:37,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2021-10-04 18:50:37,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 720. [2021-10-04 18:50:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 719 states have (on average 2.365785813630042) internal successors, (1701), 719 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1701 transitions. [2021-10-04 18:50:37,084 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1701 transitions. Word has length 38 [2021-10-04 18:50:37,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:37,084 INFO L470 AbstractCegarLoop]: Abstraction has 720 states and 1701 transitions. [2021-10-04 18:50:37,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:37,084 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1701 transitions. [2021-10-04 18:50:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:37,085 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:37,085 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:37,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2021-10-04 18:50:37,085 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-04 18:50:37,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:37,086 INFO L82 PathProgramCache]: Analyzing trace with hash -716806214, now seen corresponding path program 149 times [2021-10-04 18:50:37,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:37,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864021126] [2021-10-04 18:50:37,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:37,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:37,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-04 18:50:37,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:37,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864021126] [2021-10-04 18:50:37,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864021126] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:37,182 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:37,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:37,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750483691] [2021-10-04 18:50:37,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:37,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:37,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:37,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:37,183 INFO L87 Difference]: Start difference. First operand 720 states and 1701 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-04 18:50:37,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:37,503 INFO L93 Difference]: Finished difference Result 770 states and 1784 transitions. [2021-10-04 18:50:37,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:50:37,503 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-04 18:50:37,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:37,504 INFO L225 Difference]: With dead ends: 770 [2021-10-04 18:50:37,504 INFO L226 Difference]: Without dead ends: 752 [2021-10-04 18:50:37,505 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 150.2ms TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:50:37,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2021-10-04 18:50:37,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 718. [2021-10-04 18:50:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 2.3654114365411436) internal successors, (1696), 717 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:37,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1696 transitions. [2021-10-04 18:50:37,513 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1696 transitions. Word has length 38 [2021-10-04 18:50:37,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:37,513 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 1696 transitions. [2021-10-04 18:50:37,513 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-04 18:50:37,513 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1696 transitions. [2021-10-04 18:50:37,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:37,514 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:37,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-04 18:50:37,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2021-10-04 18:50:37,514 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-04 18:50:37,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:37,515 INFO L82 PathProgramCache]: Analyzing trace with hash 601750390, now seen corresponding path program 150 times [2021-10-04 18:50:37,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:37,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755861111] [2021-10-04 18:50:37,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:37,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:37,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-04 18:50:37,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:37,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755861111] [2021-10-04 18:50:37,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755861111] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:37,609 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:37,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:37,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447682303] [2021-10-04 18:50:37,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:37,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:37,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:37,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:37,611 INFO L87 Difference]: Start difference. First operand 718 states and 1696 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-04 18:50:37,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:37,918 INFO L93 Difference]: Finished difference Result 760 states and 1767 transitions. [2021-10-04 18:50:37,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:50:37,919 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-04 18:50:37,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:37,920 INFO L225 Difference]: With dead ends: 760 [2021-10-04 18:50:37,920 INFO L226 Difference]: Without dead ends: 744 [2021-10-04 18:50:37,920 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 145.7ms TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:50:37,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2021-10-04 18:50:37,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 718. [2021-10-04 18:50:37,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 2.3570432357043236) internal successors, (1690), 717 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1690 transitions. [2021-10-04 18:50:37,929 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1690 transitions. Word has length 38 [2021-10-04 18:50:37,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:37,929 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 1690 transitions. [2021-10-04 18:50:37,929 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-04 18:50:37,929 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1690 transitions. [2021-10-04 18:50:37,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:37,930 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:37,930 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:37,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2021-10-04 18:50:37,931 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-04 18:50:37,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:37,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1144979982, now seen corresponding path program 151 times [2021-10-04 18:50:37,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:37,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608356230] [2021-10-04 18:50:37,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:37,932 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:38,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:38,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:38,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608356230] [2021-10-04 18:50:38,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608356230] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:38,048 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:38,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:38,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091297916] [2021-10-04 18:50:38,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:38,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:38,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:38,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:38,049 INFO L87 Difference]: Start difference. First operand 718 states and 1690 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-04 18:50:38,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:38,391 INFO L93 Difference]: Finished difference Result 752 states and 1749 transitions. [2021-10-04 18:50:38,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:50:38,392 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-04 18:50:38,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:38,393 INFO L225 Difference]: With dead ends: 752 [2021-10-04 18:50:38,393 INFO L226 Difference]: Without dead ends: 718 [2021-10-04 18:50:38,393 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 188.4ms TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:50:38,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2021-10-04 18:50:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 702. [2021-10-04 18:50:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 701 states have (on average 2.3680456490727533) internal successors, (1660), 701 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1660 transitions. [2021-10-04 18:50:38,401 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1660 transitions. Word has length 38 [2021-10-04 18:50:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:38,402 INFO L470 AbstractCegarLoop]: Abstraction has 702 states and 1660 transitions. [2021-10-04 18:50:38,402 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-04 18:50:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1660 transitions. [2021-10-04 18:50:38,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:38,403 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:38,403 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:38,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2021-10-04 18:50:38,403 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-04 18:50:38,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:38,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1705507774, now seen corresponding path program 152 times [2021-10-04 18:50:38,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:38,403 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505067540] [2021-10-04 18:50:38,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:38,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:38,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:38,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:38,464 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505067540] [2021-10-04 18:50:38,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505067540] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:38,465 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:38,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:50:38,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963520026] [2021-10-04 18:50:38,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:50:38,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:38,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:50:38,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:50:38,466 INFO L87 Difference]: Start difference. First operand 702 states and 1660 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-04 18:50:38,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:38,643 INFO L93 Difference]: Finished difference Result 598 states and 1356 transitions. [2021-10-04 18:50:38,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-04 18:50:38,643 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-04 18:50:38,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:38,644 INFO L225 Difference]: With dead ends: 598 [2021-10-04 18:50:38,644 INFO L226 Difference]: Without dead ends: 538 [2021-10-04 18:50:38,644 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 54.4ms TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:38,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-10-04 18:50:38,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 474. [2021-10-04 18:50:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 2.2579281183932345) internal successors, (1068), 473 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1068 transitions. [2021-10-04 18:50:38,650 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1068 transitions. Word has length 38 [2021-10-04 18:50:38,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:38,650 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 1068 transitions. [2021-10-04 18:50:38,650 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-04 18:50:38,651 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1068 transitions. [2021-10-04 18:50:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:38,651 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:38,651 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:38,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2021-10-04 18:50:38,652 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-04 18:50:38,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:38,652 INFO L82 PathProgramCache]: Analyzing trace with hash -370608812, now seen corresponding path program 153 times [2021-10-04 18:50:38,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:38,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736532588] [2021-10-04 18:50:38,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:38,652 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:38,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-04 18:50:38,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:38,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736532588] [2021-10-04 18:50:38,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736532588] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:38,742 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:38,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:38,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330075368] [2021-10-04 18:50:38,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:38,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:38,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:38,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:38,744 INFO L87 Difference]: Start difference. First operand 474 states and 1068 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:39,021 INFO L93 Difference]: Finished difference Result 574 states and 1284 transitions. [2021-10-04 18:50:39,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:50:39,022 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:39,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:39,023 INFO L225 Difference]: With dead ends: 574 [2021-10-04 18:50:39,023 INFO L226 Difference]: Without dead ends: 558 [2021-10-04 18:50:39,024 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 125.2ms TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:50:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-10-04 18:50:39,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 474. [2021-10-04 18:50:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 2.2536997885835097) internal successors, (1066), 473 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1066 transitions. [2021-10-04 18:50:39,030 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1066 transitions. Word has length 38 [2021-10-04 18:50:39,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:39,030 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 1066 transitions. [2021-10-04 18:50:39,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:39,030 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1066 transitions. [2021-10-04 18:50:39,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:39,031 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:39,031 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:39,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2021-10-04 18:50:39,031 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-04 18:50:39,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:39,032 INFO L82 PathProgramCache]: Analyzing trace with hash -929274786, now seen corresponding path program 154 times [2021-10-04 18:50:39,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:39,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805751717] [2021-10-04 18:50:39,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:39,032 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:39,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:39,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:39,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805751717] [2021-10-04 18:50:39,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805751717] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:39,122 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:39,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:39,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594557116] [2021-10-04 18:50:39,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:39,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:39,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:39,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:39,123 INFO L87 Difference]: Start difference. First operand 474 states and 1066 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:39,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:39,382 INFO L93 Difference]: Finished difference Result 552 states and 1233 transitions. [2021-10-04 18:50:39,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:50:39,383 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:39,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:39,384 INFO L225 Difference]: With dead ends: 552 [2021-10-04 18:50:39,384 INFO L226 Difference]: Without dead ends: 526 [2021-10-04 18:50:39,384 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 104.4ms TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2021-10-04 18:50:39,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-10-04 18:50:39,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 468. [2021-10-04 18:50:39,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 2.2419700214132763) internal successors, (1047), 467 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-04 18:50:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1047 transitions. [2021-10-04 18:50:39,389 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1047 transitions. Word has length 38 [2021-10-04 18:50:39,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:39,390 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 1047 transitions. [2021-10-04 18:50:39,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:39,390 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1047 transitions. [2021-10-04 18:50:39,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:39,390 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:39,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-04 18:50:39,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2021-10-04 18:50:39,391 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-04 18:50:39,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:39,391 INFO L82 PathProgramCache]: Analyzing trace with hash -710360644, now seen corresponding path program 155 times [2021-10-04 18:50:39,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:39,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817450561] [2021-10-04 18:50:39,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:39,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:39,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:39,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:39,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817450561] [2021-10-04 18:50:39,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817450561] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:39,484 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:39,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:39,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073697926] [2021-10-04 18:50:39,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:39,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:39,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:39,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:39,486 INFO L87 Difference]: Start difference. First operand 468 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-04 18:50:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:39,747 INFO L93 Difference]: Finished difference Result 542 states and 1208 transitions. [2021-10-04 18:50:39,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:50:39,748 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:39,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:39,749 INFO L225 Difference]: With dead ends: 542 [2021-10-04 18:50:39,749 INFO L226 Difference]: Without dead ends: 526 [2021-10-04 18:50:39,750 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 140.0ms TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:50:39,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-10-04 18:50:39,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 466. [2021-10-04 18:50:39,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 2.2408602150537633) internal successors, (1042), 465 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:39,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1042 transitions. [2021-10-04 18:50:39,755 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1042 transitions. Word has length 38 [2021-10-04 18:50:39,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:39,755 INFO L470 AbstractCegarLoop]: Abstraction has 466 states and 1042 transitions. [2021-10-04 18:50:39,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:39,756 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1042 transitions. [2021-10-04 18:50:39,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:39,756 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:39,756 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:39,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2021-10-04 18:50:39,757 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-04 18:50:39,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:39,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1093739104, now seen corresponding path program 156 times [2021-10-04 18:50:39,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:39,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738437484] [2021-10-04 18:50:39,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:39,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:39,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-04 18:50:39,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:39,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738437484] [2021-10-04 18:50:39,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738437484] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:39,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:39,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:39,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568070256] [2021-10-04 18:50:39,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:39,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:39,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:39,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:39,853 INFO L87 Difference]: Start difference. First operand 466 states and 1042 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:40,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:40,132 INFO L93 Difference]: Finished difference Result 552 states and 1227 transitions. [2021-10-04 18:50:40,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:50:40,133 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:40,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:40,134 INFO L225 Difference]: With dead ends: 552 [2021-10-04 18:50:40,134 INFO L226 Difference]: Without dead ends: 538 [2021-10-04 18:50:40,134 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 142.8ms TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:50:40,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-10-04 18:50:40,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 464. [2021-10-04 18:50:40,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 2.239740820734341) internal successors, (1037), 463 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-04 18:50:40,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1037 transitions. [2021-10-04 18:50:40,140 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1037 transitions. Word has length 38 [2021-10-04 18:50:40,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:40,140 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 1037 transitions. [2021-10-04 18:50:40,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1037 transitions. [2021-10-04 18:50:40,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:40,141 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:40,141 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:40,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2021-10-04 18:50:40,141 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-04 18:50:40,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:40,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1407802628, now seen corresponding path program 157 times [2021-10-04 18:50:40,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:40,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353015430] [2021-10-04 18:50:40,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:40,142 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:40,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-04 18:50:40,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:40,235 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353015430] [2021-10-04 18:50:40,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353015430] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:40,235 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:40,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:40,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867359288] [2021-10-04 18:50:40,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:40,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:40,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:40,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:40,237 INFO L87 Difference]: Start difference. First operand 464 states and 1037 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:40,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:40,522 INFO L93 Difference]: Finished difference Result 546 states and 1208 transitions. [2021-10-04 18:50:40,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:50:40,523 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:40,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:40,524 INFO L225 Difference]: With dead ends: 546 [2021-10-04 18:50:40,524 INFO L226 Difference]: Without dead ends: 530 [2021-10-04 18:50:40,525 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 128.0ms TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2021-10-04 18:50:40,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-10-04 18:50:40,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 458. [2021-10-04 18:50:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 2.236323851203501) internal successors, (1022), 457 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:40,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1022 transitions. [2021-10-04 18:50:40,530 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1022 transitions. Word has length 38 [2021-10-04 18:50:40,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:40,530 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 1022 transitions. [2021-10-04 18:50:40,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:40,531 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1022 transitions. [2021-10-04 18:50:40,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:40,531 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:40,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-04 18:50:40,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2021-10-04 18:50:40,532 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-04 18:50:40,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:40,532 INFO L82 PathProgramCache]: Analyzing trace with hash 954963094, now seen corresponding path program 158 times [2021-10-04 18:50:40,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:40,532 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541252994] [2021-10-04 18:50:40,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:40,532 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:40,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-04 18:50:40,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:40,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541252994] [2021-10-04 18:50:40,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541252994] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:40,613 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:40,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:40,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102424819] [2021-10-04 18:50:40,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:40,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:40,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:40,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:40,614 INFO L87 Difference]: Start difference. First operand 458 states and 1022 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:40,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:40,898 INFO L93 Difference]: Finished difference Result 498 states and 1112 transitions. [2021-10-04 18:50:40,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:50:40,899 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:40,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:40,900 INFO L225 Difference]: With dead ends: 498 [2021-10-04 18:50:40,900 INFO L226 Difference]: Without dead ends: 474 [2021-10-04 18:50:40,900 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 130.1ms TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:50:40,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-10-04 18:50:40,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 410. [2021-10-04 18:50:40,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 2.2640586797066016) internal successors, (926), 409 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 926 transitions. [2021-10-04 18:50:40,905 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 926 transitions. Word has length 38 [2021-10-04 18:50:40,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:40,905 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 926 transitions. [2021-10-04 18:50:40,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:40,905 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 926 transitions. [2021-10-04 18:50:40,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:40,906 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:40,906 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:40,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2021-10-04 18:50:40,906 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-04 18:50:40,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:40,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1952534578, now seen corresponding path program 159 times [2021-10-04 18:50:40,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:40,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343138700] [2021-10-04 18:50:40,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:40,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:40,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:41,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343138700] [2021-10-04 18:50:41,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343138700] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:41,000 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:41,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:41,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518847345] [2021-10-04 18:50:41,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:41,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:41,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:41,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:41,002 INFO L87 Difference]: Start difference. First operand 410 states and 926 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:41,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:41,280 INFO L93 Difference]: Finished difference Result 516 states and 1145 transitions. [2021-10-04 18:50:41,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:50:41,281 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:41,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:41,282 INFO L225 Difference]: With dead ends: 516 [2021-10-04 18:50:41,282 INFO L226 Difference]: Without dead ends: 496 [2021-10-04 18:50:41,283 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 127.9ms TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2021-10-04 18:50:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-10-04 18:50:41,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 422. [2021-10-04 18:50:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 2.2707838479809976) internal successors, (956), 421 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:41,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 956 transitions. [2021-10-04 18:50:41,288 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 956 transitions. Word has length 38 [2021-10-04 18:50:41,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:41,288 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 956 transitions. [2021-10-04 18:50:41,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 956 transitions. [2021-10-04 18:50:41,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:41,289 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:41,289 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:41,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2021-10-04 18:50:41,290 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-04 18:50:41,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:41,290 INFO L82 PathProgramCache]: Analyzing trace with hash 488005178, now seen corresponding path program 160 times [2021-10-04 18:50:41,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:41,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425636002] [2021-10-04 18:50:41,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:41,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:41,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:41,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425636002] [2021-10-04 18:50:41,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425636002] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:41,372 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:41,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:41,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554979722] [2021-10-04 18:50:41,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:41,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:41,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:41,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:41,374 INFO L87 Difference]: Start difference. First operand 422 states and 956 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:41,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:41,796 INFO L93 Difference]: Finished difference Result 790 states and 1744 transitions. [2021-10-04 18:50:41,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-04 18:50:41,796 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:41,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:41,798 INFO L225 Difference]: With dead ends: 790 [2021-10-04 18:50:41,798 INFO L226 Difference]: Without dead ends: 750 [2021-10-04 18:50:41,798 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 190.2ms TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2021-10-04 18:50:41,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2021-10-04 18:50:41,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 428. [2021-10-04 18:50:41,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 2.2927400468384076) internal successors, (979), 427 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 979 transitions. [2021-10-04 18:50:41,804 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 979 transitions. Word has length 38 [2021-10-04 18:50:41,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:41,804 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 979 transitions. [2021-10-04 18:50:41,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:41,805 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 979 transitions. [2021-10-04 18:50:41,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:41,805 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:41,805 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:41,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2021-10-04 18:50:41,806 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-04 18:50:41,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:41,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1018670850, now seen corresponding path program 161 times [2021-10-04 18:50:41,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:41,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537996749] [2021-10-04 18:50:41,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:41,806 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:41,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:41,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:41,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537996749] [2021-10-04 18:50:41,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537996749] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:41,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:41,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:41,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110374794] [2021-10-04 18:50:41,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:41,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:41,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:41,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:41,901 INFO L87 Difference]: Start difference. First operand 428 states and 979 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:42,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:42,187 INFO L93 Difference]: Finished difference Result 548 states and 1214 transitions. [2021-10-04 18:50:42,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:50:42,188 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:42,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:42,189 INFO L225 Difference]: With dead ends: 548 [2021-10-04 18:50:42,189 INFO L226 Difference]: Without dead ends: 532 [2021-10-04 18:50:42,189 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 130.6ms TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2021-10-04 18:50:42,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-10-04 18:50:42,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 434. [2021-10-04 18:50:42,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 2.2817551963048497) internal successors, (988), 433 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 988 transitions. [2021-10-04 18:50:42,195 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 988 transitions. Word has length 38 [2021-10-04 18:50:42,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:42,196 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 988 transitions. [2021-10-04 18:50:42,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 988 transitions. [2021-10-04 18:50:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:42,196 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:42,197 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:42,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2021-10-04 18:50:42,197 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-04 18:50:42,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:42,197 INFO L82 PathProgramCache]: Analyzing trace with hash -135686998, now seen corresponding path program 162 times [2021-10-04 18:50:42,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:42,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466768761] [2021-10-04 18:50:42,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:42,198 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:42,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:42,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466768761] [2021-10-04 18:50:42,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466768761] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:42,296 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:42,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:42,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853529173] [2021-10-04 18:50:42,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:42,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:42,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:42,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:42,298 INFO L87 Difference]: Start difference. First operand 434 states and 988 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:42,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:42,752 INFO L93 Difference]: Finished difference Result 782 states and 1707 transitions. [2021-10-04 18:50:42,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-04 18:50:42,753 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:42,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:42,754 INFO L225 Difference]: With dead ends: 782 [2021-10-04 18:50:42,754 INFO L226 Difference]: Without dead ends: 750 [2021-10-04 18:50:42,754 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 202.2ms TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2021-10-04 18:50:42,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2021-10-04 18:50:42,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 426. [2021-10-04 18:50:42,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 2.2776470588235296) internal successors, (968), 425 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:42,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 968 transitions. [2021-10-04 18:50:42,761 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 968 transitions. Word has length 38 [2021-10-04 18:50:42,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:42,761 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 968 transitions. [2021-10-04 18:50:42,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:42,761 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 968 transitions. [2021-10-04 18:50:42,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:42,762 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:42,762 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:42,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2021-10-04 18:50:42,762 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-04 18:50:42,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:42,762 INFO L82 PathProgramCache]: Analyzing trace with hash -665950444, now seen corresponding path program 163 times [2021-10-04 18:50:42,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:42,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147951960] [2021-10-04 18:50:42,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:42,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:42,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:42,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:42,879 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147951960] [2021-10-04 18:50:42,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147951960] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:42,879 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:42,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:42,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291255758] [2021-10-04 18:50:42,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:42,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:42,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:42,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:42,881 INFO L87 Difference]: Start difference. First operand 426 states and 968 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-04 18:50:43,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:43,341 INFO L93 Difference]: Finished difference Result 678 states and 1514 transitions. [2021-10-04 18:50:43,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-04 18:50:43,341 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-04 18:50:43,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:43,343 INFO L225 Difference]: With dead ends: 678 [2021-10-04 18:50:43,343 INFO L226 Difference]: Without dead ends: 656 [2021-10-04 18:50:43,343 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 244.0ms TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2021-10-04 18:50:43,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2021-10-04 18:50:43,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 430. [2021-10-04 18:50:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 2.275058275058275) internal successors, (976), 429 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 976 transitions. [2021-10-04 18:50:43,350 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 976 transitions. Word has length 38 [2021-10-04 18:50:43,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:43,350 INFO L470 AbstractCegarLoop]: Abstraction has 430 states and 976 transitions. [2021-10-04 18:50:43,350 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-04 18:50:43,350 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 976 transitions. [2021-10-04 18:50:43,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:43,351 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:43,351 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:43,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2021-10-04 18:50:43,351 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-04 18:50:43,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:43,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1788365890, now seen corresponding path program 164 times [2021-10-04 18:50:43,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:43,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305344099] [2021-10-04 18:50:43,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:43,353 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:43,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:43,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:43,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305344099] [2021-10-04 18:50:43,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305344099] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:43,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:43,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:43,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104371692] [2021-10-04 18:50:43,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:43,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:43,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:43,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:43,453 INFO L87 Difference]: Start difference. First operand 430 states and 976 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:43,851 INFO L93 Difference]: Finished difference Result 728 states and 1610 transitions. [2021-10-04 18:50:43,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-04 18:50:43,852 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:43,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:43,853 INFO L225 Difference]: With dead ends: 728 [2021-10-04 18:50:43,853 INFO L226 Difference]: Without dead ends: 700 [2021-10-04 18:50:43,853 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 159.4ms TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:50:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2021-10-04 18:50:43,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 420. [2021-10-04 18:50:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 2.2840095465393793) internal successors, (957), 419 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 957 transitions. [2021-10-04 18:50:43,860 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 957 transitions. Word has length 38 [2021-10-04 18:50:43,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:43,860 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 957 transitions. [2021-10-04 18:50:43,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 957 transitions. [2021-10-04 18:50:43,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:43,861 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:43,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-04 18:50:43,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2021-10-04 18:50:43,861 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-04 18:50:43,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:43,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1604510092, now seen corresponding path program 165 times [2021-10-04 18:50:43,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:43,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326882186] [2021-10-04 18:50:43,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:43,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:43,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-04 18:50:43,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:43,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326882186] [2021-10-04 18:50:43,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326882186] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:43,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:43,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:43,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640178070] [2021-10-04 18:50:43,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:43,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:43,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:43,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:43,965 INFO L87 Difference]: Start difference. First operand 420 states and 957 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-04 18:50:44,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:44,265 INFO L93 Difference]: Finished difference Result 458 states and 1024 transitions. [2021-10-04 18:50:44,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:50:44,265 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-04 18:50:44,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:44,266 INFO L225 Difference]: With dead ends: 458 [2021-10-04 18:50:44,266 INFO L226 Difference]: Without dead ends: 436 [2021-10-04 18:50:44,266 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 146.0ms TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:50:44,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-10-04 18:50:44,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 420. [2021-10-04 18:50:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 2.279236276849642) internal successors, (955), 419 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 955 transitions. [2021-10-04 18:50:44,271 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 955 transitions. Word has length 38 [2021-10-04 18:50:44,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:44,272 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 955 transitions. [2021-10-04 18:50:44,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:44,272 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 955 transitions. [2021-10-04 18:50:44,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:44,272 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:44,272 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:44,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2021-10-04 18:50:44,273 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-04 18:50:44,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:44,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1926274346, now seen corresponding path program 166 times [2021-10-04 18:50:44,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:44,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523319080] [2021-10-04 18:50:44,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:44,274 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:44,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:44,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:44,383 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523319080] [2021-10-04 18:50:44,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523319080] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:44,383 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:44,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:44,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101398884] [2021-10-04 18:50:44,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:44,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:44,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:44,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:44,384 INFO L87 Difference]: Start difference. First operand 420 states and 955 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-04 18:50:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:44,688 INFO L93 Difference]: Finished difference Result 478 states and 1062 transitions. [2021-10-04 18:50:44,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:50:44,689 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-04 18:50:44,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:44,690 INFO L225 Difference]: With dead ends: 478 [2021-10-04 18:50:44,690 INFO L226 Difference]: Without dead ends: 458 [2021-10-04 18:50:44,690 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 155.4ms TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:50:44,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-10-04 18:50:44,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 420. [2021-10-04 18:50:44,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 2.2649164677804294) internal successors, (949), 419 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 949 transitions. [2021-10-04 18:50:44,697 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 949 transitions. Word has length 38 [2021-10-04 18:50:44,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:44,698 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 949 transitions. [2021-10-04 18:50:44,698 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-04 18:50:44,698 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 949 transitions. [2021-10-04 18:50:44,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:44,699 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:44,699 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:44,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2021-10-04 18:50:44,700 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-04 18:50:44,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:44,700 INFO L82 PathProgramCache]: Analyzing trace with hash 71846806, now seen corresponding path program 167 times [2021-10-04 18:50:44,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:44,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766438312] [2021-10-04 18:50:44,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:44,701 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:44,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:44,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:44,806 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766438312] [2021-10-04 18:50:44,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766438312] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:44,807 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:44,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:44,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691188198] [2021-10-04 18:50:44,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:44,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:44,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:44,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:44,809 INFO L87 Difference]: Start difference. First operand 420 states and 949 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-04 18:50:45,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:45,281 INFO L93 Difference]: Finished difference Result 706 states and 1548 transitions. [2021-10-04 18:50:45,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-04 18:50:45,296 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-04 18:50:45,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:45,298 INFO L225 Difference]: With dead ends: 706 [2021-10-04 18:50:45,298 INFO L226 Difference]: Without dead ends: 664 [2021-10-04 18:50:45,298 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 241.4ms TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2021-10-04 18:50:45,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2021-10-04 18:50:45,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 412. [2021-10-04 18:50:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.2603406326034063) internal successors, (929), 411 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:45,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 929 transitions. [2021-10-04 18:50:45,307 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 929 transitions. Word has length 38 [2021-10-04 18:50:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:45,307 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 929 transitions. [2021-10-04 18:50:45,307 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-04 18:50:45,308 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 929 transitions. [2021-10-04 18:50:45,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:45,308 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:45,309 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:45,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2021-10-04 18:50:45,309 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-04 18:50:45,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:45,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1632372254, now seen corresponding path program 168 times [2021-10-04 18:50:45,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:45,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082367124] [2021-10-04 18:50:45,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:45,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:45,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:45,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:45,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082367124] [2021-10-04 18:50:45,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082367124] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:45,440 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:45,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:45,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155876456] [2021-10-04 18:50:45,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:45,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:45,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:45,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:45,441 INFO L87 Difference]: Start difference. First operand 412 states and 929 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-04 18:50:45,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:45,705 INFO L93 Difference]: Finished difference Result 428 states and 953 transitions. [2021-10-04 18:50:45,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:50:45,706 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-04 18:50:45,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:45,707 INFO L225 Difference]: With dead ends: 428 [2021-10-04 18:50:45,707 INFO L226 Difference]: Without dead ends: 410 [2021-10-04 18:50:45,707 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 175.2ms TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:50:45,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-10-04 18:50:45,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2021-10-04 18:50:45,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 2.259168704156479) internal successors, (924), 409 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:45,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 924 transitions. [2021-10-04 18:50:45,716 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 924 transitions. Word has length 38 [2021-10-04 18:50:45,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:45,717 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 924 transitions. [2021-10-04 18:50:45,717 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-04 18:50:45,717 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 924 transitions. [2021-10-04 18:50:45,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:45,718 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:45,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-04 18:50:45,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2021-10-04 18:50:45,718 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-04 18:50:45,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:45,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1344038438, now seen corresponding path program 169 times [2021-10-04 18:50:45,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:45,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471427565] [2021-10-04 18:50:45,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:45,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:45,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-04 18:50:45,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:45,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471427565] [2021-10-04 18:50:45,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471427565] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:45,846 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:45,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:45,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466019029] [2021-10-04 18:50:45,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:45,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:45,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:45,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:45,848 INFO L87 Difference]: Start difference. First operand 410 states and 924 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-04 18:50:46,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:46,221 INFO L93 Difference]: Finished difference Result 486 states and 1071 transitions. [2021-10-04 18:50:46,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:50:46,222 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-04 18:50:46,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:46,223 INFO L225 Difference]: With dead ends: 486 [2021-10-04 18:50:46,223 INFO L226 Difference]: Without dead ends: 470 [2021-10-04 18:50:46,223 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 192.5ms TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:50:46,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-10-04 18:50:46,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 416. [2021-10-04 18:50:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.2481927710843372) internal successors, (933), 415 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 933 transitions. [2021-10-04 18:50:46,228 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 933 transitions. Word has length 38 [2021-10-04 18:50:46,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:46,228 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 933 transitions. [2021-10-04 18:50:46,228 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-04 18:50:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 933 transitions. [2021-10-04 18:50:46,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:46,229 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:46,229 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:46,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2021-10-04 18:50:46,229 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-04 18:50:46,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:46,229 INFO L82 PathProgramCache]: Analyzing trace with hash -411431488, now seen corresponding path program 170 times [2021-10-04 18:50:46,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:46,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610325471] [2021-10-04 18:50:46,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:46,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:46,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:46,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610325471] [2021-10-04 18:50:46,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610325471] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:46,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:46,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:46,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375261267] [2021-10-04 18:50:46,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:46,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:46,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:46,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:46,338 INFO L87 Difference]: Start difference. First operand 416 states and 933 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-04 18:50:46,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:46,842 INFO L93 Difference]: Finished difference Result 706 states and 1533 transitions. [2021-10-04 18:50:46,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-04 18:50:46,843 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-04 18:50:46,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:46,844 INFO L225 Difference]: With dead ends: 706 [2021-10-04 18:50:46,844 INFO L226 Difference]: Without dead ends: 674 [2021-10-04 18:50:46,845 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 224.7ms TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2021-10-04 18:50:46,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2021-10-04 18:50:46,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 408. [2021-10-04 18:50:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 2.253071253071253) internal successors, (917), 407 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 917 transitions. [2021-10-04 18:50:46,851 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 917 transitions. Word has length 38 [2021-10-04 18:50:46,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:46,851 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 917 transitions. [2021-10-04 18:50:46,851 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-04 18:50:46,851 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 917 transitions. [2021-10-04 18:50:46,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:46,852 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:46,852 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:46,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2021-10-04 18:50:46,852 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-04 18:50:46,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:46,852 INFO L82 PathProgramCache]: Analyzing trace with hash 785719838, now seen corresponding path program 171 times [2021-10-04 18:50:46,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:46,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054204714] [2021-10-04 18:50:46,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:46,853 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:46,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:46,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054204714] [2021-10-04 18:50:46,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054204714] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:46,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:46,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:46,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603430528] [2021-10-04 18:50:46,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:46,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:46,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:46,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:46,949 INFO L87 Difference]: Start difference. First operand 408 states and 917 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:47,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:47,212 INFO L93 Difference]: Finished difference Result 470 states and 1035 transitions. [2021-10-04 18:50:47,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:50:47,212 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:47,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:47,213 INFO L225 Difference]: With dead ends: 470 [2021-10-04 18:50:47,213 INFO L226 Difference]: Without dead ends: 448 [2021-10-04 18:50:47,213 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 112.4ms TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2021-10-04 18:50:47,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-10-04 18:50:47,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 396. [2021-10-04 18:50:47,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 2.250632911392405) internal successors, (889), 395 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 889 transitions. [2021-10-04 18:50:47,218 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 889 transitions. Word has length 38 [2021-10-04 18:50:47,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:47,218 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 889 transitions. [2021-10-04 18:50:47,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:47,219 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 889 transitions. [2021-10-04 18:50:47,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:47,219 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:47,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-04 18:50:47,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2021-10-04 18:50:47,220 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-04 18:50:47,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:47,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1138440244, now seen corresponding path program 172 times [2021-10-04 18:50:47,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:47,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18742372] [2021-10-04 18:50:47,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:47,221 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:47,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:47,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18742372] [2021-10-04 18:50:47,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18742372] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:47,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:47,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:47,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144304953] [2021-10-04 18:50:47,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:47,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:47,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:47,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:47,337 INFO L87 Difference]: Start difference. First operand 396 states and 889 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:47,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:47,724 INFO L93 Difference]: Finished difference Result 610 states and 1366 transitions. [2021-10-04 18:50:47,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:50:47,725 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:47,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:47,726 INFO L225 Difference]: With dead ends: 610 [2021-10-04 18:50:47,726 INFO L226 Difference]: Without dead ends: 588 [2021-10-04 18:50:47,726 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 179.6ms TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2021-10-04 18:50:47,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2021-10-04 18:50:47,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 402. [2021-10-04 18:50:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 2.2693266832917707) internal successors, (910), 401 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 910 transitions. [2021-10-04 18:50:47,732 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 910 transitions. Word has length 38 [2021-10-04 18:50:47,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:47,732 INFO L470 AbstractCegarLoop]: Abstraction has 402 states and 910 transitions. [2021-10-04 18:50:47,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 910 transitions. [2021-10-04 18:50:47,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:47,733 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:47,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-04 18:50:47,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2021-10-04 18:50:47,733 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-04 18:50:47,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:47,733 INFO L82 PathProgramCache]: Analyzing trace with hash 16024798, now seen corresponding path program 173 times [2021-10-04 18:50:47,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:47,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966750167] [2021-10-04 18:50:47,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:47,734 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:47,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:47,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:47,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966750167] [2021-10-04 18:50:47,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966750167] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:47,820 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:47,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:47,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221099201] [2021-10-04 18:50:47,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:47,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:47,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:47,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:47,821 INFO L87 Difference]: Start difference. First operand 402 states and 910 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:48,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:48,215 INFO L93 Difference]: Finished difference Result 626 states and 1393 transitions. [2021-10-04 18:50:48,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:50:48,216 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:48,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:48,217 INFO L225 Difference]: With dead ends: 626 [2021-10-04 18:50:48,217 INFO L226 Difference]: Without dead ends: 610 [2021-10-04 18:50:48,218 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 175.0ms TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2021-10-04 18:50:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2021-10-04 18:50:48,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 398. [2021-10-04 18:50:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 2.2670025188916876) internal successors, (900), 397 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 900 transitions. [2021-10-04 18:50:48,223 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 900 transitions. Word has length 38 [2021-10-04 18:50:48,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:48,223 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 900 transitions. [2021-10-04 18:50:48,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:48,224 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 900 transitions. [2021-10-04 18:50:48,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:48,224 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:48,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-04 18:50:48,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2021-10-04 18:50:48,224 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-04 18:50:48,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:48,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1997626146, now seen corresponding path program 174 times [2021-10-04 18:50:48,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:48,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433841796] [2021-10-04 18:50:48,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:48,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:48,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-04 18:50:48,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:48,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433841796] [2021-10-04 18:50:48,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433841796] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:48,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:48,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:50:48,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531802239] [2021-10-04 18:50:48,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:50:48,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:48,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:50:48,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:50:48,314 INFO L87 Difference]: Start difference. First operand 398 states and 900 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-04 18:50:48,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:48,598 INFO L93 Difference]: Finished difference Result 534 states and 1178 transitions. [2021-10-04 18:50:48,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:50:48,599 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-04 18:50:48,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:48,600 INFO L225 Difference]: With dead ends: 534 [2021-10-04 18:50:48,600 INFO L226 Difference]: Without dead ends: 514 [2021-10-04 18:50:48,600 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 125.2ms TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:50:48,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-10-04 18:50:48,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 398. [2021-10-04 18:50:48,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 2.256926952141058) internal successors, (896), 397 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 896 transitions. [2021-10-04 18:50:48,605 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 896 transitions. Word has length 38 [2021-10-04 18:50:48,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:48,606 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 896 transitions. [2021-10-04 18:50:48,606 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-04 18:50:48,606 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 896 transitions. [2021-10-04 18:50:48,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:48,606 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:48,607 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:48,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2021-10-04 18:50:48,607 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-04 18:50:48,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:48,607 INFO L82 PathProgramCache]: Analyzing trace with hash 2122586868, now seen corresponding path program 175 times [2021-10-04 18:50:48,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:48,607 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20334324] [2021-10-04 18:50:48,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:48,608 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:48,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-04 18:50:48,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:48,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20334324] [2021-10-04 18:50:48,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20334324] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:48,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:48,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:50:48,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472889967] [2021-10-04 18:50:48,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:50:48,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:48,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:50:48,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:50:48,693 INFO L87 Difference]: Start difference. First operand 398 states and 896 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-04 18:50:49,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:49,000 INFO L93 Difference]: Finished difference Result 546 states and 1192 transitions. [2021-10-04 18:50:49,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:50:49,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-04 18:50:49,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:49,001 INFO L225 Difference]: With dead ends: 546 [2021-10-04 18:50:49,001 INFO L226 Difference]: Without dead ends: 514 [2021-10-04 18:50:49,002 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 133.4ms TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:50:49,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-10-04 18:50:49,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 370. [2021-10-04 18:50:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 2.2710027100271004) internal successors, (838), 369 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:49,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 838 transitions. [2021-10-04 18:50:49,007 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 838 transitions. Word has length 38 [2021-10-04 18:50:49,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:49,007 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 838 transitions. [2021-10-04 18:50:49,007 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-04 18:50:49,007 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 838 transitions. [2021-10-04 18:50:49,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:49,008 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:49,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-04 18:50:49,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2021-10-04 18:50:49,008 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-04 18:50:49,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:49,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1215853216, now seen corresponding path program 176 times [2021-10-04 18:50:49,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:49,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906701084] [2021-10-04 18:50:49,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:49,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:49,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-04 18:50:49,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:49,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906701084] [2021-10-04 18:50:49,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906701084] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:49,136 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:49,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:49,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985005466] [2021-10-04 18:50:49,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:49,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:49,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:49,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:49,138 INFO L87 Difference]: Start difference. First operand 370 states and 838 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-04 18:50:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:49,455 INFO L93 Difference]: Finished difference Result 400 states and 885 transitions. [2021-10-04 18:50:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:50:49,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-04 18:50:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:49,457 INFO L225 Difference]: With dead ends: 400 [2021-10-04 18:50:49,457 INFO L226 Difference]: Without dead ends: 372 [2021-10-04 18:50:49,457 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 201.8ms TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:50:49,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-10-04 18:50:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 370. [2021-10-04 18:50:49,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 2.254742547425474) internal successors, (832), 369 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 832 transitions. [2021-10-04 18:50:49,462 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 832 transitions. Word has length 38 [2021-10-04 18:50:49,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:49,462 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 832 transitions. [2021-10-04 18:50:49,462 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-04 18:50:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 832 transitions. [2021-10-04 18:50:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:49,463 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:49,463 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:49,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2021-10-04 18:50:49,463 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-04 18:50:49,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:49,463 INFO L82 PathProgramCache]: Analyzing trace with hash -530904308, now seen corresponding path program 177 times [2021-10-04 18:50:49,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:49,464 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17170602] [2021-10-04 18:50:49,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:49,464 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:49,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:49,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:49,566 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17170602] [2021-10-04 18:50:49,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17170602] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:49,566 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:49,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:49,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762930565] [2021-10-04 18:50:49,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:49,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:49,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:49,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:49,568 INFO L87 Difference]: Start difference. First operand 370 states and 832 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-04 18:50:50,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:50,031 INFO L93 Difference]: Finished difference Result 488 states and 1056 transitions. [2021-10-04 18:50:50,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-04 18:50:50,031 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-04 18:50:50,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:50,033 INFO L225 Difference]: With dead ends: 488 [2021-10-04 18:50:50,033 INFO L226 Difference]: Without dead ends: 458 [2021-10-04 18:50:50,033 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 256.1ms TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2021-10-04 18:50:50,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-10-04 18:50:50,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 378. [2021-10-04 18:50:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 2.2387267904509285) internal successors, (844), 377 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 844 transitions. [2021-10-04 18:50:50,038 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 844 transitions. Word has length 38 [2021-10-04 18:50:50,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:50,038 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 844 transitions. [2021-10-04 18:50:50,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 844 transitions. [2021-10-04 18:50:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:50,039 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:50,039 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:50,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2021-10-04 18:50:50,039 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-04 18:50:50,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:50,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1123928840, now seen corresponding path program 178 times [2021-10-04 18:50:50,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:50,040 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116614044] [2021-10-04 18:50:50,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:50,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:50,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:50,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:50,125 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116614044] [2021-10-04 18:50:50,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116614044] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:50,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:50,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:50,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244654022] [2021-10-04 18:50:50,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:50,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:50,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:50,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:50,127 INFO L87 Difference]: Start difference. First operand 378 states and 844 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:50,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:50,513 INFO L93 Difference]: Finished difference Result 540 states and 1166 transitions. [2021-10-04 18:50:50,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-04 18:50:50,514 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:50,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:50,515 INFO L225 Difference]: With dead ends: 540 [2021-10-04 18:50:50,515 INFO L226 Difference]: Without dead ends: 492 [2021-10-04 18:50:50,515 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 183.6ms TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2021-10-04 18:50:50,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-10-04 18:50:50,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 364. [2021-10-04 18:50:50,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 2.2506887052341598) internal successors, (817), 363 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-04 18:50:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 817 transitions. [2021-10-04 18:50:50,520 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 817 transitions. Word has length 38 [2021-10-04 18:50:50,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:50,521 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 817 transitions. [2021-10-04 18:50:50,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 817 transitions. [2021-10-04 18:50:50,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:50,522 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:50,522 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:50,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2021-10-04 18:50:50,522 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-04 18:50:50,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:50,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1991501878, now seen corresponding path program 179 times [2021-10-04 18:50:50,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:50,523 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162535917] [2021-10-04 18:50:50,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:50,523 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:50,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:50,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:50,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162535917] [2021-10-04 18:50:50,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162535917] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:50,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:50,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:50,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680648996] [2021-10-04 18:50:50,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:50,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:50,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:50,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:50,651 INFO L87 Difference]: Start difference. First operand 364 states and 817 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-04 18:50:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:50,900 INFO L93 Difference]: Finished difference Result 402 states and 874 transitions. [2021-10-04 18:50:50,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:50:50,901 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-04 18:50:50,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:50,902 INFO L225 Difference]: With dead ends: 402 [2021-10-04 18:50:50,902 INFO L226 Difference]: Without dead ends: 378 [2021-10-04 18:50:50,903 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 158.5ms TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:50:50,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-10-04 18:50:50,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 358. [2021-10-04 18:50:50,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 2.246498599439776) internal successors, (802), 357 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:50,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 802 transitions. [2021-10-04 18:50:50,907 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 802 transitions. Word has length 38 [2021-10-04 18:50:50,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:50,907 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 802 transitions. [2021-10-04 18:50:50,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-04 18:50:50,908 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 802 transitions. [2021-10-04 18:50:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:50,908 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:50,908 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:50,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2021-10-04 18:50:50,908 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-04 18:50:50,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:50,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1057727862, now seen corresponding path program 180 times [2021-10-04 18:50:50,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:50,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621505687] [2021-10-04 18:50:50,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:50,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:51,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:51,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:51,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621505687] [2021-10-04 18:50:51,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621505687] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:51,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:51,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:51,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003775272] [2021-10-04 18:50:51,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:51,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:51,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:51,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:51,002 INFO L87 Difference]: Start difference. First operand 358 states and 802 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-04 18:50:51,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:51,400 INFO L93 Difference]: Finished difference Result 462 states and 993 transitions. [2021-10-04 18:50:51,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:50:51,401 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-04 18:50:51,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:51,402 INFO L225 Difference]: With dead ends: 462 [2021-10-04 18:50:51,402 INFO L226 Difference]: Without dead ends: 436 [2021-10-04 18:50:51,402 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 189.5ms TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:50:51,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-10-04 18:50:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 366. [2021-10-04 18:50:51,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 2.23013698630137) internal successors, (814), 365 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:51,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 814 transitions. [2021-10-04 18:50:51,407 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 814 transitions. Word has length 38 [2021-10-04 18:50:51,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:51,407 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 814 transitions. [2021-10-04 18:50:51,407 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-04 18:50:51,407 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 814 transitions. [2021-10-04 18:50:51,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:51,408 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:51,408 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:51,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2021-10-04 18:50:51,408 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-04 18:50:51,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:51,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1039509986, now seen corresponding path program 181 times [2021-10-04 18:50:51,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:51,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348272644] [2021-10-04 18:50:51,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:51,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:51,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:51,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:51,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348272644] [2021-10-04 18:50:51,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348272644] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:51,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:51,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:51,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849715782] [2021-10-04 18:50:51,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:51,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:51,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:51,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:51,502 INFO L87 Difference]: Start difference. First operand 366 states and 814 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:51,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:51,868 INFO L93 Difference]: Finished difference Result 446 states and 963 transitions. [2021-10-04 18:50:51,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-04 18:50:51,868 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:51,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:51,869 INFO L225 Difference]: With dead ends: 446 [2021-10-04 18:50:51,869 INFO L226 Difference]: Without dead ends: 408 [2021-10-04 18:50:51,870 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 193.3ms TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:50:51,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-10-04 18:50:51,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 352. [2021-10-04 18:50:51,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 2.242165242165242) internal successors, (787), 351 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 787 transitions. [2021-10-04 18:50:51,874 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 787 transitions. Word has length 38 [2021-10-04 18:50:51,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:51,874 INFO L470 AbstractCegarLoop]: Abstraction has 352 states and 787 transitions. [2021-10-04 18:50:51,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:51,874 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 787 transitions. [2021-10-04 18:50:51,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:51,875 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50: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-04 18:50:51,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2021-10-04 18:50:51,875 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-04 18:50:51,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:51,876 INFO L82 PathProgramCache]: Analyzing trace with hash -494062880, now seen corresponding path program 182 times [2021-10-04 18:50:51,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:51,876 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554899790] [2021-10-04 18:50:51,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:51,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:51,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:51,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554899790] [2021-10-04 18:50:51,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554899790] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:51,976 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:51,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:51,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286837227] [2021-10-04 18:50:51,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:51,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:51,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:51,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:51,977 INFO L87 Difference]: Start difference. First operand 352 states and 787 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-04 18:50:52,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:52,420 INFO L93 Difference]: Finished difference Result 562 states and 1245 transitions. [2021-10-04 18:50:52,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-04 18:50:52,420 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-04 18:50:52,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:52,422 INFO L225 Difference]: With dead ends: 562 [2021-10-04 18:50:52,422 INFO L226 Difference]: Without dead ends: 540 [2021-10-04 18:50:52,422 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 242.6ms TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2021-10-04 18:50:52,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-10-04 18:50:52,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 372. [2021-10-04 18:50:52,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 2.234501347708895) internal successors, (829), 371 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 829 transitions. [2021-10-04 18:50:52,427 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 829 transitions. Word has length 38 [2021-10-04 18:50:52,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:52,428 INFO L470 AbstractCegarLoop]: Abstraction has 372 states and 829 transitions. [2021-10-04 18:50:52,428 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-04 18:50:52,428 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 829 transitions. [2021-10-04 18:50:52,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:52,428 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:52,429 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:52,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2021-10-04 18:50:52,429 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-04 18:50:52,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:52,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1087087412, now seen corresponding path program 183 times [2021-10-04 18:50:52,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:52,429 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530041816] [2021-10-04 18:50:52,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:52,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:52,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:52,524 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530041816] [2021-10-04 18:50:52,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530041816] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:52,524 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:52,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:52,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489870689] [2021-10-04 18:50:52,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:52,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:52,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:52,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:52,526 INFO L87 Difference]: Start difference. First operand 372 states and 829 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:52,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:52,931 INFO L93 Difference]: Finished difference Result 628 states and 1370 transitions. [2021-10-04 18:50:52,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-04 18:50:52,932 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:52,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:52,933 INFO L225 Difference]: With dead ends: 628 [2021-10-04 18:50:52,933 INFO L226 Difference]: Without dead ends: 578 [2021-10-04 18:50:52,934 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 216.0ms TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2021-10-04 18:50:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2021-10-04 18:50:52,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 358. [2021-10-04 18:50:52,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 2.2408963585434174) internal successors, (800), 357 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 800 transitions. [2021-10-04 18:50:52,938 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 800 transitions. Word has length 38 [2021-10-04 18:50:52,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:52,939 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 800 transitions. [2021-10-04 18:50:52,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 800 transitions. [2021-10-04 18:50:52,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:52,939 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:52,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-04 18:50:52,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2021-10-04 18:50:52,940 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-04 18:50:52,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:52,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1552147830, now seen corresponding path program 184 times [2021-10-04 18:50:52,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:52,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215835971] [2021-10-04 18:50:52,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:52,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:53,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:53,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:53,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215835971] [2021-10-04 18:50:53,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215835971] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:53,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:53,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:53,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152099849] [2021-10-04 18:50:53,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:53,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:53,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:53,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:53,058 INFO L87 Difference]: Start difference. First operand 358 states and 800 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-04 18:50:53,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:53,415 INFO L93 Difference]: Finished difference Result 432 states and 942 transitions. [2021-10-04 18:50:53,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:50:53,415 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-04 18:50:53,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:53,416 INFO L225 Difference]: With dead ends: 432 [2021-10-04 18:50:53,416 INFO L226 Difference]: Without dead ends: 414 [2021-10-04 18:50:53,417 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 198.5ms TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:50:53,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-10-04 18:50:53,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 360. [2021-10-04 18:50:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 2.2367688022284122) internal successors, (803), 359 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 803 transitions. [2021-10-04 18:50:53,421 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 803 transitions. Word has length 38 [2021-10-04 18:50:53,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:53,421 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 803 transitions. [2021-10-04 18:50:53,421 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-04 18:50:53,422 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 803 transitions. [2021-10-04 18:50:53,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:53,422 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:53,422 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:53,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2021-10-04 18:50:53,422 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-04 18:50:53,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:53,423 INFO L82 PathProgramCache]: Analyzing trace with hash 478930592, now seen corresponding path program 185 times [2021-10-04 18:50:53,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:53,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208331841] [2021-10-04 18:50:53,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:53,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:53,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:53,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208331841] [2021-10-04 18:50:53,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208331841] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:53,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:53,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:53,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294520374] [2021-10-04 18:50:53,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:53,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:53,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:53,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:53,549 INFO L87 Difference]: Start difference. First operand 360 states and 803 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-04 18:50:53,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:53,932 INFO L93 Difference]: Finished difference Result 470 states and 1025 transitions. [2021-10-04 18:50:53,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:50:53,932 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-04 18:50:53,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:53,933 INFO L225 Difference]: With dead ends: 470 [2021-10-04 18:50:53,933 INFO L226 Difference]: Without dead ends: 454 [2021-10-04 18:50:53,934 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 209.6ms TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:50:53,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-10-04 18:50:53,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 366. [2021-10-04 18:50:53,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 2.2246575342465755) internal successors, (812), 365 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 812 transitions. [2021-10-04 18:50:53,938 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 812 transitions. Word has length 38 [2021-10-04 18:50:53,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:53,938 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 812 transitions. [2021-10-04 18:50:53,939 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-04 18:50:53,939 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 812 transitions. [2021-10-04 18:50:53,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:53,939 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:53,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-04 18:50:53,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2021-10-04 18:50:53,940 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-04 18:50:53,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:53,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1570365706, now seen corresponding path program 186 times [2021-10-04 18:50:53,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:53,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145369006] [2021-10-04 18:50:53,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:53,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:54,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:54,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145369006] [2021-10-04 18:50:54,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145369006] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:54,051 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:54,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:54,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783935356] [2021-10-04 18:50:54,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:54,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:54,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:54,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:54,053 INFO L87 Difference]: Start difference. First operand 366 states and 812 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-04 18:50:54,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:54,428 INFO L93 Difference]: Finished difference Result 438 states and 959 transitions. [2021-10-04 18:50:54,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:50:54,429 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:54,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:54,429 INFO L225 Difference]: With dead ends: 438 [2021-10-04 18:50:54,429 INFO L226 Difference]: Without dead ends: 428 [2021-10-04 18:50:54,430 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 200.9ms TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:50:54,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-10-04 18:50:54,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 368. [2021-10-04 18:50:54,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 2.220708446866485) internal successors, (815), 367 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 815 transitions. [2021-10-04 18:50:54,434 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 815 transitions. Word has length 38 [2021-10-04 18:50:54,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:54,434 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 815 transitions. [2021-10-04 18:50:54,434 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-04 18:50:54,434 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 815 transitions. [2021-10-04 18:50:54,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:54,435 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:54,435 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:54,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2021-10-04 18:50:54,436 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-04 18:50:54,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:54,436 INFO L82 PathProgramCache]: Analyzing trace with hash 477425842, now seen corresponding path program 187 times [2021-10-04 18:50:54,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:54,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085554630] [2021-10-04 18:50:54,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:54,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:54,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:54,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:54,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085554630] [2021-10-04 18:50:54,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085554630] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:54,560 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:54,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:54,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396586390] [2021-10-04 18:50:54,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:54,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:54,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:54,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:54,561 INFO L87 Difference]: Start difference. First operand 368 states and 815 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-04 18:50:54,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:54,951 INFO L93 Difference]: Finished difference Result 560 states and 1224 transitions. [2021-10-04 18:50:54,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:50:54,952 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-04 18:50:54,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:54,953 INFO L225 Difference]: With dead ends: 560 [2021-10-04 18:50:54,953 INFO L226 Difference]: Without dead ends: 538 [2021-10-04 18:50:54,953 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 209.1ms TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:50:54,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-10-04 18:50:54,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 358. [2021-10-04 18:50:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 2.235294117647059) internal successors, (798), 357 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:54,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 798 transitions. [2021-10-04 18:50:54,958 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 798 transitions. Word has length 38 [2021-10-04 18:50:54,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:54,958 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 798 transitions. [2021-10-04 18:50:54,958 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-04 18:50:54,959 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 798 transitions. [2021-10-04 18:50:54,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:54,959 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:54,959 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:54,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2021-10-04 18:50:54,959 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-04 18:50:54,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:54,960 INFO L82 PathProgramCache]: Analyzing trace with hash 605727114, now seen corresponding path program 188 times [2021-10-04 18:50:54,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:54,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870452493] [2021-10-04 18:50:54,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:54,960 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:55,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:55,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870452493] [2021-10-04 18:50:55,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870452493] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:55,043 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:55,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:50:55,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109396582] [2021-10-04 18:50:55,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:50:55,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:55,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:50:55,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:50:55,044 INFO L87 Difference]: Start difference. First operand 358 states and 798 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-04 18:50:55,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:55,345 INFO L93 Difference]: Finished difference Result 498 states and 1086 transitions. [2021-10-04 18:50:55,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:50:55,345 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-04 18:50:55,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:55,346 INFO L225 Difference]: With dead ends: 498 [2021-10-04 18:50:55,347 INFO L226 Difference]: Without dead ends: 482 [2021-10-04 18:50:55,347 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 139.5ms TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2021-10-04 18:50:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-10-04 18:50:55,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 364. [2021-10-04 18:50:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 2.2231404958677685) internal successors, (807), 363 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:55,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 807 transitions. [2021-10-04 18:50:55,351 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 807 transitions. Word has length 38 [2021-10-04 18:50:55,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:55,351 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 807 transitions. [2021-10-04 18:50:55,352 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-04 18:50:55,352 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 807 transitions. [2021-10-04 18:50:55,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:55,352 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:55,352 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:55,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2021-10-04 18:50:55,353 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-04 18:50:55,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:55,354 INFO L82 PathProgramCache]: Analyzing trace with hash -874561944, now seen corresponding path program 189 times [2021-10-04 18:50:55,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:55,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915787084] [2021-10-04 18:50:55,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:55,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:55,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-04 18:50:55,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:55,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915787084] [2021-10-04 18:50:55,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915787084] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:55,473 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:55,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:55,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044095694] [2021-10-04 18:50:55,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:55,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:55,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:55,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:55,475 INFO L87 Difference]: Start difference. First operand 364 states and 807 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-04 18:50:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:55,804 INFO L93 Difference]: Finished difference Result 484 states and 1059 transitions. [2021-10-04 18:50:55,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:50:55,805 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-04 18:50:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:55,806 INFO L225 Difference]: With dead ends: 484 [2021-10-04 18:50:55,806 INFO L226 Difference]: Without dead ends: 466 [2021-10-04 18:50:55,806 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 181.0ms TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:50:55,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-10-04 18:50:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 358. [2021-10-04 18:50:55,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 2.2184873949579833) internal successors, (792), 357 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:55,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 792 transitions. [2021-10-04 18:50:55,811 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 792 transitions. Word has length 38 [2021-10-04 18:50:55,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:55,811 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 792 transitions. [2021-10-04 18:50:55,811 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-04 18:50:55,811 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 792 transitions. [2021-10-04 18:50:55,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:55,812 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:55,812 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:55,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2021-10-04 18:50:55,812 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-04 18:50:55,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:55,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1651841568, now seen corresponding path program 190 times [2021-10-04 18:50:55,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:55,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299331366] [2021-10-04 18:50:55,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:55,813 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:55,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:55,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:55,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299331366] [2021-10-04 18:50:55,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299331366] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:55,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:55,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:55,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265935528] [2021-10-04 18:50:55,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:55,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:55,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:55,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:55,909 INFO L87 Difference]: Start difference. First operand 358 states and 792 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:56,229 INFO L93 Difference]: Finished difference Result 496 states and 1089 transitions. [2021-10-04 18:50:56,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:50:56,229 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:56,230 INFO L225 Difference]: With dead ends: 496 [2021-10-04 18:50:56,231 INFO L226 Difference]: Without dead ends: 480 [2021-10-04 18:50:56,231 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 174.0ms TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:50:56,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-10-04 18:50:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 360. [2021-10-04 18:50:56,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 2.214484679665738) internal successors, (795), 359 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 795 transitions. [2021-10-04 18:50:56,235 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 795 transitions. Word has length 38 [2021-10-04 18:50:56,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:56,236 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 795 transitions. [2021-10-04 18:50:56,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:56,236 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 795 transitions. [2021-10-04 18:50:56,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:56,236 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:56,237 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:56,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2021-10-04 18:50:56,237 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-04 18:50:56,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:56,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1520710282, now seen corresponding path program 191 times [2021-10-04 18:50:56,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:56,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506103342] [2021-10-04 18:50:56,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:56,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:56,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:56,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506103342] [2021-10-04 18:50:56,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506103342] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:56,342 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:56,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:56,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739638202] [2021-10-04 18:50:56,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:56,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:56,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:56,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:56,344 INFO L87 Difference]: Start difference. First operand 360 states and 795 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:56,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:56,650 INFO L93 Difference]: Finished difference Result 472 states and 1033 transitions. [2021-10-04 18:50:56,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:50:56,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-04 18:50:56,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:56,652 INFO L225 Difference]: With dead ends: 472 [2021-10-04 18:50:56,652 INFO L226 Difference]: Without dead ends: 444 [2021-10-04 18:50:56,652 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 163.7ms TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:50:56,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-10-04 18:50:56,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 344. [2021-10-04 18:50:56,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 2.2303206997084546) internal successors, (765), 343 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:56,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 765 transitions. [2021-10-04 18:50:56,657 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 765 transitions. Word has length 38 [2021-10-04 18:50:56,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:56,657 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 765 transitions. [2021-10-04 18:50:56,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:56,657 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 765 transitions. [2021-10-04 18:50:56,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:56,658 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:56,658 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:56,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2021-10-04 18:50:56,659 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-04 18:50:56,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:56,659 INFO L82 PathProgramCache]: Analyzing trace with hash 936810114, now seen corresponding path program 192 times [2021-10-04 18:50:56,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:56,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389822762] [2021-10-04 18:50:56,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:56,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:56,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:56,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:56,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389822762] [2021-10-04 18:50:56,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389822762] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:56,752 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:56,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:56,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939068022] [2021-10-04 18:50:56,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:56,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:56,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:56,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:56,754 INFO L87 Difference]: Start difference. First operand 344 states and 765 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:57,026 INFO L93 Difference]: Finished difference Result 368 states and 799 transitions. [2021-10-04 18:50:57,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:50:57,026 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:57,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:57,027 INFO L225 Difference]: With dead ends: 368 [2021-10-04 18:50:57,028 INFO L226 Difference]: Without dead ends: 346 [2021-10-04 18:50:57,028 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 154.5ms TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:50:57,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-10-04 18:50:57,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2021-10-04 18:50:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 2.2128279883381925) internal successors, (759), 343 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 759 transitions. [2021-10-04 18:50:57,033 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 759 transitions. Word has length 38 [2021-10-04 18:50:57,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:57,033 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 759 transitions. [2021-10-04 18:50:57,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:57,033 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 759 transitions. [2021-10-04 18:50:57,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:57,033 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:57,034 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:57,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2021-10-04 18:50:57,034 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-04 18:50:57,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:57,034 INFO L82 PathProgramCache]: Analyzing trace with hash -573960658, now seen corresponding path program 193 times [2021-10-04 18:50:57,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:57,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11333131] [2021-10-04 18:50:57,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:57,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:57,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:57,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11333131] [2021-10-04 18:50:57,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11333131] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:57,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:57,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:57,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157184499] [2021-10-04 18:50:57,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:57,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:57,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:57,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:57,130 INFO L87 Difference]: Start difference. First operand 344 states and 759 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:57,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:57,488 INFO L93 Difference]: Finished difference Result 418 states and 893 transitions. [2021-10-04 18:50:57,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-04 18:50:57,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-04 18:50:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:57,490 INFO L225 Difference]: With dead ends: 418 [2021-10-04 18:50:57,490 INFO L226 Difference]: Without dead ends: 394 [2021-10-04 18:50:57,490 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 216.8ms TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:50:57,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-10-04 18:50:57,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 360. [2021-10-04 18:50:57,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 2.1922005571030643) internal successors, (787), 359 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:57,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 787 transitions. [2021-10-04 18:50:57,494 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 787 transitions. Word has length 38 [2021-10-04 18:50:57,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:57,494 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 787 transitions. [2021-10-04 18:50:57,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:57,494 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 787 transitions. [2021-10-04 18:50:57,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:57,495 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:57,495 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:57,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2021-10-04 18:50:57,495 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-04 18:50:57,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:57,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1908309166, now seen corresponding path program 194 times [2021-10-04 18:50:57,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:57,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491202719] [2021-10-04 18:50:57,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:57,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:57,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:57,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:57,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491202719] [2021-10-04 18:50:57,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491202719] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:57,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:57,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:50:57,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457039242] [2021-10-04 18:50:57,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:50:57,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:57,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:50:57,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:50:57,571 INFO L87 Difference]: Start difference. First operand 360 states and 787 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-04 18:50:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:57,860 INFO L93 Difference]: Finished difference Result 464 states and 993 transitions. [2021-10-04 18:50:57,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-04 18:50:57,861 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-04 18:50:57,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:57,862 INFO L225 Difference]: With dead ends: 464 [2021-10-04 18:50:57,862 INFO L226 Difference]: Without dead ends: 446 [2021-10-04 18:50:57,862 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 149.2ms TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:50:57,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2021-10-04 18:50:57,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 360. [2021-10-04 18:50:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 2.1922005571030643) internal successors, (787), 359 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:57,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 787 transitions. [2021-10-04 18:50:57,867 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 787 transitions. Word has length 38 [2021-10-04 18:50:57,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:57,868 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 787 transitions. [2021-10-04 18:50:57,868 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-04 18:50:57,868 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 787 transitions. [2021-10-04 18:50:57,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:57,868 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:57,868 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:57,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2021-10-04 18:50:57,869 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-04 18:50:57,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:57,869 INFO L82 PathProgramCache]: Analyzing trace with hash 35271900, now seen corresponding path program 195 times [2021-10-04 18:50:57,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:57,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911256901] [2021-10-04 18:50:57,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:57,869 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:57,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:57,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911256901] [2021-10-04 18:50:57,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911256901] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:57,956 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:57,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:50:57,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162817342] [2021-10-04 18:50:57,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:50:57,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:57,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:50:57,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:50:57,957 INFO L87 Difference]: Start difference. First operand 360 states and 787 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-04 18:50:58,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:58,312 INFO L93 Difference]: Finished difference Result 452 states and 966 transitions. [2021-10-04 18:50:58,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-04 18:50:58,312 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-04 18:50:58,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:58,313 INFO L225 Difference]: With dead ends: 452 [2021-10-04 18:50:58,313 INFO L226 Difference]: Without dead ends: 412 [2021-10-04 18:50:58,314 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 170.7ms TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:50:58,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2021-10-04 18:50:58,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 332. [2021-10-04 18:50:58,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 2.193353474320242) internal successors, (726), 331 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:58,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 726 transitions. [2021-10-04 18:50:58,318 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 726 transitions. Word has length 38 [2021-10-04 18:50:58,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:58,318 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 726 transitions. [2021-10-04 18:50:58,318 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-04 18:50:58,318 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 726 transitions. [2021-10-04 18:50:58,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:58,319 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:58,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-04 18:50:58,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2021-10-04 18:50:58,319 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-04 18:50:58,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:58,319 INFO L82 PathProgramCache]: Analyzing trace with hash -633369806, now seen corresponding path program 196 times [2021-10-04 18:50:58,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:58,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485477581] [2021-10-04 18:50:58,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:58,320 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:58,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:58,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:58,425 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485477581] [2021-10-04 18:50:58,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485477581] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:58,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:58,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:58,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223015828] [2021-10-04 18:50:58,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:58,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:58,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:58,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:58,427 INFO L87 Difference]: Start difference. First operand 332 states and 726 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-04 18:50:58,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:58,686 INFO L93 Difference]: Finished difference Result 354 states and 759 transitions. [2021-10-04 18:50:58,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:50:58,687 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-04 18:50:58,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:58,688 INFO L225 Difference]: With dead ends: 354 [2021-10-04 18:50:58,688 INFO L226 Difference]: Without dead ends: 330 [2021-10-04 18:50:58,688 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 152.8ms TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:50:58,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-10-04 18:50:58,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 326. [2021-10-04 18:50:58,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 2.187692307692308) internal successors, (711), 325 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 711 transitions. [2021-10-04 18:50:58,693 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 711 transitions. Word has length 38 [2021-10-04 18:50:58,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:58,693 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 711 transitions. [2021-10-04 18:50:58,693 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-04 18:50:58,693 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 711 transitions. [2021-10-04 18:50:58,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:58,693 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:58,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-04 18:50:58,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2021-10-04 18:50:58,694 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-04 18:50:58,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:58,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1879107362, now seen corresponding path program 197 times [2021-10-04 18:50:58,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:58,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911625287] [2021-10-04 18:50:58,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:58,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:58,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-04 18:50:58,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:58,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911625287] [2021-10-04 18:50:58,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911625287] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:58,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:58,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:50:58,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873797688] [2021-10-04 18:50:58,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:50:58,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:58,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:50:58,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:50:58,798 INFO L87 Difference]: Start difference. First operand 326 states and 711 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-04 18:50:59,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:59,098 INFO L93 Difference]: Finished difference Result 364 states and 778 transitions. [2021-10-04 18:50:59,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:50:59,098 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-04 18:50:59,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:59,099 INFO L225 Difference]: With dead ends: 364 [2021-10-04 18:50:59,099 INFO L226 Difference]: Without dead ends: 338 [2021-10-04 18:50:59,099 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 187.3ms TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:50:59,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-10-04 18:50:59,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 334. [2021-10-04 18:50:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 2.171171171171171) internal successors, (723), 333 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 723 transitions. [2021-10-04 18:50:59,103 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 723 transitions. Word has length 38 [2021-10-04 18:50:59,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:59,103 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 723 transitions. [2021-10-04 18:50:59,104 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-04 18:50:59,104 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 723 transitions. [2021-10-04 18:50:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:59,104 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:59,104 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:59,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197 [2021-10-04 18:50:59,105 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-04 18:50:59,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:59,105 INFO L82 PathProgramCache]: Analyzing trace with hash 695200652, now seen corresponding path program 198 times [2021-10-04 18:50:59,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:59,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717464935] [2021-10-04 18:50:59,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:59,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:59,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:59,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:59,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717464935] [2021-10-04 18:50:59,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717464935] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:59,203 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:59,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:59,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490612924] [2021-10-04 18:50:59,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:59,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:59,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:59,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:59,205 INFO L87 Difference]: Start difference. First operand 334 states and 723 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:59,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:59,483 INFO L93 Difference]: Finished difference Result 358 states and 763 transitions. [2021-10-04 18:50:59,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:50:59,483 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:59,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:59,484 INFO L225 Difference]: With dead ends: 358 [2021-10-04 18:50:59,484 INFO L226 Difference]: Without dead ends: 320 [2021-10-04 18:50:59,484 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 161.4ms TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:50:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-10-04 18:50:59,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2021-10-04 18:50:59,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 2.1818181818181817) internal successors, (696), 319 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 696 transitions. [2021-10-04 18:50:59,488 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 696 transitions. Word has length 38 [2021-10-04 18:50:59,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:59,488 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 696 transitions. [2021-10-04 18:50:59,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 696 transitions. [2021-10-04 18:50:59,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:59,489 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:59,489 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:59,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2021-10-04 18:50:59,489 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-04 18:50:59,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:59,490 INFO L82 PathProgramCache]: Analyzing trace with hash -537119230, now seen corresponding path program 199 times [2021-10-04 18:50:59,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:59,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091904845] [2021-10-04 18:50:59,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:59,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:59,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:59,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:59,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091904845] [2021-10-04 18:50:59,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091904845] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:59,587 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:59,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:50:59,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564658638] [2021-10-04 18:50:59,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:50:59,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:59,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:50:59,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:50:59,588 INFO L87 Difference]: Start difference. First operand 320 states and 696 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:59,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:50:59,908 INFO L93 Difference]: Finished difference Result 430 states and 929 transitions. [2021-10-04 18:50:59,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-04 18:50:59,909 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:50:59,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:50:59,910 INFO L225 Difference]: With dead ends: 430 [2021-10-04 18:50:59,910 INFO L226 Difference]: Without dead ends: 414 [2021-10-04 18:50:59,910 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 195.3ms TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:50:59,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-10-04 18:50:59,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 364. [2021-10-04 18:50:59,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 2.1955922865013773) internal successors, (797), 363 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:59,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 797 transitions. [2021-10-04 18:50:59,915 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 797 transitions. Word has length 38 [2021-10-04 18:50:59,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:50:59,915 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 797 transitions. [2021-10-04 18:50:59,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:50:59,915 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 797 transitions. [2021-10-04 18:50:59,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:50:59,916 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:50:59,916 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:50:59,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable199 [2021-10-04 18:50:59,916 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-04 18:50:59,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:50:59,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1945150594, now seen corresponding path program 200 times [2021-10-04 18:50:59,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:50:59,917 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711890444] [2021-10-04 18:50:59,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:50:59,917 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:50:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:50:59,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:50:59,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:50:59,983 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711890444] [2021-10-04 18:50:59,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711890444] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:50:59,983 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:50:59,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:50:59,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606789285] [2021-10-04 18:50:59,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:50:59,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:50:59,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:50:59,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:50:59,984 INFO L87 Difference]: Start difference. First operand 364 states and 797 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-04 18:51:00,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:00,257 INFO L93 Difference]: Finished difference Result 490 states and 1043 transitions. [2021-10-04 18:51:00,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:51:00,258 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-04 18:51:00,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:00,259 INFO L225 Difference]: With dead ends: 490 [2021-10-04 18:51:00,259 INFO L226 Difference]: Without dead ends: 472 [2021-10-04 18:51:00,259 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 121.9ms TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-10-04 18:51:00,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-10-04 18:51:00,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 352. [2021-10-04 18:51:00,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 2.2108262108262107) internal successors, (776), 351 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 776 transitions. [2021-10-04 18:51:00,264 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 776 transitions. Word has length 38 [2021-10-04 18:51:00,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:00,264 INFO L470 AbstractCegarLoop]: Abstraction has 352 states and 776 transitions. [2021-10-04 18:51:00,264 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-04 18:51:00,264 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 776 transitions. [2021-10-04 18:51:00,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:00,265 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:00,265 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:00,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2021-10-04 18:51:00,265 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-04 18:51:00,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:00,265 INFO L82 PathProgramCache]: Analyzing trace with hash 72113328, now seen corresponding path program 201 times [2021-10-04 18:51:00,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:00,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305932432] [2021-10-04 18:51:00,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:00,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:00,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:00,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:00,349 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305932432] [2021-10-04 18:51:00,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305932432] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:00,349 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:00,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:51:00,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183259296] [2021-10-04 18:51:00,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:51:00,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:00,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:51:00,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:51:00,351 INFO L87 Difference]: Start difference. First operand 352 states and 776 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-04 18:51:00,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:00,691 INFO L93 Difference]: Finished difference Result 464 states and 993 transitions. [2021-10-04 18:51:00,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:51:00,691 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-04 18:51:00,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:00,692 INFO L225 Difference]: With dead ends: 464 [2021-10-04 18:51:00,692 INFO L226 Difference]: Without dead ends: 436 [2021-10-04 18:51:00,693 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 162.9ms TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:51:00,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-10-04 18:51:00,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 336. [2021-10-04 18:51:00,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.1850746268656716) internal successors, (732), 335 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:00,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 732 transitions. [2021-10-04 18:51:00,697 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 732 transitions. Word has length 38 [2021-10-04 18:51:00,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:00,697 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 732 transitions. [2021-10-04 18:51:00,697 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-04 18:51:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 732 transitions. [2021-10-04 18:51:00,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:00,698 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:00,698 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:00,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2021-10-04 18:51:00,698 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-04 18:51:00,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:00,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1468361038, now seen corresponding path program 202 times [2021-10-04 18:51:00,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:00,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360324945] [2021-10-04 18:51:00,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:00,699 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:00,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-04 18:51:00,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:00,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360324945] [2021-10-04 18:51:00,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360324945] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:00,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:00,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:51:00,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313782433] [2021-10-04 18:51:00,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:51:00,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:00,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:51:00,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:51:00,811 INFO L87 Difference]: Start difference. First operand 336 states and 732 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-04 18:51:01,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:01,097 INFO L93 Difference]: Finished difference Result 384 states and 822 transitions. [2021-10-04 18:51:01,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:51:01,098 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-04 18:51:01,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:01,099 INFO L225 Difference]: With dead ends: 384 [2021-10-04 18:51:01,099 INFO L226 Difference]: Without dead ends: 366 [2021-10-04 18:51:01,099 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 179.2ms TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:51:01,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-10-04 18:51:01,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 350. [2021-10-04 18:51:01,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 2.157593123209169) internal successors, (753), 349 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-04 18:51:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 753 transitions. [2021-10-04 18:51:01,103 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 753 transitions. Word has length 38 [2021-10-04 18:51:01,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:01,103 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 753 transitions. [2021-10-04 18:51:01,103 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-04 18:51:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 753 transitions. [2021-10-04 18:51:01,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:01,104 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:01,104 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:01,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2021-10-04 18:51:01,104 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-04 18:51:01,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:01,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1105946976, now seen corresponding path program 203 times [2021-10-04 18:51:01,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:01,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431339346] [2021-10-04 18:51:01,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:01,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:01,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:01,196 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431339346] [2021-10-04 18:51:01,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431339346] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:01,197 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:01,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:51:01,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125443321] [2021-10-04 18:51:01,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:51:01,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:01,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:51:01,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:51:01,198 INFO L87 Difference]: Start difference. First operand 350 states and 753 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:01,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:01,483 INFO L93 Difference]: Finished difference Result 388 states and 816 transitions. [2021-10-04 18:51:01,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:51:01,484 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:51:01,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:01,485 INFO L225 Difference]: With dead ends: 388 [2021-10-04 18:51:01,485 INFO L226 Difference]: Without dead ends: 348 [2021-10-04 18:51:01,485 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 167.4ms TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:51:01,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-10-04 18:51:01,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 336. [2021-10-04 18:51:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.1611940298507464) internal successors, (724), 335 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 724 transitions. [2021-10-04 18:51:01,490 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 724 transitions. Word has length 38 [2021-10-04 18:51:01,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:01,490 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 724 transitions. [2021-10-04 18:51:01,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 724 transitions. [2021-10-04 18:51:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:01,491 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:01,491 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:01,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2021-10-04 18:51:01,491 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-04 18:51:01,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:01,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1728716862, now seen corresponding path program 204 times [2021-10-04 18:51:01,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:01,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349545447] [2021-10-04 18:51:01,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:01,492 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:01,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:01,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:01,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349545447] [2021-10-04 18:51:01,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349545447] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:01,575 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:01,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:51:01,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816844693] [2021-10-04 18:51:01,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:51:01,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:01,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:51:01,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:51:01,577 INFO L87 Difference]: Start difference. First operand 336 states and 724 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-04 18:51:01,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:01,817 INFO L93 Difference]: Finished difference Result 380 states and 806 transitions. [2021-10-04 18:51:01,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:51:01,818 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-04 18:51:01,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:01,819 INFO L225 Difference]: With dead ends: 380 [2021-10-04 18:51:01,819 INFO L226 Difference]: Without dead ends: 368 [2021-10-04 18:51:01,819 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 131.2ms TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2021-10-04 18:51:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-10-04 18:51:01,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 340. [2021-10-04 18:51:01,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 2.150442477876106) internal successors, (729), 339 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 729 transitions. [2021-10-04 18:51:01,823 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 729 transitions. Word has length 38 [2021-10-04 18:51:01,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:01,824 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 729 transitions. [2021-10-04 18:51:01,824 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-04 18:51:01,824 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 729 transitions. [2021-10-04 18:51:01,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:01,824 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:01,824 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:01,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2021-10-04 18:51:01,825 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-04 18:51:01,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:01,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1482680206, now seen corresponding path program 205 times [2021-10-04 18:51:01,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:01,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605310220] [2021-10-04 18:51:01,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:01,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:01,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:01,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:01,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605310220] [2021-10-04 18:51:01,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605310220] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:01,917 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:01,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:51:01,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115320971] [2021-10-04 18:51:01,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:51:01,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:01,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:51:01,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:51:01,919 INFO L87 Difference]: Start difference. First operand 340 states and 729 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:02,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:02,145 INFO L93 Difference]: Finished difference Result 352 states and 747 transitions. [2021-10-04 18:51:02,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:51:02,145 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:51:02,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:02,146 INFO L225 Difference]: With dead ends: 352 [2021-10-04 18:51:02,146 INFO L226 Difference]: Without dead ends: 308 [2021-10-04 18:51:02,147 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 143.7ms TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:51:02,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-10-04 18:51:02,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2021-10-04 18:51:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 2.1596091205211727) internal successors, (663), 307 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:02,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 663 transitions. [2021-10-04 18:51:02,151 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 663 transitions. Word has length 38 [2021-10-04 18:51:02,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:02,151 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 663 transitions. [2021-10-04 18:51:02,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:02,151 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 663 transitions. [2021-10-04 18:51:02,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:02,152 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:02,152 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:02,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable205 [2021-10-04 18:51:02,152 INFO L402 AbstractCegarLoop]: === Iteration 207 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-04 18:51:02,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:02,153 INFO L82 PathProgramCache]: Analyzing trace with hash -645828724, now seen corresponding path program 206 times [2021-10-04 18:51:02,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:02,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813385045] [2021-10-04 18:51:02,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:02,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:02,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:02,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:02,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813385045] [2021-10-04 18:51:02,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813385045] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:02,255 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:02,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:51:02,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309449694] [2021-10-04 18:51:02,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:51:02,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:02,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:51:02,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:51:02,256 INFO L87 Difference]: Start difference. First operand 308 states and 663 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-04 18:51:02,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:02,533 INFO L93 Difference]: Finished difference Result 410 states and 868 transitions. [2021-10-04 18:51:02,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:51:02,533 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-04 18:51:02,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:02,534 INFO L225 Difference]: With dead ends: 410 [2021-10-04 18:51:02,534 INFO L226 Difference]: Without dead ends: 388 [2021-10-04 18:51:02,534 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 171.4ms TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:51:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-10-04 18:51:02,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 308. [2021-10-04 18:51:02,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 2.1530944625407167) internal successors, (661), 307 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:02,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 661 transitions. [2021-10-04 18:51:02,538 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 661 transitions. Word has length 38 [2021-10-04 18:51:02,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:02,539 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 661 transitions. [2021-10-04 18:51:02,539 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-04 18:51:02,539 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 661 transitions. [2021-10-04 18:51:02,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:02,539 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:02,539 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:02,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2021-10-04 18:51:02,540 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-04 18:51:02,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:02,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1316120102, now seen corresponding path program 207 times [2021-10-04 18:51:02,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:02,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344261200] [2021-10-04 18:51:02,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:02,540 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:02,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:02,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:02,640 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344261200] [2021-10-04 18:51:02,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344261200] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:02,641 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:02,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:51:02,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650398116] [2021-10-04 18:51:02,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:51:02,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:02,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:51:02,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:51:02,642 INFO L87 Difference]: Start difference. First operand 308 states and 661 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-04 18:51:03,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:03,009 INFO L93 Difference]: Finished difference Result 410 states and 866 transitions. [2021-10-04 18:51:03,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-04 18:51:03,009 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-04 18:51:03,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:03,010 INFO L225 Difference]: With dead ends: 410 [2021-10-04 18:51:03,010 INFO L226 Difference]: Without dead ends: 390 [2021-10-04 18:51:03,011 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 193.7ms TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:51:03,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-10-04 18:51:03,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 314. [2021-10-04 18:51:03,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 2.121405750798722) internal successors, (664), 313 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:03,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 664 transitions. [2021-10-04 18:51:03,014 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 664 transitions. Word has length 38 [2021-10-04 18:51:03,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:03,015 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 664 transitions. [2021-10-04 18:51:03,015 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-04 18:51:03,015 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 664 transitions. [2021-10-04 18:51:03,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:03,015 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:03,015 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:03,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2021-10-04 18:51:03,016 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-04 18:51:03,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:03,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1238853256, now seen corresponding path program 208 times [2021-10-04 18:51:03,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:03,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131179708] [2021-10-04 18:51:03,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:03,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:03,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:03,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131179708] [2021-10-04 18:51:03,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131179708] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:03,114 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:03,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:51:03,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202005617] [2021-10-04 18:51:03,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:51:03,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:03,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:51:03,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:51:03,117 INFO L87 Difference]: Start difference. First operand 314 states and 664 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-04 18:51:03,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:03,494 INFO L93 Difference]: Finished difference Result 474 states and 988 transitions. [2021-10-04 18:51:03,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:51:03,495 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-04 18:51:03,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:03,496 INFO L225 Difference]: With dead ends: 474 [2021-10-04 18:51:03,496 INFO L226 Difference]: Without dead ends: 424 [2021-10-04 18:51:03,497 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 192.9ms TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2021-10-04 18:51:03,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2021-10-04 18:51:03,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 298. [2021-10-04 18:51:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 2.121212121212121) internal successors, (630), 297 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:03,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 630 transitions. [2021-10-04 18:51:03,501 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 630 transitions. Word has length 38 [2021-10-04 18:51:03,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:03,501 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 630 transitions. [2021-10-04 18:51:03,502 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-04 18:51:03,502 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 630 transitions. [2021-10-04 18:51:03,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:03,502 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:03,502 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:03,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2021-10-04 18:51:03,503 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-04 18:51:03,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:03,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1703913674, now seen corresponding path program 209 times [2021-10-04 18:51:03,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:03,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144808848] [2021-10-04 18:51:03,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:03,504 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:03,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:03,641 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144808848] [2021-10-04 18:51:03,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144808848] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:03,641 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:03,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:51:03,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416665866] [2021-10-04 18:51:03,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:51:03,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:03,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:51:03,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:51:03,643 INFO L87 Difference]: Start difference. First operand 298 states and 630 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-04 18:51:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:03,920 INFO L93 Difference]: Finished difference Result 332 states and 681 transitions. [2021-10-04 18:51:03,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:51:03,921 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-04 18:51:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:03,922 INFO L225 Difference]: With dead ends: 332 [2021-10-04 18:51:03,922 INFO L226 Difference]: Without dead ends: 314 [2021-10-04 18:51:03,922 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 164.3ms TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:51:03,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-10-04 18:51:03,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 296. [2021-10-04 18:51:03,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 2.1186440677966103) internal successors, (625), 295 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 625 transitions. [2021-10-04 18:51:03,926 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 625 transitions. Word has length 38 [2021-10-04 18:51:03,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:03,926 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 625 transitions. [2021-10-04 18:51:03,926 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-04 18:51:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 625 transitions. [2021-10-04 18:51:03,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:03,927 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:03,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-04 18:51:03,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable209 [2021-10-04 18:51:03,927 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-04 18:51:03,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:03,927 INFO L82 PathProgramCache]: Analyzing trace with hash 327164748, now seen corresponding path program 210 times [2021-10-04 18:51:03,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:03,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914960769] [2021-10-04 18:51:03,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:03,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:04,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:04,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914960769] [2021-10-04 18:51:04,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914960769] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:04,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:04,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:51:04,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271223556] [2021-10-04 18:51:04,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:51:04,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:04,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:51:04,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:51:04,055 INFO L87 Difference]: Start difference. First operand 296 states and 625 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-04 18:51:04,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:04,365 INFO L93 Difference]: Finished difference Result 330 states and 676 transitions. [2021-10-04 18:51:04,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:51:04,365 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-04 18:51:04,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:04,366 INFO L225 Difference]: With dead ends: 330 [2021-10-04 18:51:04,366 INFO L226 Difference]: Without dead ends: 314 [2021-10-04 18:51:04,367 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 184.3ms TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:51:04,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-10-04 18:51:04,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 296. [2021-10-04 18:51:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 2.0983050847457627) internal successors, (619), 295 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 619 transitions. [2021-10-04 18:51:04,370 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 619 transitions. Word has length 38 [2021-10-04 18:51:04,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:04,370 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 619 transitions. [2021-10-04 18:51:04,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:04,370 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 619 transitions. [2021-10-04 18:51:04,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:04,371 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:04,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-04 18:51:04,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2021-10-04 18:51:04,371 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-04 18:51:04,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:04,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1722131550, now seen corresponding path program 211 times [2021-10-04 18:51:04,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:04,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564745853] [2021-10-04 18:51:04,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:04,372 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:04,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:04,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:04,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564745853] [2021-10-04 18:51:04,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564745853] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:04,499 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:04,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:51:04,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195271983] [2021-10-04 18:51:04,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:51:04,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:04,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:51:04,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:51:04,500 INFO L87 Difference]: Start difference. First operand 296 states and 619 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-04 18:51:04,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:04,800 INFO L93 Difference]: Finished difference Result 322 states and 658 transitions. [2021-10-04 18:51:04,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:51:04,801 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-04 18:51:04,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:04,802 INFO L225 Difference]: With dead ends: 322 [2021-10-04 18:51:04,802 INFO L226 Difference]: Without dead ends: 312 [2021-10-04 18:51:04,802 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 182.9ms TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:51:04,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-10-04 18:51:04,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 296. [2021-10-04 18:51:04,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 2.0915254237288137) internal successors, (617), 295 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 617 transitions. [2021-10-04 18:51:04,806 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 617 transitions. Word has length 38 [2021-10-04 18:51:04,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:04,806 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 617 transitions. [2021-10-04 18:51:04,806 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-04 18:51:04,806 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 617 transitions. [2021-10-04 18:51:04,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:04,807 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:04,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-04 18:51:04,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211 [2021-10-04 18:51:04,807 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-04 18:51:04,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:04,807 INFO L82 PathProgramCache]: Analyzing trace with hash 325659998, now seen corresponding path program 212 times [2021-10-04 18:51:04,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:04,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135966256] [2021-10-04 18:51:04,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:04,808 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:04,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:04,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:04,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135966256] [2021-10-04 18:51:04,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135966256] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:04,934 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:04,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:51:04,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434771167] [2021-10-04 18:51:04,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:51:04,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:04,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:51:04,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:51:04,937 INFO L87 Difference]: Start difference. First operand 296 states and 617 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-04 18:51:05,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:05,227 INFO L93 Difference]: Finished difference Result 406 states and 842 transitions. [2021-10-04 18:51:05,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:51:05,228 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-04 18:51:05,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:05,229 INFO L225 Difference]: With dead ends: 406 [2021-10-04 18:51:05,229 INFO L226 Difference]: Without dead ends: 384 [2021-10-04 18:51:05,229 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 182.0ms TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:51:05,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-10-04 18:51:05,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 282. [2021-10-04 18:51:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 2.106761565836299) internal successors, (592), 281 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 592 transitions. [2021-10-04 18:51:05,233 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 592 transitions. Word has length 38 [2021-10-04 18:51:05,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:05,234 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 592 transitions. [2021-10-04 18:51:05,234 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-04 18:51:05,234 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 592 transitions. [2021-10-04 18:51:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:05,234 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:05,234 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:05,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable212 [2021-10-04 18:51:05,235 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-04 18:51:05,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:05,235 INFO L82 PathProgramCache]: Analyzing trace with hash 453961270, now seen corresponding path program 213 times [2021-10-04 18:51:05,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:05,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311649243] [2021-10-04 18:51:05,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:05,235 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:05,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-04 18:51:05,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:05,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311649243] [2021-10-04 18:51:05,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311649243] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:05,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:05,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:51:05,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829201484] [2021-10-04 18:51:05,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:51:05,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:05,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:51:05,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:51:05,328 INFO L87 Difference]: Start difference. First operand 282 states and 592 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:05,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:05,585 INFO L93 Difference]: Finished difference Result 384 states and 789 transitions. [2021-10-04 18:51:05,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:51:05,586 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:51:05,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:05,587 INFO L225 Difference]: With dead ends: 384 [2021-10-04 18:51:05,587 INFO L226 Difference]: Without dead ends: 368 [2021-10-04 18:51:05,587 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 132.0ms TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2021-10-04 18:51:05,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-10-04 18:51:05,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 288. [2021-10-04 18:51:05,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 2.0940766550522647) internal successors, (601), 287 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 601 transitions. [2021-10-04 18:51:05,591 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 601 transitions. Word has length 38 [2021-10-04 18:51:05,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:05,592 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 601 transitions. [2021-10-04 18:51:05,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:05,592 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 601 transitions. [2021-10-04 18:51:05,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:05,592 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:05,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-04 18:51:05,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable213 [2021-10-04 18:51:05,593 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-04 18:51:05,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:05,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1026327788, now seen corresponding path program 214 times [2021-10-04 18:51:05,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:05,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252557209] [2021-10-04 18:51:05,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:05,593 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:05,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:05,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:05,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252557209] [2021-10-04 18:51:05,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252557209] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:05,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:05,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:51:05,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243928254] [2021-10-04 18:51:05,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:51:05,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:05,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:51:05,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:51:05,688 INFO L87 Difference]: Start difference. First operand 288 states and 601 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:05,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:05,962 INFO L93 Difference]: Finished difference Result 370 states and 762 transitions. [2021-10-04 18:51:05,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:51:05,962 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:51:05,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:05,963 INFO L225 Difference]: With dead ends: 370 [2021-10-04 18:51:05,963 INFO L226 Difference]: Without dead ends: 352 [2021-10-04 18:51:05,963 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 149.2ms TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:51:05,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-10-04 18:51:05,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 282. [2021-10-04 18:51:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 2.0854092526690393) internal successors, (586), 281 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 586 transitions. [2021-10-04 18:51:05,968 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 586 transitions. Word has length 38 [2021-10-04 18:51:05,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:05,969 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 586 transitions. [2021-10-04 18:51:05,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-04 18:51:05,969 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 586 transitions. [2021-10-04 18:51:05,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:05,969 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:05,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-04 18:51:05,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable214 [2021-10-04 18:51:05,970 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-04 18:51:05,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:05,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1803607412, now seen corresponding path program 215 times [2021-10-04 18:51:05,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:05,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20090372] [2021-10-04 18:51:05,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:05,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:06,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-04 18:51:06,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:06,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20090372] [2021-10-04 18:51:06,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20090372] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:06,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:06,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:51:06,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832346826] [2021-10-04 18:51:06,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:51:06,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:06,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:51:06,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:51:06,081 INFO L87 Difference]: Start difference. First operand 282 states and 586 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:06,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:06,324 INFO L93 Difference]: Finished difference Result 374 states and 780 transitions. [2021-10-04 18:51:06,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:51:06,324 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:51:06,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:06,325 INFO L225 Difference]: With dead ends: 374 [2021-10-04 18:51:06,325 INFO L226 Difference]: Without dead ends: 358 [2021-10-04 18:51:06,325 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 128.4ms TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:51:06,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-10-04 18:51:06,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 282. [2021-10-04 18:51:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 2.078291814946619) internal successors, (584), 281 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 584 transitions. [2021-10-04 18:51:06,329 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 584 transitions. Word has length 38 [2021-10-04 18:51:06,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:06,329 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 584 transitions. [2021-10-04 18:51:06,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:06,329 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 584 transitions. [2021-10-04 18:51:06,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:06,330 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:06,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-04 18:51:06,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215 [2021-10-04 18:51:06,330 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-04 18:51:06,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:06,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1368944438, now seen corresponding path program 216 times [2021-10-04 18:51:06,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:06,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702909237] [2021-10-04 18:51:06,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:06,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:06,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:06,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:06,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702909237] [2021-10-04 18:51:06,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702909237] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:06,422 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:06,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:51:06,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710234559] [2021-10-04 18:51:06,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:51:06,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:06,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:51:06,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:51:06,423 INFO L87 Difference]: Start difference. First operand 282 states and 584 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:06,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:06,658 INFO L93 Difference]: Finished difference Result 350 states and 724 transitions. [2021-10-04 18:51:06,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:51:06,659 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:51:06,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:06,660 INFO L225 Difference]: With dead ends: 350 [2021-10-04 18:51:06,660 INFO L226 Difference]: Without dead ends: 338 [2021-10-04 18:51:06,660 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 130.8ms TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:51:06,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-10-04 18:51:06,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 282. [2021-10-04 18:51:06,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 2.0711743772241995) internal successors, (582), 281 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-04 18:51:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 582 transitions. [2021-10-04 18:51:06,665 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 582 transitions. Word has length 38 [2021-10-04 18:51:06,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:06,665 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 582 transitions. [2021-10-04 18:51:06,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:06,665 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 582 transitions. [2021-10-04 18:51:06,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:06,666 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:06,666 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:06,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable216 [2021-10-04 18:51:06,666 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-04 18:51:06,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:06,666 INFO L82 PathProgramCache]: Analyzing trace with hash -524033034, now seen corresponding path program 217 times [2021-10-04 18:51:06,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:06,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37561803] [2021-10-04 18:51:06,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:06,667 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:06,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:06,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37561803] [2021-10-04 18:51:06,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37561803] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:06,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:06,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:51:06,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097747244] [2021-10-04 18:51:06,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:51:06,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:06,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:51:06,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:51:06,757 INFO L87 Difference]: Start difference. First operand 282 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-04 18:51:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:06,975 INFO L93 Difference]: Finished difference Result 294 states and 602 transitions. [2021-10-04 18:51:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:51:06,976 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-04 18:51:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:06,977 INFO L225 Difference]: With dead ends: 294 [2021-10-04 18:51:06,977 INFO L226 Difference]: Without dead ends: 264 [2021-10-04 18:51:06,977 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 104.0ms TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2021-10-04 18:51:06,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-10-04 18:51:06,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2021-10-04 18:51:06,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 2.08745247148289) internal successors, (549), 263 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 549 transitions. [2021-10-04 18:51:06,980 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 549 transitions. Word has length 38 [2021-10-04 18:51:06,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:06,981 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 549 transitions. [2021-10-04 18:51:06,981 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-04 18:51:06,981 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 549 transitions. [2021-10-04 18:51:06,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:06,981 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:06,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-04 18:51:06,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable217 [2021-10-04 18:51:06,982 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-04 18:51:06,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:06,982 INFO L82 PathProgramCache]: Analyzing trace with hash 161112942, now seen corresponding path program 218 times [2021-10-04 18:51:06,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:06,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718882222] [2021-10-04 18:51:06,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:06,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:07,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-04 18:51:07,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:07,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718882222] [2021-10-04 18:51:07,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718882222] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:07,079 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:07,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:51:07,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523127963] [2021-10-04 18:51:07,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:51:07,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:07,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:51:07,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:51:07,081 INFO L87 Difference]: Start difference. First operand 264 states and 549 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:07,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:07,315 INFO L93 Difference]: Finished difference Result 336 states and 693 transitions. [2021-10-04 18:51:07,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:51:07,316 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:51:07,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:07,316 INFO L225 Difference]: With dead ends: 336 [2021-10-04 18:51:07,317 INFO L226 Difference]: Without dead ends: 320 [2021-10-04 18:51:07,317 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 136.2ms TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:51:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-10-04 18:51:07,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 264. [2021-10-04 18:51:07,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 2.079847908745247) internal successors, (547), 263 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 547 transitions. [2021-10-04 18:51:07,321 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 547 transitions. Word has length 38 [2021-10-04 18:51:07,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:07,321 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 547 transitions. [2021-10-04 18:51:07,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:07,321 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 547 transitions. [2021-10-04 18:51:07,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:07,322 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:07,322 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:07,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable218 [2021-10-04 18:51:07,322 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-04 18:51:07,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:07,322 INFO L82 PathProgramCache]: Analyzing trace with hash -271620556, now seen corresponding path program 219 times [2021-10-04 18:51:07,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:07,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782274175] [2021-10-04 18:51:07,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:07,323 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:07,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:07,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782274175] [2021-10-04 18:51:07,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782274175] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:07,413 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:07,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:51:07,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110142824] [2021-10-04 18:51:07,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:51:07,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:07,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:51:07,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:51:07,414 INFO L87 Difference]: Start difference. First operand 264 states and 547 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:07,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:07,664 INFO L93 Difference]: Finished difference Result 336 states and 691 transitions. [2021-10-04 18:51:07,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:51:07,664 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:51:07,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:07,665 INFO L225 Difference]: With dead ends: 336 [2021-10-04 18:51:07,665 INFO L226 Difference]: Without dead ends: 322 [2021-10-04 18:51:07,665 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 135.6ms TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2021-10-04 18:51:07,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-10-04 18:51:07,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 288. [2021-10-04 18:51:07,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 2.0940766550522647) internal successors, (601), 287 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:07,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 601 transitions. [2021-10-04 18:51:07,669 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 601 transitions. Word has length 38 [2021-10-04 18:51:07,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:07,669 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 601 transitions. [2021-10-04 18:51:07,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 601 transitions. [2021-10-04 18:51:07,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:07,670 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:07,670 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:07,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable219 [2021-10-04 18:51:07,670 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-04 18:51:07,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:07,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1651584530, now seen corresponding path program 220 times [2021-10-04 18:51:07,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:07,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772576329] [2021-10-04 18:51:07,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:07,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:07,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:07,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772576329] [2021-10-04 18:51:07,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772576329] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:07,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:07,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:51:07,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105120806] [2021-10-04 18:51:07,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:51:07,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:07,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:51:07,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:51:07,753 INFO L87 Difference]: Start difference. First operand 288 states and 601 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-04 18:51:07,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:07,999 INFO L93 Difference]: Finished difference Result 382 states and 779 transitions. [2021-10-04 18:51:07,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:51:07,999 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-04 18:51:07,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:08,000 INFO L225 Difference]: With dead ends: 382 [2021-10-04 18:51:08,000 INFO L226 Difference]: Without dead ends: 364 [2021-10-04 18:51:08,000 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 123.0ms TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2021-10-04 18:51:08,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-10-04 18:51:08,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 260. [2021-10-04 18:51:08,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 2.115830115830116) internal successors, (548), 259 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-04 18:51:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 548 transitions. [2021-10-04 18:51:08,004 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 548 transitions. Word has length 38 [2021-10-04 18:51:08,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:08,004 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 548 transitions. [2021-10-04 18:51:08,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-04 18:51:08,004 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 548 transitions. [2021-10-04 18:51:08,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:08,005 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:08,005 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:08,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220 [2021-10-04 18:51:08,005 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-04 18:51:08,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:08,005 INFO L82 PathProgramCache]: Analyzing trace with hash 770345500, now seen corresponding path program 221 times [2021-10-04 18:51:08,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:08,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288410387] [2021-10-04 18:51:08,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:08,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:08,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:08,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:08,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288410387] [2021-10-04 18:51:08,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288410387] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:08,093 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:08,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:51:08,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231762941] [2021-10-04 18:51:08,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:51:08,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:08,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:51:08,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:51:08,096 INFO L87 Difference]: Start difference. First operand 260 states and 548 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:08,406 INFO L93 Difference]: Finished difference Result 356 states and 729 transitions. [2021-10-04 18:51:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:51:08,407 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:51:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:08,408 INFO L225 Difference]: With dead ends: 356 [2021-10-04 18:51:08,408 INFO L226 Difference]: Without dead ends: 328 [2021-10-04 18:51:08,408 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 155.7ms TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:51:08,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-10-04 18:51:08,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 244. [2021-10-04 18:51:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 2.074074074074074) internal successors, (504), 243 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-04 18:51:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 504 transitions. [2021-10-04 18:51:08,414 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 504 transitions. Word has length 38 [2021-10-04 18:51:08,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:08,414 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 504 transitions. [2021-10-04 18:51:08,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:08,414 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 504 transitions. [2021-10-04 18:51:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:08,415 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:08,415 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:08,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable221 [2021-10-04 18:51:08,416 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-04 18:51:08,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:08,416 INFO L82 PathProgramCache]: Analyzing trace with hash -770128866, now seen corresponding path program 222 times [2021-10-04 18:51:08,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:08,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235116580] [2021-10-04 18:51:08,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:08,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:08,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-04 18:51:08,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:08,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235116580] [2021-10-04 18:51:08,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235116580] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:08,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:08,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:51:08,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118019636] [2021-10-04 18:51:08,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:51:08,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:08,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:51:08,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:51:08,524 INFO L87 Difference]: Start difference. First operand 244 states and 504 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-04 18:51:08,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:08,737 INFO L93 Difference]: Finished difference Result 284 states and 572 transitions. [2021-10-04 18:51:08,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:51:08,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-04 18:51:08,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:08,738 INFO L225 Difference]: With dead ends: 284 [2021-10-04 18:51:08,738 INFO L226 Difference]: Without dead ends: 266 [2021-10-04 18:51:08,739 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 133.0ms TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:51:08,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-10-04 18:51:08,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 242. [2021-10-04 18:51:08,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 2.070539419087137) internal successors, (499), 241 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:08,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 499 transitions. [2021-10-04 18:51:08,741 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 499 transitions. Word has length 38 [2021-10-04 18:51:08,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:08,742 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 499 transitions. [2021-10-04 18:51:08,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:08,742 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 499 transitions. [2021-10-04 18:51:08,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:08,742 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:08,742 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:08,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable222 [2021-10-04 18:51:08,743 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-04 18:51:08,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:08,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1260949556, now seen corresponding path program 223 times [2021-10-04 18:51:08,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:08,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581909110] [2021-10-04 18:51:08,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:08,743 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:08,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-04 18:51:08,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:08,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581909110] [2021-10-04 18:51:08,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581909110] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:08,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:08,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:51:08,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993484901] [2021-10-04 18:51:08,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:51:08,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:08,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:51:08,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:51:08,846 INFO L87 Difference]: Start difference. First operand 242 states and 499 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-04 18:51:09,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:09,087 INFO L93 Difference]: Finished difference Result 278 states and 561 transitions. [2021-10-04 18:51:09,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:51:09,088 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-04 18:51:09,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:09,089 INFO L225 Difference]: With dead ends: 278 [2021-10-04 18:51:09,089 INFO L226 Difference]: Without dead ends: 262 [2021-10-04 18:51:09,089 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 135.4ms TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:51:09,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-10-04 18:51:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 248. [2021-10-04 18:51:09,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 2.032388663967611) internal successors, (502), 247 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-04 18:51:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 502 transitions. [2021-10-04 18:51:09,092 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 502 transitions. Word has length 38 [2021-10-04 18:51:09,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:09,092 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 502 transitions. [2021-10-04 18:51:09,092 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-04 18:51:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 502 transitions. [2021-10-04 18:51:09,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:09,093 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:09,093 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:09,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable223 [2021-10-04 18:51:09,093 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-04 18:51:09,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:09,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1804179148, now seen corresponding path program 224 times [2021-10-04 18:51:09,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:09,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936255300] [2021-10-04 18:51:09,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:09,094 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:09,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:09,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:09,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936255300] [2021-10-04 18:51:09,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936255300] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:09,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:09,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:51:09,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332928046] [2021-10-04 18:51:09,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:51:09,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:09,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:51:09,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:51:09,200 INFO L87 Difference]: Start difference. First operand 248 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-04 18:51:09,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:09,481 INFO L93 Difference]: Finished difference Result 280 states and 552 transitions. [2021-10-04 18:51:09,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:51:09,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-04 18:51:09,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:09,482 INFO L225 Difference]: With dead ends: 280 [2021-10-04 18:51:09,482 INFO L226 Difference]: Without dead ends: 240 [2021-10-04 18:51:09,482 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 157.1ms TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:51:09,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-10-04 18:51:09,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 228. [2021-10-04 18:51:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 2.026431718061674) internal successors, (460), 227 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:09,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 460 transitions. [2021-10-04 18:51:09,485 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 460 transitions. Word has length 38 [2021-10-04 18:51:09,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:09,485 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 460 transitions. [2021-10-04 18:51:09,485 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-04 18:51:09,485 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 460 transitions. [2021-10-04 18:51:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:09,486 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:09,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-04 18:51:09,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable224 [2021-10-04 18:51:09,486 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-04 18:51:09,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:09,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1030484690, now seen corresponding path program 225 times [2021-10-04 18:51:09,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:09,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095870735] [2021-10-04 18:51:09,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:09,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:09,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:09,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:09,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095870735] [2021-10-04 18:51:09,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095870735] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:09,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:09,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:51:09,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582523061] [2021-10-04 18:51:09,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:51:09,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:09,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:51:09,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:51:09,574 INFO L87 Difference]: Start difference. First operand 228 states and 460 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-04 18:51:09,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:09,744 INFO L93 Difference]: Finished difference Result 272 states and 542 transitions. [2021-10-04 18:51:09,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:51:09,744 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-04 18:51:09,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:09,745 INFO L225 Difference]: With dead ends: 272 [2021-10-04 18:51:09,745 INFO L226 Difference]: Without dead ends: 260 [2021-10-04 18:51:09,746 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 108.4ms TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-10-04 18:51:09,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-10-04 18:51:09,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 232. [2021-10-04 18:51:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 2.012987012987013) internal successors, (465), 231 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 465 transitions. [2021-10-04 18:51:09,749 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 465 transitions. Word has length 38 [2021-10-04 18:51:09,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:09,749 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 465 transitions. [2021-10-04 18:51:09,749 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-04 18:51:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 465 transitions. [2021-10-04 18:51:09,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:09,750 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:09,750 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:09,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable225 [2021-10-04 18:51:09,750 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-04 18:51:09,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:09,751 INFO L82 PathProgramCache]: Analyzing trace with hash -784448034, now seen corresponding path program 226 times [2021-10-04 18:51:09,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:09,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044520669] [2021-10-04 18:51:09,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:09,751 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:09,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:09,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:09,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044520669] [2021-10-04 18:51:09,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044520669] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:09,830 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:09,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:51:09,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044453091] [2021-10-04 18:51:09,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:51:09,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:09,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:51:09,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:51:09,832 INFO L87 Difference]: Start difference. First operand 232 states and 465 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:09,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:09,999 INFO L93 Difference]: Finished difference Result 244 states and 483 transitions. [2021-10-04 18:51:09,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:51:09,999 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:51:10,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:10,000 INFO L225 Difference]: With dead ends: 244 [2021-10-04 18:51:10,000 INFO L226 Difference]: Without dead ends: 212 [2021-10-04 18:51:10,001 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 107.1ms TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-10-04 18:51:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-10-04 18:51:10,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2021-10-04 18:51:10,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 2.028436018957346) internal successors, (428), 211 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:10,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 428 transitions. [2021-10-04 18:51:10,003 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 428 transitions. Word has length 38 [2021-10-04 18:51:10,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:10,003 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 428 transitions. [2021-10-04 18:51:10,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:10,004 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 428 transitions. [2021-10-04 18:51:10,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:10,004 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:10,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-04 18:51:10,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2021-10-04 18:51:10,004 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-04 18:51:10,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:10,005 INFO L82 PathProgramCache]: Analyzing trace with hash -2022262326, now seen corresponding path program 227 times [2021-10-04 18:51:10,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:10,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019998186] [2021-10-04 18:51:10,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:10,005 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:10,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:10,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:10,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019998186] [2021-10-04 18:51:10,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019998186] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:10,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:10,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:51:10,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885906855] [2021-10-04 18:51:10,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:51:10,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:10,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:51:10,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:51:10,092 INFO L87 Difference]: Start difference. First operand 212 states and 428 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:10,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:10,254 INFO L93 Difference]: Finished difference Result 234 states and 463 transitions. [2021-10-04 18:51:10,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:51:10,254 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:51:10,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:10,255 INFO L225 Difference]: With dead ends: 234 [2021-10-04 18:51:10,255 INFO L226 Difference]: Without dead ends: 214 [2021-10-04 18:51:10,255 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 79.2ms TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-10-04 18:51:10,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-10-04 18:51:10,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2021-10-04 18:51:10,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 2.0) internal successors, (422), 211 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-04 18:51:10,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 422 transitions. [2021-10-04 18:51:10,258 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 422 transitions. Word has length 38 [2021-10-04 18:51:10,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:10,258 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 422 transitions. [2021-10-04 18:51:10,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:10,258 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 422 transitions. [2021-10-04 18:51:10,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:10,259 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:10,259 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:10,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable227 [2021-10-04 18:51:10,259 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-04 18:51:10,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:10,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1944995480, now seen corresponding path program 228 times [2021-10-04 18:51:10,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:10,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577560635] [2021-10-04 18:51:10,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:10,260 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:10,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:10,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577560635] [2021-10-04 18:51:10,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577560635] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:10,376 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:10,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-04 18:51:10,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982133321] [2021-10-04 18:51:10,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:51:10,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:10,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:51:10,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:51:10,378 INFO L87 Difference]: Start difference. First operand 212 states and 422 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-04 18:51:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:10,623 INFO L93 Difference]: Finished difference Result 256 states and 506 transitions. [2021-10-04 18:51:10,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:51:10,624 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-04 18:51:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:10,624 INFO L225 Difference]: With dead ends: 256 [2021-10-04 18:51:10,625 INFO L226 Difference]: Without dead ends: 234 [2021-10-04 18:51:10,625 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 145.5ms TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:51:10,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-10-04 18:51:10,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 206. [2021-10-04 18:51:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.9853658536585366) internal successors, (407), 205 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:10,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 407 transitions. [2021-10-04 18:51:10,628 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 407 transitions. Word has length 38 [2021-10-04 18:51:10,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:10,628 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 407 transitions. [2021-10-04 18:51:10,628 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-04 18:51:10,628 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 407 transitions. [2021-10-04 18:51:10,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:10,628 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:10,629 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:10,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable228 [2021-10-04 18:51:10,629 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-04 18:51:10,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:10,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1208897404, now seen corresponding path program 229 times [2021-10-04 18:51:10,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:10,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677407309] [2021-10-04 18:51:10,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:10,630 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:10,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-04 18:51:10,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:10,722 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677407309] [2021-10-04 18:51:10,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677407309] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:10,722 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:10,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:51:10,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093207971] [2021-10-04 18:51:10,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:51:10,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:10,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:51:10,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:51:10,724 INFO L87 Difference]: Start difference. First operand 206 states and 407 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:10,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:10,908 INFO L93 Difference]: Finished difference Result 226 states and 437 transitions. [2021-10-04 18:51:10,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:51:10,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-04 18:51:10,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:10,909 INFO L225 Difference]: With dead ends: 226 [2021-10-04 18:51:10,909 INFO L226 Difference]: Without dead ends: 210 [2021-10-04 18:51:10,909 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 96.9ms TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-10-04 18:51:10,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-10-04 18:51:10,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2021-10-04 18:51:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.9698492462311559) internal successors, (392), 199 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-04 18:51:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 392 transitions. [2021-10-04 18:51:10,912 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 392 transitions. Word has length 38 [2021-10-04 18:51:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:10,912 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 392 transitions. [2021-10-04 18:51:10,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:10,912 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 392 transitions. [2021-10-04 18:51:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:10,913 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:10,913 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:10,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable229 [2021-10-04 18:51:10,913 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-04 18:51:10,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:10,913 INFO L82 PathProgramCache]: Analyzing trace with hash -271391654, now seen corresponding path program 230 times [2021-10-04 18:51:10,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:10,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066089795] [2021-10-04 18:51:10,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:10,914 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:11,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:11,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:11,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066089795] [2021-10-04 18:51:11,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066089795] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:11,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:11,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:51:11,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582674658] [2021-10-04 18:51:11,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:51:11,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:11,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:51:11,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:51:11,003 INFO L87 Difference]: Start difference. First operand 200 states and 392 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:11,204 INFO L93 Difference]: Finished difference Result 212 states and 410 transitions. [2021-10-04 18:51:11,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:51:11,204 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:51:11,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:11,205 INFO L225 Difference]: With dead ends: 212 [2021-10-04 18:51:11,205 INFO L226 Difference]: Without dead ends: 194 [2021-10-04 18:51:11,205 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 99.8ms TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2021-10-04 18:51:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-10-04 18:51:11,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2021-10-04 18:51:11,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.9533678756476685) internal successors, (377), 193 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:11,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 377 transitions. [2021-10-04 18:51:11,207 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 377 transitions. Word has length 38 [2021-10-04 18:51:11,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:11,208 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 377 transitions. [2021-10-04 18:51:11,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:11,208 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 377 transitions. [2021-10-04 18:51:11,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:11,208 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:11,208 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:11,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230 [2021-10-04 18:51:11,209 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-04 18:51:11,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:11,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1048671278, now seen corresponding path program 231 times [2021-10-04 18:51:11,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:11,209 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498842318] [2021-10-04 18:51:11,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:11,209 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:11,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-04 18:51:11,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:11,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498842318] [2021-10-04 18:51:11,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498842318] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:11,304 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:11,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:51:11,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966278965] [2021-10-04 18:51:11,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:51:11,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:11,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:51:11,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:51:11,305 INFO L87 Difference]: Start difference. First operand 194 states and 377 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:11,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:11,496 INFO L93 Difference]: Finished difference Result 208 states and 400 transitions. [2021-10-04 18:51:11,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:51:11,496 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:51:11,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:11,497 INFO L225 Difference]: With dead ends: 208 [2021-10-04 18:51:11,497 INFO L226 Difference]: Without dead ends: 192 [2021-10-04 18:51:11,497 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 120.6ms TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2021-10-04 18:51:11,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-10-04 18:51:11,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2021-10-04 18:51:11,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.9476439790575917) internal successors, (372), 191 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 372 transitions. [2021-10-04 18:51:11,500 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 372 transitions. Word has length 38 [2021-10-04 18:51:11,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:11,500 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 372 transitions. [2021-10-04 18:51:11,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:11,501 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 372 transitions. [2021-10-04 18:51:11,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:11,501 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:11,501 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:11,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231 [2021-10-04 18:51:11,501 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-04 18:51:11,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:11,502 INFO L82 PathProgramCache]: Analyzing trace with hash 2123880572, now seen corresponding path program 232 times [2021-10-04 18:51:11,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:11,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759722134] [2021-10-04 18:51:11,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:11,502 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:11,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-04 18:51:11,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:11,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759722134] [2021-10-04 18:51:11,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759722134] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:11,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:11,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:51:11,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792240592] [2021-10-04 18:51:11,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:51:11,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:11,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:51:11,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:51:11,597 INFO L87 Difference]: Start difference. First operand 192 states and 372 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:11,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:11,763 INFO L93 Difference]: Finished difference Result 164 states and 310 transitions. [2021-10-04 18:51:11,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:51:11,763 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:51:11,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:11,764 INFO L225 Difference]: With dead ends: 164 [2021-10-04 18:51:11,764 INFO L226 Difference]: Without dead ends: 144 [2021-10-04 18:51:11,764 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 98.9ms TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2021-10-04 18:51:11,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-10-04 18:51:11,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-10-04 18:51:11,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.944055944055944) internal successors, (278), 143 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 278 transitions. [2021-10-04 18:51:11,766 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 278 transitions. Word has length 38 [2021-10-04 18:51:11,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:11,766 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 278 transitions. [2021-10-04 18:51:11,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 278 transitions. [2021-10-04 18:51:11,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:11,767 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:11,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-04 18:51:11,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable232 [2021-10-04 18:51:11,767 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-04 18:51:11,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:11,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1340592674, now seen corresponding path program 233 times [2021-10-04 18:51:11,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:11,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297628420] [2021-10-04 18:51:11,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:11,768 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:11,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-04 18:51:11,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:11,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297628420] [2021-10-04 18:51:11,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297628420] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:11,850 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:11,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:51:11,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853549133] [2021-10-04 18:51:11,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:51:11,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:11,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:51:11,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:51:11,852 INFO L87 Difference]: Start difference. First operand 144 states and 278 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-04 18:51:11,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:11,979 INFO L93 Difference]: Finished difference Result 160 states and 300 transitions. [2021-10-04 18:51:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:51:11,980 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-04 18:51:11,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:11,980 INFO L225 Difference]: With dead ends: 160 [2021-10-04 18:51:11,980 INFO L226 Difference]: Without dead ends: 146 [2021-10-04 18:51:11,981 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 78.6ms TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-10-04 18:51:11,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-10-04 18:51:11,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2021-10-04 18:51:11,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.902097902097902) internal successors, (272), 143 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:11,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 272 transitions. [2021-10-04 18:51:11,984 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 272 transitions. Word has length 38 [2021-10-04 18:51:11,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:11,984 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 272 transitions. [2021-10-04 18:51:11,984 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-04 18:51:11,984 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 272 transitions. [2021-10-04 18:51:11,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:11,984 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:11,985 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:11,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable233 [2021-10-04 18:51:11,985 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-04 18:51:11,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:11,985 INFO L82 PathProgramCache]: Analyzing trace with hash -298626618, now seen corresponding path program 234 times [2021-10-04 18:51:11,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:11,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120239685] [2021-10-04 18:51:11,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:11,986 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:12,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:12,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120239685] [2021-10-04 18:51:12,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120239685] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:12,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:12,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:51:12,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990025610] [2021-10-04 18:51:12,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:51:12,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:12,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:51:12,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:51:12,067 INFO L87 Difference]: Start difference. First operand 144 states and 272 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-04 18:51:12,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:12,236 INFO L93 Difference]: Finished difference Result 184 states and 345 transitions. [2021-10-04 18:51:12,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:51:12,237 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-04 18:51:12,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:12,237 INFO L225 Difference]: With dead ends: 184 [2021-10-04 18:51:12,237 INFO L226 Difference]: Without dead ends: 160 [2021-10-04 18:51:12,237 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 94.5ms TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2021-10-04 18:51:12,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-10-04 18:51:12,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 132. [2021-10-04 18:51:12,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.8244274809160306) internal successors, (239), 131 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:12,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 239 transitions. [2021-10-04 18:51:12,239 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 239 transitions. Word has length 38 [2021-10-04 18:51:12,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:12,239 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 239 transitions. [2021-10-04 18:51:12,239 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-04 18:51:12,239 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 239 transitions. [2021-10-04 18:51:12,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:12,240 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:12,240 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:12,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable234 [2021-10-04 18:51:12,240 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-04 18:51:12,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:12,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1123219246, now seen corresponding path program 235 times [2021-10-04 18:51:12,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:12,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861276964] [2021-10-04 18:51:12,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:12,241 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:12,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:12,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861276964] [2021-10-04 18:51:12,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861276964] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:12,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:12,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:51:12,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194592100] [2021-10-04 18:51:12,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:51:12,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:12,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:51:12,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:51:12,335 INFO L87 Difference]: Start difference. First operand 132 states and 239 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:12,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:12,490 INFO L93 Difference]: Finished difference Result 144 states and 257 transitions. [2021-10-04 18:51:12,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:51:12,491 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:51:12,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:12,492 INFO L225 Difference]: With dead ends: 144 [2021-10-04 18:51:12,492 INFO L226 Difference]: Without dead ends: 128 [2021-10-04 18:51:12,492 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 91.0ms TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-10-04 18:51:12,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-10-04 18:51:12,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2021-10-04 18:51:12,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.792) internal successors, (224), 125 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:12,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 224 transitions. [2021-10-04 18:51:12,494 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 224 transitions. Word has length 38 [2021-10-04 18:51:12,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:12,494 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 224 transitions. [2021-10-04 18:51:12,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:12,494 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 224 transitions. [2021-10-04 18:51:12,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:12,494 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:12,495 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:12,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable235 [2021-10-04 18:51:12,495 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-04 18:51:12,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:12,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1666448838, now seen corresponding path program 236 times [2021-10-04 18:51:12,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:12,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826367067] [2021-10-04 18:51:12,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:12,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:12,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:12,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826367067] [2021-10-04 18:51:12,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826367067] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:12,588 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:12,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:51:12,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170598736] [2021-10-04 18:51:12,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:51:12,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:12,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:51:12,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:51:12,590 INFO L87 Difference]: Start difference. First operand 126 states and 224 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:12,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:12,757 INFO L93 Difference]: Finished difference Result 138 states and 242 transitions. [2021-10-04 18:51:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:51:12,758 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:51:12,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:12,758 INFO L225 Difference]: With dead ends: 138 [2021-10-04 18:51:12,758 INFO L226 Difference]: Without dead ends: 120 [2021-10-04 18:51:12,758 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 107.7ms TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2021-10-04 18:51:12,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-10-04 18:51:12,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2021-10-04 18:51:12,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.7563025210084033) internal successors, (209), 119 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:12,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 209 transitions. [2021-10-04 18:51:12,760 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 209 transitions. Word has length 38 [2021-10-04 18:51:12,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:12,760 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 209 transitions. [2021-10-04 18:51:12,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:12,761 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 209 transitions. [2021-10-04 18:51:12,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:12,761 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:12,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-04 18:51:12,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236 [2021-10-04 18:51:12,761 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-04 18:51:12,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:12,761 INFO L82 PathProgramCache]: Analyzing trace with hash -638378450, now seen corresponding path program 237 times [2021-10-04 18:51:12,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:12,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930301235] [2021-10-04 18:51:12,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:12,762 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:12,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-04 18:51:12,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:12,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930301235] [2021-10-04 18:51:12,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930301235] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:12,833 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:12,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:51:12,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801771530] [2021-10-04 18:51:12,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-04 18:51:12,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:12,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-04 18:51:12,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:51:12,834 INFO L87 Difference]: Start difference. First operand 120 states and 209 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-04 18:51:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:12,979 INFO L93 Difference]: Finished difference Result 128 states and 219 transitions. [2021-10-04 18:51:12,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:51:12,980 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-04 18:51:12,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:12,980 INFO L225 Difference]: With dead ends: 128 [2021-10-04 18:51:12,981 INFO L226 Difference]: Without dead ends: 116 [2021-10-04 18:51:12,981 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 91.3ms TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2021-10-04 18:51:12,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-10-04 18:51:12,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-10-04 18:51:12,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.7391304347826086) internal successors, (200), 115 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:12,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 200 transitions. [2021-10-04 18:51:12,983 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 200 transitions. Word has length 38 [2021-10-04 18:51:12,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:12,983 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 200 transitions. [2021-10-04 18:51:12,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:12,983 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 200 transitions. [2021-10-04 18:51:12,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-04 18:51:12,984 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:51:12,984 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:51:12,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable237 [2021-10-04 18:51:12,984 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-04 18:51:12,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:51:12,984 INFO L82 PathProgramCache]: Analyzing trace with hash -392341794, now seen corresponding path program 238 times [2021-10-04 18:51:12,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:51:12,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237652766] [2021-10-04 18:51:12,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:51:12,985 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:51:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:51:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:51:13,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:51:13,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237652766] [2021-10-04 18:51:13,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237652766] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:51:13,081 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:51:13,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:51:13,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037452087] [2021-10-04 18:51:13,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:51:13,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:51:13,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:51:13,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:51:13,083 INFO L87 Difference]: Start difference. First operand 116 states and 200 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:13,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:51:13,207 INFO L93 Difference]: Finished difference Result 68 states and 112 transitions. [2021-10-04 18:51:13,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:51:13,208 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-04 18:51:13,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:51:13,208 INFO L225 Difference]: With dead ends: 68 [2021-10-04 18:51:13,208 INFO L226 Difference]: Without dead ends: 0 [2021-10-04 18:51:13,209 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 108.3ms TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2021-10-04 18:51:13,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-04 18:51:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-04 18:51:13,209 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-04 18:51:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-04 18:51:13,210 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2021-10-04 18:51:13,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:51:13,210 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-04 18:51:13,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:51:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-04 18:51:13,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-04 18:51:13,213 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-04 18:51:13,214 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-04 18:51:13,214 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-04 18:51:13,214 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-04 18:51:13,214 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATION [2021-10-04 18:51:13,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable238 [2021-10-04 18:51:13,219 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-04 18:51:13,220 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-04 18:51:13,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 06:51:13 BasicIcfg [2021-10-04 18:51:13,222 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-04 18:51:13,223 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-04 18:51:13,223 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-04 18:51:13,223 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-04 18:51:13,224 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 06:49:01" (3/4) ... [2021-10-04 18:51:13,227 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-04 18:51:13,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-10-04 18:51:13,233 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-10-04 18:51:13,233 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-10-04 18:51:13,233 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2021-10-04 18:51:13,238 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-10-04 18:51:13,238 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-04 18:51:13,238 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-04 18:51:13,238 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-04 18:51:13,284 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-04 18:51:13,284 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-04 18:51:13,286 INFO L168 Benchmark]: Toolchain (without parser) took 133041.14 ms. Allocated memory was 54.5 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 31.3 MB in the beginning and 538.1 MB in the end (delta: -506.8 MB). Peak memory consumption was 818.6 MB. Max. memory is 16.1 GB. [2021-10-04 18:51:13,287 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 44.0 MB. Free memory was 27.4 MB in the beginning and 27.4 MB in the end (delta: 33.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-04 18:51:13,288 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.76 ms. Allocated memory is still 54.5 MB. Free memory was 30.9 MB in the beginning and 33.9 MB in the end (delta: -2.9 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. [2021-10-04 18:51:13,288 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.52 ms. Allocated memory is still 54.5 MB. Free memory was 33.9 MB in the beginning and 31.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-04 18:51:13,289 INFO L168 Benchmark]: Boogie Preprocessor took 57.37 ms. Allocated memory is still 54.5 MB. Free memory was 31.8 MB in the beginning and 30.6 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-04 18:51:13,289 INFO L168 Benchmark]: RCFGBuilder took 670.56 ms. Allocated memory is still 54.5 MB. Free memory was 30.4 MB in the beginning and 29.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 12.5 MB. Max. memory is 16.1 GB. [2021-10-04 18:51:13,290 INFO L168 Benchmark]: TraceAbstraction took 131847.23 ms. Allocated memory was 54.5 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 28.9 MB in the beginning and 541.2 MB in the end (delta: -512.3 MB). Peak memory consumption was 810.9 MB. Max. memory is 16.1 GB. [2021-10-04 18:51:13,290 INFO L168 Benchmark]: Witness Printer took 61.68 ms. Allocated memory is still 1.4 GB. Free memory was 541.2 MB in the beginning and 538.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-04 18:51:13,293 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.23 ms. Allocated memory is still 44.0 MB. Free memory was 27.4 MB in the beginning and 27.4 MB in the end (delta: 33.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 310.76 ms. Allocated memory is still 54.5 MB. Free memory was 30.9 MB in the beginning and 33.9 MB in the end (delta: -2.9 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 80.52 ms. Allocated memory is still 54.5 MB. Free memory was 33.9 MB in the beginning and 31.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 57.37 ms. Allocated memory is still 54.5 MB. Free memory was 31.8 MB in the beginning and 30.6 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 670.56 ms. Allocated memory is still 54.5 MB. Free memory was 30.4 MB in the beginning and 29.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 12.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 131847.23 ms. Allocated memory was 54.5 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 28.9 MB in the beginning and 541.2 MB in the end (delta: -512.3 MB). Peak memory consumption was 810.9 MB. Max. memory is 16.1 GB. * Witness Printer took 61.68 ms. Allocated memory is still 1.4 GB. Free memory was 541.2 MB in the beginning and 538.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4893.3ms, 162 PlacesBefore, 56 PlacesAfterwards, 155 TransitionsBefore, 46 TransitionsAfterwards, 3864 CoEnabledTransitionPairs, 7 FixpointIterations, 67 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 14 ConcurrentYvCompositions, 3 ChoiceCompositions, 135 TotalNumberOfCompositions, 11537 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5870, positive: 5616, positive conditional: 0, positive unconditional: 5616, negative: 254, negative conditional: 0, negative unconditional: 254, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2870, positive: 2801, positive conditional: 0, positive unconditional: 2801, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2870, positive: 2665, positive conditional: 0, positive unconditional: 2665, negative: 205, negative conditional: 0, negative unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 136, positive conditional: 0, positive unconditional: 136, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 227, positive: 122, positive conditional: 0, positive unconditional: 122, negative: 105, negative conditional: 0, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5870, positive: 2815, positive conditional: 0, positive unconditional: 2815, negative: 185, negative conditional: 0, negative unconditional: 185, unknown: 2870, unknown conditional: 0, unknown unconditional: 2870] , Statistics on independence cache: Total cache size (in pairs): 387, Positive cache size: 356, Positive conditional cache size: 0, Positive unconditional cache size: 356, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - 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: 99]: 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, 207 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 131621.0ms, OverallIterations: 239, TraceHistogramMax: 1, EmptinessCheckTime: 829.3ms, AutomataDifference: 92686.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5194.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 16402 SDtfs, 19671 SDslu, 97940 SDs, 0 SdLazy, 95631 SolverSat, 6439 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46065.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5203 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 4803 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15780 ImplicationChecksByTransitivity, 39421.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5046occurred in iteration=7, InterpolantAutomatonStates: 4219, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 7165.1ms AutomataMinimizationTime, 239 MinimizatonAttempts, 59850 StatesRemovedByMinimization, 226 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 419.9ms SsaConstructionTime, 4317.8ms SatisfiabilityAnalysisTime, 19148.5ms InterpolantComputationTime, 9070 NumberOfCodeBlocks, 9070 NumberOfCodeBlocksAsserted, 239 NumberOfCheckSat, 8831 ConstructedInterpolants, 0 QuantifiedInterpolants, 28094 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 239 InterpolantComputations, 239 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-04 18:51:13,344 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...