./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel/ticket-3.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-3.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 3becc2ba0b7e983991bfd65eb00af941bbea5c1f ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-05 21:08:44,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-05 21:08:44,185 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-05 21:08:44,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-05 21:08:44,224 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-05 21:08:44,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-05 21:08:44,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-05 21:08:44,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-05 21:08:44,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-05 21:08:44,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-05 21:08:44,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-05 21:08:44,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-05 21:08:44,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-05 21:08:44,242 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-05 21:08:44,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-05 21:08:44,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-05 21:08:44,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-05 21:08:44,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-05 21:08:44,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-05 21:08:44,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-05 21:08:44,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-05 21:08:44,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-05 21:08:44,268 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-05 21:08:44,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-05 21:08:44,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-05 21:08:44,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-05 21:08:44,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-05 21:08:44,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-05 21:08:44,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-05 21:08:44,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-05 21:08:44,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-05 21:08:44,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-05 21:08:44,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-05 21:08:44,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-05 21:08:44,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-05 21:08:44,306 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-05 21:08:44,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-05 21:08:44,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-05 21:08:44,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-05 21:08:44,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-05 21:08:44,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-05 21:08:44,321 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-05 21:08:44,383 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-05 21:08:44,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-05 21:08:44,384 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-05 21:08:44,384 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-05 21:08:44,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-05 21:08:44,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-05 21:08:44,386 INFO L138 SettingsManager]: * Use SBE=true [2021-10-05 21:08:44,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-05 21:08:44,387 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-05 21:08:44,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-05 21:08:44,388 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-05 21:08:44,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-05 21:08:44,388 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-05 21:08:44,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-05 21:08:44,389 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-05 21:08:44,389 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-05 21:08:44,390 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-05 21:08:44,390 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-05 21:08:44,390 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-05 21:08:44,390 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-05 21:08:44,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-05 21:08:44,391 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-05 21:08:44,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-05 21:08:44,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-05 21:08:44,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-05 21:08:44,392 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-05 21:08:44,393 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-05 21:08:44,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-05 21:08:44,393 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-05 21:08:44,394 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-05 21:08:44,394 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 -> 3becc2ba0b7e983991bfd65eb00af941bbea5c1f [2021-10-05 21:08:44,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-05 21:08:44,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-05 21:08:44,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-05 21:08:44,930 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-05 21:08:44,931 INFO L275 PluginConnector]: CDTParser initialized [2021-10-05 21:08:44,933 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel/ticket-3.wvr.c [2021-10-05 21:08:45,039 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/982ed0593/2deff15766874d78825ed80cd9ae9669/FLAG64faac069 [2021-10-05 21:08:45,770 INFO L306 CDTParser]: Found 1 translation units. [2021-10-05 21:08:45,771 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/ticket-3.wvr.c [2021-10-05 21:08:45,784 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/982ed0593/2deff15766874d78825ed80cd9ae9669/FLAG64faac069 [2021-10-05 21:08:46,126 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/982ed0593/2deff15766874d78825ed80cd9ae9669 [2021-10-05 21:08:46,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-05 21:08:46,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-05 21:08:46,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-05 21:08:46,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-05 21:08:46,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-05 21:08:46,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 09:08:46" (1/1) ... [2021-10-05 21:08:46,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4405cf77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:46, skipping insertion in model container [2021-10-05 21:08:46,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 09:08:46" (1/1) ... [2021-10-05 21:08:46,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-05 21:08:46,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-05 21:08:46,450 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-3.wvr.c[2507,2520] [2021-10-05 21:08:46,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-05 21:08:46,470 INFO L203 MainTranslator]: Completed pre-run [2021-10-05 21:08:46,498 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-3.wvr.c[2507,2520] [2021-10-05 21:08:46,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-05 21:08:46,521 INFO L208 MainTranslator]: Completed translation [2021-10-05 21:08:46,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:46 WrapperNode [2021-10-05 21:08:46,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-05 21:08:46,524 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-05 21:08:46,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-05 21:08:46,524 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-05 21:08:46,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:46" (1/1) ... [2021-10-05 21:08:46,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:46" (1/1) ... [2021-10-05 21:08:46,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-05 21:08:46,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-05 21:08:46,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-05 21:08:46,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-05 21:08:46,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:46" (1/1) ... [2021-10-05 21:08:46,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:46" (1/1) ... [2021-10-05 21:08:46,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:46" (1/1) ... [2021-10-05 21:08:46,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:46" (1/1) ... [2021-10-05 21:08:46,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:46" (1/1) ... [2021-10-05 21:08:46,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:46" (1/1) ... [2021-10-05 21:08:46,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:46" (1/1) ... [2021-10-05 21:08:46,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-05 21:08:46,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-05 21:08:46,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-05 21:08:46,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-05 21:08:46,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:46" (1/1) ... [2021-10-05 21:08:46,712 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-05 21:08:46,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 21:08:46,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-05 21:08:46,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-05 21:08:46,848 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-05 21:08:46,849 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-05 21:08:46,849 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-05 21:08:46,849 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-05 21:08:46,849 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-05 21:08:46,850 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-05 21:08:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-05 21:08:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-05 21:08:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-05 21:08:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-05 21:08:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-05 21:08:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-05 21:08:46,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-05 21:08:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-05 21:08:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-05 21:08:46,854 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-05 21:08:47,319 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-05 21:08:47,320 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2021-10-05 21:08:47,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 09:08:47 BoogieIcfgContainer [2021-10-05 21:08:47,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-05 21:08:47,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-05 21:08:47,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-05 21:08:47,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-05 21:08:47,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 09:08:46" (1/3) ... [2021-10-05 21:08:47,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c8c996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 09:08:47, skipping insertion in model container [2021-10-05 21:08:47,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:46" (2/3) ... [2021-10-05 21:08:47,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c8c996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 09:08:47, skipping insertion in model container [2021-10-05 21:08:47,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 09:08:47" (3/3) ... [2021-10-05 21:08:47,346 INFO L111 eAbstractionObserver]: Analyzing ICFG ticket-3.wvr.c [2021-10-05 21:08:47,359 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-05 21:08:47,360 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-05 21:08:47,360 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-05 21:08:47,361 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-05 21:08:47,444 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,446 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,446 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,447 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,447 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,447 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,447 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,448 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,448 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,448 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,448 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,449 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,449 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,450 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,450 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,451 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,451 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,451 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,452 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,452 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,453 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,453 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,454 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,454 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,455 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,456 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,457 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,458 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,458 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,460 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,461 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,461 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,462 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,463 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,464 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,464 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,465 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,465 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,465 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,466 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,466 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,466 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,467 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,467 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,467 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,468 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,469 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,469 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,471 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,471 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,471 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,472 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,472 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,473 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,473 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,475 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,476 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,476 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,477 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,478 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,478 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,481 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,482 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,482 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,483 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,483 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,484 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,485 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,485 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,486 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,486 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,487 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,495 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,496 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,496 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,497 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,497 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,497 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,505 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,505 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,505 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,506 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,506 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,506 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,511 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,512 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,513 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,516 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,519 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,519 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:47,548 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-05 21:08:47,629 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-05 21:08:47,655 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-05 21:08:47,657 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-10-05 21:08:47,690 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-05 21:08:47,706 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 129 transitions, 282 flow [2021-10-05 21:08:47,711 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 129 transitions, 282 flow [2021-10-05 21:08:47,721 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 134 places, 129 transitions, 282 flow [2021-10-05 21:08:47,877 INFO L129 PetriNetUnfolder]: 5/126 cut-off events. [2021-10-05 21:08:47,878 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-05 21:08:47,887 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 5/126 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2021-10-05 21:08:47,894 INFO L116 LiptonReduction]: Number of co-enabled transitions 2032 [2021-10-05 21:08:53,282 INFO L131 LiptonReduction]: Checked pairs total: 6175 [2021-10-05 21:08:53,283 INFO L133 LiptonReduction]: Total number of compositions: 119 [2021-10-05 21:08:53,296 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 36 transitions, 96 flow [2021-10-05 21:08:53,362 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 690 states, 689 states have (on average 3.3207547169811322) internal successors, (2288), 689 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:53,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 690 states, 689 states have (on average 3.3207547169811322) internal successors, (2288), 689 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-05 21:08:53,400 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:08:53,401 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:08:53,402 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:08:53,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:08:53,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1880696020, now seen corresponding path program 1 times [2021-10-05 21:08:53,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:08:53,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66296578] [2021-10-05 21:08:53,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:08:53,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:08:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:08:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:08:53,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:08:53,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66296578] [2021-10-05 21:08:53,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66296578] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:08:53,723 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:08:53,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-05 21:08:53,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063915345] [2021-10-05 21:08:53,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-05 21:08:53,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:08:53,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-05 21:08:53,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-05 21:08:53,755 INFO L87 Difference]: Start difference. First operand has 690 states, 689 states have (on average 3.3207547169811322) internal successors, (2288), 689 states have internal predecessors, (2288), 0 states have call successors, (0), 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 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:08:53,801 INFO L93 Difference]: Finished difference Result 690 states and 1994 transitions. [2021-10-05 21:08:53,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-05 21:08:53,803 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-05 21:08:53,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:08:53,833 INFO L225 Difference]: With dead ends: 690 [2021-10-05 21:08:53,833 INFO L226 Difference]: Without dead ends: 690 [2021-10-05 21:08:53,839 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-05 21:08:53,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-10-05 21:08:53,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2021-10-05 21:08:53,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 689 states have (on average 2.8940493468795356) internal successors, (1994), 689 states have internal predecessors, (1994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:54,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1994 transitions. [2021-10-05 21:08:54,006 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1994 transitions. Word has length 16 [2021-10-05 21:08:54,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:08:54,006 INFO L470 AbstractCegarLoop]: Abstraction has 690 states and 1994 transitions. [2021-10-05 21:08:54,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:54,007 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1994 transitions. [2021-10-05 21:08:54,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:08:54,013 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:08:54,013 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:08:54,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-05 21:08:54,014 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:08:54,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:08:54,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1958890216, now seen corresponding path program 1 times [2021-10-05 21:08:54,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:08:54,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667660984] [2021-10-05 21:08:54,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:08:54,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:08:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:08:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:08:54,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:08:54,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667660984] [2021-10-05 21:08:54,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667660984] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:08:54,563 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:08:54,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 21:08:54,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489011269] [2021-10-05 21:08:54,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 21:08:54,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:08:54,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 21:08:54,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:08:54,567 INFO L87 Difference]: Start difference. First operand 690 states and 1994 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:55,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:08:55,078 INFO L93 Difference]: Finished difference Result 1536 states and 4385 transitions. [2021-10-05 21:08:55,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:08:55,078 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:08:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:08:55,086 INFO L225 Difference]: With dead ends: 1536 [2021-10-05 21:08:55,087 INFO L226 Difference]: Without dead ends: 754 [2021-10-05 21:08:55,088 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 240.0ms TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:08:55,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2021-10-05 21:08:55,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 582. [2021-10-05 21:08:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 2.7263339070567985) internal successors, (1584), 581 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1584 transitions. [2021-10-05 21:08:55,147 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1584 transitions. Word has length 29 [2021-10-05 21:08:55,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:08:55,147 INFO L470 AbstractCegarLoop]: Abstraction has 582 states and 1584 transitions. [2021-10-05 21:08:55,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1584 transitions. [2021-10-05 21:08:55,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:08:55,151 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:08:55,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] [2021-10-05 21:08:55,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-05 21:08:55,153 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:08:55,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:08:55,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1777587464, now seen corresponding path program 2 times [2021-10-05 21:08:55,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:08:55,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356440076] [2021-10-05 21:08:55,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:08:55,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:08:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:08:55,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-05 21:08:55,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:08:55,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356440076] [2021-10-05 21:08:55,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356440076] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:08:55,504 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:08:55,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 21:08:55,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117784504] [2021-10-05 21:08:55,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 21:08:55,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:08:55,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 21:08:55,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-05 21:08:55,506 INFO L87 Difference]: Start difference. First operand 582 states and 1584 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:08:55,750 INFO L93 Difference]: Finished difference Result 828 states and 2244 transitions. [2021-10-05 21:08:55,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 21:08:55,751 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:08:55,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:08:55,757 INFO L225 Difference]: With dead ends: 828 [2021-10-05 21:08:55,758 INFO L226 Difference]: Without dead ends: 710 [2021-10-05 21:08:55,758 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 74.1ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:08:55,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2021-10-05 21:08:55,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 638. [2021-10-05 21:08:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 637 states have (on average 2.682888540031397) internal successors, (1709), 637 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:55,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1709 transitions. [2021-10-05 21:08:55,799 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1709 transitions. Word has length 29 [2021-10-05 21:08:55,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:08:55,800 INFO L470 AbstractCegarLoop]: Abstraction has 638 states and 1709 transitions. [2021-10-05 21:08:55,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:55,800 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1709 transitions. [2021-10-05 21:08:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:08:55,803 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:08:55,803 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:08:55,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-05 21:08:55,804 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:08:55,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:08:55,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1688701780, now seen corresponding path program 3 times [2021-10-05 21:08:55,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:08:55,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474678068] [2021-10-05 21:08:55,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:08:55,806 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:08:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:08:55,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:08:55,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:08:55,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474678068] [2021-10-05 21:08:55,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474678068] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:08:55,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:08:55,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 21:08:55,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206155026] [2021-10-05 21:08:55,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 21:08:55,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:08:55,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 21:08:55,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:08:55,990 INFO L87 Difference]: Start difference. First operand 638 states and 1709 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:56,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:08:56,275 INFO L93 Difference]: Finished difference Result 820 states and 2164 transitions. [2021-10-05 21:08:56,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:08:56,276 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:08:56,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:08:56,283 INFO L225 Difference]: With dead ends: 820 [2021-10-05 21:08:56,283 INFO L226 Difference]: Without dead ends: 734 [2021-10-05 21:08:56,294 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 104.0ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-10-05 21:08:56,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2021-10-05 21:08:56,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 662. [2021-10-05 21:08:56,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 2.6565809379727687) internal successors, (1756), 661 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1756 transitions. [2021-10-05 21:08:56,329 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1756 transitions. Word has length 29 [2021-10-05 21:08:56,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:08:56,330 INFO L470 AbstractCegarLoop]: Abstraction has 662 states and 1756 transitions. [2021-10-05 21:08:56,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:56,330 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1756 transitions. [2021-10-05 21:08:56,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:08:56,334 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:08:56,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] [2021-10-05 21:08:56,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-05 21:08:56,335 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:08:56,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:08:56,336 INFO L82 PathProgramCache]: Analyzing trace with hash -695288994, now seen corresponding path program 4 times [2021-10-05 21:08:56,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:08:56,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389918944] [2021-10-05 21:08:56,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:08:56,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:08:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:08:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:08:56,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:08:56,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389918944] [2021-10-05 21:08:56,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389918944] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:08:56,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:08:56,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:08:56,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075489199] [2021-10-05 21:08:56,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:08:56,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:08:56,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:08:56,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:08:56,503 INFO L87 Difference]: Start difference. First operand 662 states and 1756 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:08:56,913 INFO L93 Difference]: Finished difference Result 872 states and 2234 transitions. [2021-10-05 21:08:56,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:08:56,914 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:08:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:08:56,921 INFO L225 Difference]: With dead ends: 872 [2021-10-05 21:08:56,921 INFO L226 Difference]: Without dead ends: 818 [2021-10-05 21:08:56,922 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 170.7ms TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:08:56,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2021-10-05 21:08:56,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 696. [2021-10-05 21:08:56,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 2.6158273381294963) internal successors, (1818), 695 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:56,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1818 transitions. [2021-10-05 21:08:56,955 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1818 transitions. Word has length 29 [2021-10-05 21:08:56,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:08:56,956 INFO L470 AbstractCegarLoop]: Abstraction has 696 states and 1818 transitions. [2021-10-05 21:08:56,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:56,956 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1818 transitions. [2021-10-05 21:08:56,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:08:56,959 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:08:56,960 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:08:56,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-05 21:08:56,960 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:08:56,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:08:56,961 INFO L82 PathProgramCache]: Analyzing trace with hash -815126900, now seen corresponding path program 5 times [2021-10-05 21:08:56,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:08:56,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64418892] [2021-10-05 21:08:56,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:08:56,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:08:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:08:57,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-05 21:08:57,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:08:57,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64418892] [2021-10-05 21:08:57,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64418892] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:08:57,092 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:08:57,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 21:08:57,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298200580] [2021-10-05 21:08:57,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 21:08:57,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:08:57,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 21:08:57,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-05 21:08:57,095 INFO L87 Difference]: Start difference. First operand 696 states and 1818 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:57,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:08:57,279 INFO L93 Difference]: Finished difference Result 668 states and 1616 transitions. [2021-10-05 21:08:57,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 21:08:57,279 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:08:57,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:08:57,284 INFO L225 Difference]: With dead ends: 668 [2021-10-05 21:08:57,284 INFO L226 Difference]: Without dead ends: 554 [2021-10-05 21:08:57,285 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 65.8ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:08:57,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2021-10-05 21:08:57,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 518. [2021-10-05 21:08:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 2.4352030947775627) internal successors, (1259), 517 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1259 transitions. [2021-10-05 21:08:57,305 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1259 transitions. Word has length 29 [2021-10-05 21:08:57,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:08:57,305 INFO L470 AbstractCegarLoop]: Abstraction has 518 states and 1259 transitions. [2021-10-05 21:08:57,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:57,306 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1259 transitions. [2021-10-05 21:08:57,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:08:57,308 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:08:57,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] [2021-10-05 21:08:57,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-05 21:08:57,309 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:08:57,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:08:57,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1428910720, now seen corresponding path program 6 times [2021-10-05 21:08:57,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:08:57,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059031010] [2021-10-05 21:08:57,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:08:57,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:08:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:08:57,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:08:57,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:08:57,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059031010] [2021-10-05 21:08:57,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059031010] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:08:57,450 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:08:57,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-05 21:08:57,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244191269] [2021-10-05 21:08:57,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-05 21:08:57,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:08:57,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-05 21:08:57,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-05 21:08:57,452 INFO L87 Difference]: Start difference. First operand 518 states and 1259 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:57,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:08:57,558 INFO L93 Difference]: Finished difference Result 386 states and 913 transitions. [2021-10-05 21:08:57,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-05 21:08:57,559 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:08:57,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:08:57,562 INFO L225 Difference]: With dead ends: 386 [2021-10-05 21:08:57,562 INFO L226 Difference]: Without dead ends: 386 [2021-10-05 21:08:57,563 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 48.6ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:08:57,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2021-10-05 21:08:57,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2021-10-05 21:08:57,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 2.3714285714285714) internal successors, (913), 385 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:57,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 913 transitions. [2021-10-05 21:08:57,577 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 913 transitions. Word has length 29 [2021-10-05 21:08:57,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:08:57,578 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 913 transitions. [2021-10-05 21:08:57,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:57,578 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 913 transitions. [2021-10-05 21:08:57,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:08:57,580 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:08:57,580 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:08:57,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-05 21:08:57,581 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:08:57,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:08:57,581 INFO L82 PathProgramCache]: Analyzing trace with hash -385049362, now seen corresponding path program 7 times [2021-10-05 21:08:57,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:08:57,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066873149] [2021-10-05 21:08:57,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:08:57,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:08:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:08:57,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:08:57,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:08:57,771 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066873149] [2021-10-05 21:08:57,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066873149] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:08:57,771 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:08:57,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-05 21:08:57,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441949961] [2021-10-05 21:08:57,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-05 21:08:57,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:08:57,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-05 21:08:57,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-05 21:08:57,773 INFO L87 Difference]: Start difference. First operand 386 states and 913 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:08:57,882 INFO L93 Difference]: Finished difference Result 394 states and 922 transitions. [2021-10-05 21:08:57,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-05 21:08:57,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:08:57,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:08:57,886 INFO L225 Difference]: With dead ends: 394 [2021-10-05 21:08:57,886 INFO L226 Difference]: Without dead ends: 362 [2021-10-05 21:08:57,887 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 52.0ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:08:57,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-10-05 21:08:57,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2021-10-05 21:08:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 2.329639889196676) internal successors, (841), 361 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:57,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 841 transitions. [2021-10-05 21:08:57,900 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 841 transitions. Word has length 29 [2021-10-05 21:08:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:08:57,900 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 841 transitions. [2021-10-05 21:08:57,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 841 transitions. [2021-10-05 21:08:57,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:08:57,902 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:08:57,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] [2021-10-05 21:08:57,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-05 21:08:57,903 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:08:57,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:08:57,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1214339244, now seen corresponding path program 8 times [2021-10-05 21:08:57,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:08:57,904 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846335802] [2021-10-05 21:08:57,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:08:57,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:08:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:08:58,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-05 21:08:58,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:08:58,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846335802] [2021-10-05 21:08:58,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846335802] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:08:58,095 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:08:58,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:08:58,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844342156] [2021-10-05 21:08:58,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:08:58,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:08:58,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:08:58,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:08:58,097 INFO L87 Difference]: Start difference. First operand 362 states and 841 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:58,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:08:58,362 INFO L93 Difference]: Finished difference Result 446 states and 1013 transitions. [2021-10-05 21:08:58,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:08:58,363 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:08:58,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:08:58,366 INFO L225 Difference]: With dead ends: 446 [2021-10-05 21:08:58,367 INFO L226 Difference]: Without dead ends: 422 [2021-10-05 21:08:58,367 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 107.7ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-10-05 21:08:58,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-10-05 21:08:58,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 366. [2021-10-05 21:08:58,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 2.317808219178082) internal successors, (846), 365 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:58,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 846 transitions. [2021-10-05 21:08:58,389 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 846 transitions. Word has length 29 [2021-10-05 21:08:58,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:08:58,389 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 846 transitions. [2021-10-05 21:08:58,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:58,390 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 846 transitions. [2021-10-05 21:08:58,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:08:58,391 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:08:58,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] [2021-10-05 21:08:58,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-05 21:08:58,392 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:08:58,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:08:58,393 INFO L82 PathProgramCache]: Analyzing trace with hash 798537964, now seen corresponding path program 9 times [2021-10-05 21:08:58,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:08:58,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713848731] [2021-10-05 21:08:58,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:08:58,394 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:08:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:08:58,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-05 21:08:58,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:08:58,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713848731] [2021-10-05 21:08:58,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713848731] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:08:58,575 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:08:58,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:08:58,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413091270] [2021-10-05 21:08:58,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:08:58,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:08:58,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:08:58,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:08:58,580 INFO L87 Difference]: Start difference. First operand 366 states and 846 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:58,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:08:58,794 INFO L93 Difference]: Finished difference Result 384 states and 877 transitions. [2021-10-05 21:08:58,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 21:08:58,795 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:08:58,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:08:58,797 INFO L225 Difference]: With dead ends: 384 [2021-10-05 21:08:58,797 INFO L226 Difference]: Without dead ends: 366 [2021-10-05 21:08:58,798 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 103.2ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-10-05 21:08:58,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-10-05 21:08:58,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 362. [2021-10-05 21:08:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 2.3185595567867034) internal successors, (837), 361 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:58,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 837 transitions. [2021-10-05 21:08:58,810 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 837 transitions. Word has length 29 [2021-10-05 21:08:58,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:08:58,810 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 837 transitions. [2021-10-05 21:08:58,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:58,811 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 837 transitions. [2021-10-05 21:08:58,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:08:58,812 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:08:58,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] [2021-10-05 21:08:58,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-05 21:08:58,812 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:08:58,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:08:58,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1931529602, now seen corresponding path program 10 times [2021-10-05 21:08:58,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:08:58,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712591620] [2021-10-05 21:08:58,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:08:58,814 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:08:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:08:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:08:58,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:08:58,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712591620] [2021-10-05 21:08:58,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712591620] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:08:58,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:08:58,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:08:58,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904113770] [2021-10-05 21:08:58,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:08:58,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:08:58,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:08:58,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:08:58,973 INFO L87 Difference]: Start difference. First operand 362 states and 837 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:08:59,149 INFO L93 Difference]: Finished difference Result 384 states and 872 transitions. [2021-10-05 21:08:59,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 21:08:59,150 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:08:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:08:59,153 INFO L225 Difference]: With dead ends: 384 [2021-10-05 21:08:59,154 INFO L226 Difference]: Without dead ends: 352 [2021-10-05 21:08:59,154 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 96.7ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-10-05 21:08:59,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-10-05 21:08:59,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 350. [2021-10-05 21:08:59,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 2.297994269340974) internal successors, (802), 349 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-05 21:08:59,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 802 transitions. [2021-10-05 21:08:59,169 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 802 transitions. Word has length 29 [2021-10-05 21:08:59,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:08:59,170 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 802 transitions. [2021-10-05 21:08:59,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:59,171 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 802 transitions. [2021-10-05 21:08:59,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:08:59,175 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:08:59,175 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:08:59,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-05 21:08:59,176 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:08:59,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:08:59,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2043073786, now seen corresponding path program 11 times [2021-10-05 21:08:59,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:08:59,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162127996] [2021-10-05 21:08:59,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:08:59,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:08:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:08:59,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:08:59,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:08:59,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162127996] [2021-10-05 21:08:59,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162127996] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:08:59,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:08:59,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:08:59,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44222407] [2021-10-05 21:08:59,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:08:59,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:08:59,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:08:59,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:08:59,408 INFO L87 Difference]: Start difference. First operand 350 states and 802 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:59,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:08:59,640 INFO L93 Difference]: Finished difference Result 406 states and 913 transitions. [2021-10-05 21:08:59,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:08:59,640 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:08:59,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:08:59,643 INFO L225 Difference]: With dead ends: 406 [2021-10-05 21:08:59,643 INFO L226 Difference]: Without dead ends: 382 [2021-10-05 21:08:59,644 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 118.9ms TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:08:59,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-10-05 21:08:59,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 350. [2021-10-05 21:08:59,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 2.286532951289398) internal successors, (798), 349 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-05 21:08:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 798 transitions. [2021-10-05 21:08:59,658 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 798 transitions. Word has length 29 [2021-10-05 21:08:59,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:08:59,658 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 798 transitions. [2021-10-05 21:08:59,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:08:59,659 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 798 transitions. [2021-10-05 21:08:59,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:08:59,660 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:08:59,660 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:08:59,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-05 21:08:59,661 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:08:59,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:08:59,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1836092230, now seen corresponding path program 12 times [2021-10-05 21:08:59,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:08:59,662 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386290460] [2021-10-05 21:08:59,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:08:59,662 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:08:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:08:59,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:08:59,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:08:59,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386290460] [2021-10-05 21:08:59,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386290460] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:08:59,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:08:59,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:08:59,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768129117] [2021-10-05 21:08:59,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:08:59,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:08:59,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:08:59,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:08:59,828 INFO L87 Difference]: Start difference. First operand 350 states and 798 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:00,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:00,114 INFO L93 Difference]: Finished difference Result 396 states and 889 transitions. [2021-10-05 21:09:00,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:09:00,115 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:09:00,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:00,118 INFO L225 Difference]: With dead ends: 396 [2021-10-05 21:09:00,118 INFO L226 Difference]: Without dead ends: 378 [2021-10-05 21:09:00,119 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 138.1ms TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:09:00,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-10-05 21:09:00,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 346. [2021-10-05 21:09:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 2.2869565217391306) internal successors, (789), 345 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 789 transitions. [2021-10-05 21:09:00,132 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 789 transitions. Word has length 29 [2021-10-05 21:09:00,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:00,133 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 789 transitions. [2021-10-05 21:09:00,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:00,133 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 789 transitions. [2021-10-05 21:09:00,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:09:00,134 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:00,135 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:00,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-05 21:09:00,135 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:09:00,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:00,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1280071376, now seen corresponding path program 13 times [2021-10-05 21:09:00,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:00,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057862469] [2021-10-05 21:09:00,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:00,136 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:00,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:00,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:00,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057862469] [2021-10-05 21:09:00,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057862469] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:00,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:00,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:09:00,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006271877] [2021-10-05 21:09:00,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:09:00,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:00,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:09:00,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:09:00,340 INFO L87 Difference]: Start difference. First operand 346 states and 789 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:00,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:00,562 INFO L93 Difference]: Finished difference Result 386 states and 869 transitions. [2021-10-05 21:09:00,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 21:09:00,563 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:09:00,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:00,566 INFO L225 Difference]: With dead ends: 386 [2021-10-05 21:09:00,566 INFO L226 Difference]: Without dead ends: 362 [2021-10-05 21:09:00,567 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 100.7ms TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-10-05 21:09:00,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-10-05 21:09:00,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 334. [2021-10-05 21:09:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 2.2882882882882885) internal successors, (762), 333 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 762 transitions. [2021-10-05 21:09:00,580 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 762 transitions. Word has length 29 [2021-10-05 21:09:00,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:00,580 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 762 transitions. [2021-10-05 21:09:00,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:00,581 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 762 transitions. [2021-10-05 21:09:00,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:09:00,582 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:00,583 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:00,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-05 21:09:00,583 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:09:00,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:00,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1234713778, now seen corresponding path program 14 times [2021-10-05 21:09:00,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:00,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609739671] [2021-10-05 21:09:00,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:00,585 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:00,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-05 21:09:00,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:00,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609739671] [2021-10-05 21:09:00,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609739671] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:00,756 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:00,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:09:00,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755455529] [2021-10-05 21:09:00,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:09:00,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:00,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:09:00,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:09:00,758 INFO L87 Difference]: Start difference. First operand 334 states and 762 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:00,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:00,984 INFO L93 Difference]: Finished difference Result 240 states and 491 transitions. [2021-10-05 21:09:00,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:09:00,984 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:09:00,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:00,986 INFO L225 Difference]: With dead ends: 240 [2021-10-05 21:09:00,986 INFO L226 Difference]: Without dead ends: 194 [2021-10-05 21:09:00,987 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 102.3ms TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-10-05 21:09:00,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-10-05 21:09:00,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 170. [2021-10-05 21:09:00,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 2.0177514792899407) internal successors, (341), 169 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:00,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 341 transitions. [2021-10-05 21:09:00,994 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 341 transitions. Word has length 29 [2021-10-05 21:09:00,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:00,994 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 341 transitions. [2021-10-05 21:09:00,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:00,995 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 341 transitions. [2021-10-05 21:09:00,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:09:00,996 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:00,996 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:00,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-05 21:09:00,996 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:09:00,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:00,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1494680976, now seen corresponding path program 15 times [2021-10-05 21:09:00,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:00,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926416417] [2021-10-05 21:09:00,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:00,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:01,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:01,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926416417] [2021-10-05 21:09:01,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926416417] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:01,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:01,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:01,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404042984] [2021-10-05 21:09:01,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:01,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:01,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:01,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:01,138 INFO L87 Difference]: Start difference. First operand 170 states and 341 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:01,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:01,427 INFO L93 Difference]: Finished difference Result 212 states and 424 transitions. [2021-10-05 21:09:01,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:09:01,428 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:09:01,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:01,429 INFO L225 Difference]: With dead ends: 212 [2021-10-05 21:09:01,429 INFO L226 Difference]: Without dead ends: 192 [2021-10-05 21:09:01,431 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 150.0ms TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:09:01,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-10-05 21:09:01,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 166. [2021-10-05 21:09:01,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 2.012121212121212) internal successors, (332), 165 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:01,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 332 transitions. [2021-10-05 21:09:01,439 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 332 transitions. Word has length 29 [2021-10-05 21:09:01,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:01,439 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 332 transitions. [2021-10-05 21:09:01,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:01,440 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 332 transitions. [2021-10-05 21:09:01,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:09:01,441 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:01,441 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:01,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-05 21:09:01,441 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:09:01,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:01,442 INFO L82 PathProgramCache]: Analyzing trace with hash -562881018, now seen corresponding path program 16 times [2021-10-05 21:09:01,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:01,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901750990] [2021-10-05 21:09:01,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:01,443 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:01,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:01,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901750990] [2021-10-05 21:09:01,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901750990] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:01,611 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:01,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:01,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935770090] [2021-10-05 21:09:01,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:01,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:01,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:01,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:01,613 INFO L87 Difference]: Start difference. First operand 166 states and 332 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:01,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:01,812 INFO L93 Difference]: Finished difference Result 178 states and 350 transitions. [2021-10-05 21:09:01,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:09:01,815 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:09:01,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:01,817 INFO L225 Difference]: With dead ends: 178 [2021-10-05 21:09:01,817 INFO L226 Difference]: Without dead ends: 162 [2021-10-05 21:09:01,817 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 117.9ms TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:09:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-10-05 21:09:01,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2021-10-05 21:09:01,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.9937106918238994) internal successors, (317), 159 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 317 transitions. [2021-10-05 21:09:01,823 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 317 transitions. Word has length 29 [2021-10-05 21:09:01,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:01,823 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 317 transitions. [2021-10-05 21:09:01,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:01,824 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 317 transitions. [2021-10-05 21:09:01,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:09:01,824 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09: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] [2021-10-05 21:09:01,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-05 21:09:01,825 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:09:01,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:01,825 INFO L82 PathProgramCache]: Analyzing trace with hash -731678566, now seen corresponding path program 17 times [2021-10-05 21:09:01,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:01,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559980114] [2021-10-05 21:09:01,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:01,826 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:01,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:01,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559980114] [2021-10-05 21:09:01,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559980114] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:01,948 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:01,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:01,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993241577] [2021-10-05 21:09:01,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:01,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:01,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:01,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:01,950 INFO L87 Difference]: Start difference. First operand 160 states and 317 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:02,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:02,218 INFO L93 Difference]: Finished difference Result 140 states and 267 transitions. [2021-10-05 21:09:02,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:09:02,219 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:09:02,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:02,220 INFO L225 Difference]: With dead ends: 140 [2021-10-05 21:09:02,220 INFO L226 Difference]: Without dead ends: 98 [2021-10-05 21:09:02,220 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 127.2ms TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:09:02,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-10-05 21:09:02,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-10-05 21:09:02,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.9690721649484537) internal successors, (191), 97 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:02,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 191 transitions. [2021-10-05 21:09:02,225 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 191 transitions. Word has length 29 [2021-10-05 21:09:02,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:02,225 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 191 transitions. [2021-10-05 21:09:02,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:02,226 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 191 transitions. [2021-10-05 21:09:02,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:09:02,226 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:02,226 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:02,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-05 21:09:02,227 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:09:02,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:02,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1744562616, now seen corresponding path program 18 times [2021-10-05 21:09:02,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:02,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317775462] [2021-10-05 21:09:02,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:02,228 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:02,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:02,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317775462] [2021-10-05 21:09:02,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317775462] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:02,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:02,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:02,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912454657] [2021-10-05 21:09:02,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:02,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:02,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:02,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:02,362 INFO L87 Difference]: Start difference. First operand 98 states and 191 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:02,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:02,530 INFO L93 Difference]: Finished difference Result 110 states and 209 transitions. [2021-10-05 21:09:02,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 21:09:02,531 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:09:02,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:02,532 INFO L225 Difference]: With dead ends: 110 [2021-10-05 21:09:02,532 INFO L226 Difference]: Without dead ends: 94 [2021-10-05 21:09:02,532 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 104.3ms TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2021-10-05 21:09:02,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-10-05 21:09:02,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2021-10-05 21:09:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.934065934065934) internal successors, (176), 91 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 176 transitions. [2021-10-05 21:09:02,537 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 176 transitions. Word has length 29 [2021-10-05 21:09:02,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:02,538 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 176 transitions. [2021-10-05 21:09:02,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 176 transitions. [2021-10-05 21:09:02,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:09:02,539 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09: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] [2021-10-05 21:09:02,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-05 21:09:02,540 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:09:02,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:02,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1473317076, now seen corresponding path program 19 times [2021-10-05 21:09:02,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:02,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491931478] [2021-10-05 21:09:02,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:02,541 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:02,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:02,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:02,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491931478] [2021-10-05 21:09:02,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491931478] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:02,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:02,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:09:02,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698642553] [2021-10-05 21:09:02,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:09:02,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:02,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:09:02,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:09:02,703 INFO L87 Difference]: Start difference. First operand 92 states and 176 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:02,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:02,915 INFO L93 Difference]: Finished difference Result 164 states and 326 transitions. [2021-10-05 21:09:02,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:09:02,916 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:09:02,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:02,917 INFO L225 Difference]: With dead ends: 164 [2021-10-05 21:09:02,917 INFO L226 Difference]: Without dead ends: 152 [2021-10-05 21:09:02,918 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 116.5ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-10-05 21:09:02,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-10-05 21:09:02,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 94. [2021-10-05 21:09:02,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.924731182795699) internal successors, (179), 93 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:02,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 179 transitions. [2021-10-05 21:09:02,923 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 179 transitions. Word has length 29 [2021-10-05 21:09:02,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:02,923 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 179 transitions. [2021-10-05 21:09:02,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:02,923 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 179 transitions. [2021-10-05 21:09:02,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:09:02,924 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:02,924 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:02,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-05 21:09:02,925 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:09:02,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:02,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1118766604, now seen corresponding path program 20 times [2021-10-05 21:09:02,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:02,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163523120] [2021-10-05 21:09:02,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:02,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:03,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:03,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163523120] [2021-10-05 21:09:03,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163523120] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:03,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:03,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:03,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066245727] [2021-10-05 21:09:03,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:03,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:03,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:03,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:03,075 INFO L87 Difference]: Start difference. First operand 94 states and 179 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:03,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:03,323 INFO L93 Difference]: Finished difference Result 162 states and 319 transitions. [2021-10-05 21:09:03,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:09:03,324 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:09:03,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:03,326 INFO L225 Difference]: With dead ends: 162 [2021-10-05 21:09:03,326 INFO L226 Difference]: Without dead ends: 144 [2021-10-05 21:09:03,326 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 160.5ms TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:09:03,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-10-05 21:09:03,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 86. [2021-10-05 21:09:03,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.8941176470588235) internal successors, (161), 85 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 161 transitions. [2021-10-05 21:09:03,330 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 161 transitions. Word has length 29 [2021-10-05 21:09:03,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:03,330 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 161 transitions. [2021-10-05 21:09:03,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:03,331 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 161 transitions. [2021-10-05 21:09:03,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:09:03,331 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:03,331 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:03,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-05 21:09:03,332 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:09:03,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:03,332 INFO L82 PathProgramCache]: Analyzing trace with hash 2076271824, now seen corresponding path program 21 times [2021-10-05 21:09:03,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:03,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107275991] [2021-10-05 21:09:03,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:03,333 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:03,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:03,469 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107275991] [2021-10-05 21:09:03,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107275991] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:03,469 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:03,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:03,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359000278] [2021-10-05 21:09:03,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:03,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:03,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:03,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:03,471 INFO L87 Difference]: Start difference. First operand 86 states and 161 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:03,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:03,691 INFO L93 Difference]: Finished difference Result 120 states and 222 transitions. [2021-10-05 21:09:03,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:09:03,692 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:09:03,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:03,693 INFO L225 Difference]: With dead ends: 120 [2021-10-05 21:09:03,693 INFO L226 Difference]: Without dead ends: 80 [2021-10-05 21:09:03,694 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 140.8ms TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:09:03,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-10-05 21:09:03,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-10-05 21:09:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.8481012658227849) internal successors, (146), 79 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:03,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 146 transitions. [2021-10-05 21:09:03,697 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 146 transitions. Word has length 29 [2021-10-05 21:09:03,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:03,697 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 146 transitions. [2021-10-05 21:09:03,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:03,698 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 146 transitions. [2021-10-05 21:09:03,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:09:03,698 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:03,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] [2021-10-05 21:09:03,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-05 21:09:03,699 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:09:03,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:03,700 INFO L82 PathProgramCache]: Analyzing trace with hash -247382232, now seen corresponding path program 22 times [2021-10-05 21:09:03,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:03,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501347890] [2021-10-05 21:09:03,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:03,700 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:03,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:03,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501347890] [2021-10-05 21:09:03,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501347890] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:03,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:03,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:09:03,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281276527] [2021-10-05 21:09:03,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:09:03,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:03,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:09:03,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:09:03,818 INFO L87 Difference]: Start difference. First operand 80 states and 146 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:03,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:03,959 INFO L93 Difference]: Finished difference Result 122 states and 231 transitions. [2021-10-05 21:09:03,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 21:09:03,961 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:09:03,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:03,962 INFO L225 Difference]: With dead ends: 122 [2021-10-05 21:09:03,962 INFO L226 Difference]: Without dead ends: 110 [2021-10-05 21:09:03,962 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 83.3ms TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-10-05 21:09:03,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-10-05 21:09:03,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2021-10-05 21:09:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.8227848101265822) internal successors, (144), 79 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 144 transitions. [2021-10-05 21:09:03,967 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 144 transitions. Word has length 29 [2021-10-05 21:09:03,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:03,967 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 144 transitions. [2021-10-05 21:09:03,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:03,968 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 144 transitions. [2021-10-05 21:09:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:09:03,969 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:03,969 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:03,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-05 21:09:03,970 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:09:03,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:03,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1455501384, now seen corresponding path program 23 times [2021-10-05 21:09:03,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:03,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325345525] [2021-10-05 21:09:03,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:03,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:04,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:04,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:04,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325345525] [2021-10-05 21:09:04,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325345525] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:04,139 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:04,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:04,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544565791] [2021-10-05 21:09:04,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:04,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:04,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:04,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:04,141 INFO L87 Difference]: Start difference. First operand 80 states and 144 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:04,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:04,313 INFO L93 Difference]: Finished difference Result 120 states and 224 transitions. [2021-10-05 21:09:04,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 21:09:04,314 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:09:04,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:04,315 INFO L225 Difference]: With dead ends: 120 [2021-10-05 21:09:04,315 INFO L226 Difference]: Without dead ends: 108 [2021-10-05 21:09:04,316 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 94.0ms TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:09:04,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-10-05 21:09:04,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 78. [2021-10-05 21:09:04,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.8051948051948052) internal successors, (139), 77 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:04,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 139 transitions. [2021-10-05 21:09:04,320 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 139 transitions. Word has length 29 [2021-10-05 21:09:04,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:04,321 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 139 transitions. [2021-10-05 21:09:04,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:04,321 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 139 transitions. [2021-10-05 21:09:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:09:04,322 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:04,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] [2021-10-05 21:09:04,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-05 21:09:04,322 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:09:04,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:04,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1343410852, now seen corresponding path program 24 times [2021-10-05 21:09:04,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:04,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054107373] [2021-10-05 21:09:04,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:04,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:04,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:04,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054107373] [2021-10-05 21:09:04,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054107373] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:04,456 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:04,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:09:04,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413049233] [2021-10-05 21:09:04,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:09:04,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:04,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:09:04,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:09:04,458 INFO L87 Difference]: Start difference. First operand 78 states and 139 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:04,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:04,580 INFO L93 Difference]: Finished difference Result 116 states and 216 transitions. [2021-10-05 21:09:04,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 21:09:04,581 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:09:04,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:04,582 INFO L225 Difference]: With dead ends: 116 [2021-10-05 21:09:04,582 INFO L226 Difference]: Without dead ends: 104 [2021-10-05 21:09:04,583 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 70.4ms TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-10-05 21:09:04,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-10-05 21:09:04,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 74. [2021-10-05 21:09:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.7671232876712328) internal successors, (129), 73 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 129 transitions. [2021-10-05 21:09:04,586 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 129 transitions. Word has length 29 [2021-10-05 21:09:04,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:04,586 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 129 transitions. [2021-10-05 21:09:04,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:04,586 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 129 transitions. [2021-10-05 21:09:04,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:09:04,587 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:04,587 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:04,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-05 21:09:04,588 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:09:04,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:04,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1019400392, now seen corresponding path program 25 times [2021-10-05 21:09:04,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:04,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561329532] [2021-10-05 21:09:04,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:04,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:04,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:04,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:04,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561329532] [2021-10-05 21:09:04,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561329532] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:04,722 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:04,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:09:04,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686307547] [2021-10-05 21:09:04,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:09:04,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:04,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:09:04,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:09:04,725 INFO L87 Difference]: Start difference. First operand 74 states and 129 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:04,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:04,870 INFO L93 Difference]: Finished difference Result 116 states and 214 transitions. [2021-10-05 21:09:04,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 21:09:04,871 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:09:04,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:04,872 INFO L225 Difference]: With dead ends: 116 [2021-10-05 21:09:04,872 INFO L226 Difference]: Without dead ends: 96 [2021-10-05 21:09:04,872 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 74.9ms TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-10-05 21:09:04,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-10-05 21:09:04,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 72. [2021-10-05 21:09:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.7464788732394365) internal successors, (124), 71 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 124 transitions. [2021-10-05 21:09:04,877 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 124 transitions. Word has length 29 [2021-10-05 21:09:04,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:04,877 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 124 transitions. [2021-10-05 21:09:04,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:04,878 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 124 transitions. [2021-10-05 21:09:04,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:09:04,879 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:04,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] [2021-10-05 21:09:04,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-05 21:09:04,880 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:09:04,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:04,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1111716, now seen corresponding path program 26 times [2021-10-05 21:09:04,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:04,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20251855] [2021-10-05 21:09:04,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:04,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:05,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:05,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20251855] [2021-10-05 21:09:05,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20251855] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:05,076 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:05,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:05,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275147479] [2021-10-05 21:09:05,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:05,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:05,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:05,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:05,082 INFO L87 Difference]: Start difference. First operand 72 states and 124 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:05,188 INFO L93 Difference]: Finished difference Result 38 states and 62 transitions. [2021-10-05 21:09:05,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 21:09:05,189 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 21:09:05,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:05,190 INFO L225 Difference]: With dead ends: 38 [2021-10-05 21:09:05,190 INFO L226 Difference]: Without dead ends: 0 [2021-10-05 21:09:05,190 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 85.6ms TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-10-05 21:09:05,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-05 21:09:05,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-05 21:09:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-05 21:09:05,192 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2021-10-05 21:09:05,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:05,192 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-05 21:09:05,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:05,192 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-05 21:09:05,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-05 21:09:05,197 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-05 21:09:05,198 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-05 21:09:05,199 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-05 21:09:05,201 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-05 21:09:05,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-05 21:09:05,206 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-05 21:09:05,207 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-05 21:09:05,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 09:09:05 BasicIcfg [2021-10-05 21:09:05,211 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-05 21:09:05,212 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-05 21:09:05,212 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-05 21:09:05,212 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-05 21:09:05,213 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 09:08:47" (3/4) ... [2021-10-05 21:09:05,217 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-05 21:09:05,225 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-10-05 21:09:05,225 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-10-05 21:09:05,226 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-10-05 21:09:05,235 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2021-10-05 21:09:05,236 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-05 21:09:05,236 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-05 21:09:05,236 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-05 21:09:05,293 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-05 21:09:05,294 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-05 21:09:05,296 INFO L168 Benchmark]: Toolchain (without parser) took 19160.23 ms. Allocated memory was 62.9 MB in the beginning and 115.3 MB in the end (delta: 52.4 MB). Free memory was 38.9 MB in the beginning and 40.4 MB in the end (delta: -1.5 MB). Peak memory consumption was 54.0 MB. Max. memory is 16.1 GB. [2021-10-05 21:09:05,297 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 41.9 MB. Free memory was 19.1 MB in the beginning and 19.1 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-05 21:09:05,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.25 ms. Allocated memory is still 62.9 MB. Free memory was 38.6 MB in the beginning and 43.4 MB in the end (delta: -4.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 16.1 GB. [2021-10-05 21:09:05,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.75 ms. Allocated memory is still 62.9 MB. Free memory was 43.4 MB in the beginning and 41.5 MB in the end (delta: 1.9 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-05 21:09:05,299 INFO L168 Benchmark]: Boogie Preprocessor took 68.82 ms. Allocated memory is still 62.9 MB. Free memory was 41.5 MB in the beginning and 40.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-05 21:09:05,299 INFO L168 Benchmark]: RCFGBuilder took 643.17 ms. Allocated memory is still 62.9 MB. Free memory was 40.2 MB in the beginning and 40.7 MB in the end (delta: -423.1 kB). Peak memory consumption was 12.3 MB. Max. memory is 16.1 GB. [2021-10-05 21:09:05,300 INFO L168 Benchmark]: TraceAbstraction took 17878.74 ms. Allocated memory was 62.9 MB in the beginning and 115.3 MB in the end (delta: 52.4 MB). Free memory was 40.1 MB in the beginning and 44.6 MB in the end (delta: -4.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 16.1 GB. [2021-10-05 21:09:05,300 INFO L168 Benchmark]: Witness Printer took 81.85 ms. Allocated memory is still 115.3 MB. Free memory was 43.5 MB in the beginning and 40.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-05 21:09:05,303 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.55 ms. Allocated memory is still 41.9 MB. Free memory was 19.1 MB in the beginning and 19.1 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 373.25 ms. Allocated memory is still 62.9 MB. Free memory was 38.6 MB in the beginning and 43.4 MB in the end (delta: -4.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 88.75 ms. Allocated memory is still 62.9 MB. Free memory was 43.4 MB in the beginning and 41.5 MB in the end (delta: 1.9 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 68.82 ms. Allocated memory is still 62.9 MB. Free memory was 41.5 MB in the beginning and 40.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 643.17 ms. Allocated memory is still 62.9 MB. Free memory was 40.2 MB in the beginning and 40.7 MB in the end (delta: -423.1 kB). Peak memory consumption was 12.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17878.74 ms. Allocated memory was 62.9 MB in the beginning and 115.3 MB in the end (delta: 52.4 MB). Free memory was 40.1 MB in the beginning and 44.6 MB in the end (delta: -4.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 16.1 GB. * Witness Printer took 81.85 ms. Allocated memory is still 115.3 MB. Free memory was 43.5 MB in the beginning and 40.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5572.3ms, 134 PlacesBefore, 43 PlacesAfterwards, 129 TransitionsBefore, 36 TransitionsAfterwards, 2032 CoEnabledTransitionPairs, 7 FixpointIterations, 61 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 119 TotalNumberOfCompositions, 6175 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2958, positive: 2770, positive conditional: 0, positive unconditional: 2770, negative: 188, negative conditional: 0, negative unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1567, positive: 1520, positive conditional: 0, positive unconditional: 1520, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1567, positive: 1462, positive conditional: 0, positive unconditional: 1462, negative: 105, negative conditional: 0, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 105, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 168, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 117, negative conditional: 0, negative unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2958, positive: 1250, positive conditional: 0, positive unconditional: 1250, negative: 141, negative conditional: 0, negative unconditional: 141, unknown: 1567, unknown conditional: 0, unknown unconditional: 1567] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 143, Positive conditional cache size: 0, Positive unconditional cache size: 143, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - 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: 104]: 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 7 procedures, 168 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 17579.9ms, OverallIterations: 27, TraceHistogramMax: 1, EmptinessCheckTime: 80.1ms, AutomataDifference: 6010.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5705.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 923 SDtfs, 1393 SDslu, 3746 SDs, 0 SdLazy, 4883 SolverSat, 337 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2978.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 2849.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=696occurred in iteration=5, InterpolantAutomatonStates: 298, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 501.7ms AutomataMinimizationTime, 27 MinimizatonAttempts, 912 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 97.5ms SsaConstructionTime, 1157.3ms SatisfiabilityAnalysisTime, 3551.9ms InterpolantComputationTime, 770 NumberOfCodeBlocks, 770 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 743 ConstructedInterpolants, 0 QuantifiedInterpolants, 3717 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-05 21:09:05,374 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...