./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-2_1-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-2_1-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 081154e787322e3b9ad682661fd03964eab6d0d9 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 14:43:29,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 14:43:29,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 14:43:29,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 14:43:29,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 14:43:29,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 14:43:29,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 14:43:29,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 14:43:29,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 14:43:29,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 14:43:29,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 14:43:29,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 14:43:29,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 14:43:29,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 14:43:29,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 14:43:29,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 14:43:29,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 14:43:29,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 14:43:29,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 14:43:29,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 14:43:29,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 14:43:29,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 14:43:29,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 14:43:29,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 14:43:29,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 14:43:29,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 14:43:29,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 14:43:29,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 14:43:29,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 14:43:29,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 14:43:29,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 14:43:29,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 14:43:29,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 14:43:29,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 14:43:29,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 14:43:29,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 14:43:29,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 14:43:29,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 14:43:29,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 14:43:29,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 14:43:29,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 14:43:29,411 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 14:43:29,446 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 14:43:29,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 14:43:29,448 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 14:43:29,448 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 14:43:29,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 14:43:29,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 14:43:29,450 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 14:43:29,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 14:43:29,451 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 14:43:29,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 14:43:29,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 14:43:29,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 14:43:29,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 14:43:29,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 14:43:29,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 14:43:29,452 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 14:43:29,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 14:43:29,453 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 14:43:29,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 14:43:29,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 14:43:29,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 14:43:29,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 14:43:29,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 14:43:29,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 14:43:29,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 14:43:29,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 14:43:29,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 14:43:29,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 14:43:29,455 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 14:43:29,455 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 14:43:29,455 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 081154e787322e3b9ad682661fd03964eab6d0d9 [2021-08-26 14:43:29,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 14:43:29,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 14:43:29,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 14:43:29,777 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 14:43:29,777 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 14:43:29,778 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2021-08-26 14:43:29,864 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bebd9c6e/e1879c277ee8498583622ec39cb88807/FLAG69427e595 [2021-08-26 14:43:30,484 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 14:43:30,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2021-08-26 14:43:30,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bebd9c6e/e1879c277ee8498583622ec39cb88807/FLAG69427e595 [2021-08-26 14:43:30,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bebd9c6e/e1879c277ee8498583622ec39cb88807 [2021-08-26 14:43:30,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 14:43:30,829 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 14:43:30,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 14:43:30,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 14:43:30,835 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 14:43:30,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:43:30" (1/1) ... [2021-08-26 14:43:30,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65be7b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:30, skipping insertion in model container [2021-08-26 14:43:30,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:43:30" (1/1) ... [2021-08-26 14:43:30,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 14:43:30,900 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 14:43:31,642 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i[76077,76090] [2021-08-26 14:43:31,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 14:43:31,691 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 14:43:31,735 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i[76077,76090] [2021-08-26 14:43:31,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 14:43:31,873 INFO L208 MainTranslator]: Completed translation [2021-08-26 14:43:31,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:31 WrapperNode [2021-08-26 14:43:31,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 14:43:31,876 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 14:43:31,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 14:43:31,877 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 14:43:31,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:31" (1/1) ... [2021-08-26 14:43:31,933 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:31" (1/1) ... [2021-08-26 14:43:31,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 14:43:31,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 14:43:31,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 14:43:31,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 14:43:31,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:31" (1/1) ... [2021-08-26 14:43:31,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:31" (1/1) ... [2021-08-26 14:43:32,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:31" (1/1) ... [2021-08-26 14:43:32,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:31" (1/1) ... [2021-08-26 14:43:32,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:31" (1/1) ... [2021-08-26 14:43:32,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:31" (1/1) ... [2021-08-26 14:43:32,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:31" (1/1) ... [2021-08-26 14:43:32,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 14:43:32,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 14:43:32,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 14:43:32,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 14:43:32,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:31" (1/1) ... [2021-08-26 14:43:32,058 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 14:43:32,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 14:43:32,086 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 14:43:32,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 14:43:32,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 14:43:32,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-26 14:43:32,134 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-08-26 14:43:32,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-26 14:43:32,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 14:43:32,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 14:43:32,134 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-08-26 14:43:32,134 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-08-26 14:43:32,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 14:43:32,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-26 14:43:32,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 14:43:32,136 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-26 14:43:32,831 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 14:43:32,831 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-08-26 14:43:32,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:43:32 BoogieIcfgContainer [2021-08-26 14:43:32,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 14:43:32,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 14:43:32,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 14:43:32,838 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 14:43:32,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 02:43:30" (1/3) ... [2021-08-26 14:43:32,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd820d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:43:32, skipping insertion in model container [2021-08-26 14:43:32,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:31" (2/3) ... [2021-08-26 14:43:32,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd820d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:43:32, skipping insertion in model container [2021-08-26 14:43:32,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:43:32" (3/3) ... [2021-08-26 14:43:32,840 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2021-08-26 14:43:32,844 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-26 14:43:32,845 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 14:43:32,845 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-08-26 14:43:32,845 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-26 14:43:32,879 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,880 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,880 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,880 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,881 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,881 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,881 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,881 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,881 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,881 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,884 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,884 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,884 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,884 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,884 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,884 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,885 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,885 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,885 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,885 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,885 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,885 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,886 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,886 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,886 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,886 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,886 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,886 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,887 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,887 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,887 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,887 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,887 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,887 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,888 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,888 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,888 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,888 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,891 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,891 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,891 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,892 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,892 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,892 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,892 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,892 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,892 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,892 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,892 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,893 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,893 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,893 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,894 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,894 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,894 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,894 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,894 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,894 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,895 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,895 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,895 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,895 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,895 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,896 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,896 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,896 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,896 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,896 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,896 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,897 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,897 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,897 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,897 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,897 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,897 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,898 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,898 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,898 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,898 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,898 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,899 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,899 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,899 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,899 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,899 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,899 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,900 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,900 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,900 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,900 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,900 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,900 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,901 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,901 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,901 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,901 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,901 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,901 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,902 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,902 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,902 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,902 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,902 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,902 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,903 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,903 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,903 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,903 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,903 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,904 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,904 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,904 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,904 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,904 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,904 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,905 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,905 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,905 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,905 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,905 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,906 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,906 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,906 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,906 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,906 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,906 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,907 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,907 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,907 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,909 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,910 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,910 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,910 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,910 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,911 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,911 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,911 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,911 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,911 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,911 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,912 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,917 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,917 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,917 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,917 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,918 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,918 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,918 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,918 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,918 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,919 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,919 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,919 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:32,927 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-08-26 14:43:32,973 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 14:43:32,979 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-08-26 14:43:32,979 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-08-26 14:43:32,991 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-08-26 14:43:32,999 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 169 transitions, 354 flow [2021-08-26 14:43:33,001 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 169 transitions, 354 flow [2021-08-26 14:43:33,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 167 places, 169 transitions, 354 flow [2021-08-26 14:43:33,050 INFO L129 PetriNetUnfolder]: 10/205 cut-off events. [2021-08-26 14:43:33,051 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-08-26 14:43:33,055 INFO L84 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 205 events. 10/205 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 360 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 120. Up to 4 conditions per place. [2021-08-26 14:43:33,058 INFO L116 LiptonReduction]: Number of co-enabled transitions 2996 [2021-08-26 14:44:22,134 INFO L131 LiptonReduction]: Checked pairs total: 6296 [2021-08-26 14:44:22,134 INFO L133 LiptonReduction]: Total number of compositions: 191 [2021-08-26 14:44:22,140 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 35 transitions, 86 flow [2021-08-26 14:44:22,168 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 368 states, 358 states have (on average 2.5083798882681565) internal successors, (898), 367 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand has 368 states, 358 states have (on average 2.5083798882681565) internal successors, (898), 367 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:22,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-08-26 14:44:22,174 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:22,175 INFO L512 BasicCegarLoop]: trace histogram [1] [2021-08-26 14:44:22,175 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:22,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:22,179 INFO L82 PathProgramCache]: Analyzing trace with hash 612, now seen corresponding path program 1 times [2021-08-26 14:44:22,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:22,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225424847] [2021-08-26 14:44:22,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:22,187 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:22,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:22,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225424847] [2021-08-26 14:44:22,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225424847] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:22,423 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:22,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2021-08-26 14:44:22,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676927909] [2021-08-26 14:44:22,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 14:44:22,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:22,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 14:44:22,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 14:44:22,446 INFO L87 Difference]: Start difference. First operand has 368 states, 358 states have (on average 2.5083798882681565) internal successors, (898), 367 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:22,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:22,481 INFO L93 Difference]: Finished difference Result 366 states and 896 transitions. [2021-08-26 14:44:22,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 14:44:22,482 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2021-08-26 14:44:22,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:22,499 INFO L225 Difference]: With dead ends: 366 [2021-08-26 14:44:22,499 INFO L226 Difference]: Without dead ends: 329 [2021-08-26 14:44:22,500 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 14:44:22,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-08-26 14:44:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2021-08-26 14:44:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 323 states have (on average 2.473684210526316) internal successors, (799), 328 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 799 transitions. [2021-08-26 14:44:22,555 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 799 transitions. Word has length 1 [2021-08-26 14:44:22,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:22,555 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 799 transitions. [2021-08-26 14:44:22,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:22,555 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 799 transitions. [2021-08-26 14:44:22,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-08-26 14:44:22,556 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:22,556 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-08-26 14:44:22,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 14:44:22,557 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:22,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:22,558 INFO L82 PathProgramCache]: Analyzing trace with hash 583278121, now seen corresponding path program 1 times [2021-08-26 14:44:22,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:22,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203471257] [2021-08-26 14:44:22,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:22,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:22,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:22,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203471257] [2021-08-26 14:44:22,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203471257] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:22,725 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:22,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:44:22,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347991697] [2021-08-26 14:44:22,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:44:22,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:22,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:44:22,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:44:22,736 INFO L87 Difference]: Start difference. First operand 329 states and 799 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:22,871 INFO L93 Difference]: Finished difference Result 484 states and 1174 transitions. [2021-08-26 14:44:22,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:44:22,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-08-26 14:44:22,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:22,876 INFO L225 Difference]: With dead ends: 484 [2021-08-26 14:44:22,876 INFO L226 Difference]: Without dead ends: 484 [2021-08-26 14:44:22,876 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:44:22,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-08-26 14:44:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 420. [2021-08-26 14:44:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 2.5012048192771084) internal successors, (1038), 419 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:22,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1038 transitions. [2021-08-26 14:44:22,920 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1038 transitions. Word has length 5 [2021-08-26 14:44:22,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:22,920 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 1038 transitions. [2021-08-26 14:44:22,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:22,920 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1038 transitions. [2021-08-26 14:44:22,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-08-26 14:44:22,921 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:22,921 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-08-26 14:44:22,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 14:44:22,922 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:22,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:22,922 INFO L82 PathProgramCache]: Analyzing trace with hash 583278192, now seen corresponding path program 1 times [2021-08-26 14:44:22,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:22,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530654984] [2021-08-26 14:44:22,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:22,923 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:23,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:23,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530654984] [2021-08-26 14:44:23,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530654984] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:23,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:23,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 14:44:23,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832363887] [2021-08-26 14:44:23,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 14:44:23,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:23,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 14:44:23,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:44:23,018 INFO L87 Difference]: Start difference. First operand 420 states and 1038 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:23,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:23,100 INFO L93 Difference]: Finished difference Result 543 states and 1297 transitions. [2021-08-26 14:44:23,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 14:44:23,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-08-26 14:44:23,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:23,104 INFO L225 Difference]: With dead ends: 543 [2021-08-26 14:44:23,104 INFO L226 Difference]: Without dead ends: 527 [2021-08-26 14:44:23,104 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:44:23,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-08-26 14:44:23,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 495. [2021-08-26 14:44:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 491 states have (on average 2.476578411405295) internal successors, (1216), 494 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 1216 transitions. [2021-08-26 14:44:23,120 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 1216 transitions. Word has length 5 [2021-08-26 14:44:23,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:23,120 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 1216 transitions. [2021-08-26 14:44:23,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:23,121 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 1216 transitions. [2021-08-26 14:44:23,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 14:44:23,122 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:23,122 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:23,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 14:44:23,123 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:23,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:23,124 INFO L82 PathProgramCache]: Analyzing trace with hash -987483982, now seen corresponding path program 1 times [2021-08-26 14:44:23,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:23,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402947414] [2021-08-26 14:44:23,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:23,124 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:23,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:23,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:23,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402947414] [2021-08-26 14:44:23,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402947414] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:23,181 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:23,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:44:23,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859070646] [2021-08-26 14:44:23,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 14:44:23,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:23,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 14:44:23,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:44:23,183 INFO L87 Difference]: Start difference. First operand 495 states and 1216 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:23,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:23,196 INFO L93 Difference]: Finished difference Result 143 states and 312 transitions. [2021-08-26 14:44:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 14:44:23,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 14:44:23,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:23,199 INFO L225 Difference]: With dead ends: 143 [2021-08-26 14:44:23,199 INFO L226 Difference]: Without dead ends: 143 [2021-08-26 14:44:23,199 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:44:23,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-08-26 14:44:23,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-08-26 14:44:23,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 141 states have (on average 2.2127659574468086) internal successors, (312), 142 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:23,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 312 transitions. [2021-08-26 14:44:23,202 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 312 transitions. Word has length 11 [2021-08-26 14:44:23,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:23,203 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 312 transitions. [2021-08-26 14:44:23,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:23,203 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 312 transitions. [2021-08-26 14:44:23,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:23,204 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:23,204 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:23,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 14:44:23,205 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:23,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:23,206 INFO L82 PathProgramCache]: Analyzing trace with hash -229818472, now seen corresponding path program 1 times [2021-08-26 14:44:23,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:23,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790607253] [2021-08-26 14:44:23,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:23,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:24,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:24,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790607253] [2021-08-26 14:44:24,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790607253] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:24,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:24,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:24,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49045503] [2021-08-26 14:44:24,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:24,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:24,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:24,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:24,239 INFO L87 Difference]: Start difference. First operand 143 states and 312 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:25,434 INFO L93 Difference]: Finished difference Result 236 states and 476 transitions. [2021-08-26 14:44:25,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-26 14:44:25,435 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:25,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:25,436 INFO L225 Difference]: With dead ends: 236 [2021-08-26 14:44:25,436 INFO L226 Difference]: Without dead ends: 236 [2021-08-26 14:44:25,437 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 931.2ms TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2021-08-26 14:44:25,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-08-26 14:44:25,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 162. [2021-08-26 14:44:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 160 states have (on average 2.11875) internal successors, (339), 161 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:25,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 339 transitions. [2021-08-26 14:44:25,441 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 339 transitions. Word has length 21 [2021-08-26 14:44:25,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:25,441 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 339 transitions. [2021-08-26 14:44:25,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:25,442 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 339 transitions. [2021-08-26 14:44:25,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:25,442 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:25,443 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:25,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 14:44:25,443 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:25,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:25,443 INFO L82 PathProgramCache]: Analyzing trace with hash -229818501, now seen corresponding path program 1 times [2021-08-26 14:44:25,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:25,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693996454] [2021-08-26 14:44:25,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:25,444 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:25,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:25,794 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693996454] [2021-08-26 14:44:25,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693996454] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:25,794 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:25,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 14:44:25,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368324728] [2021-08-26 14:44:25,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 14:44:25,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:25,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 14:44:25,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-26 14:44:25,796 INFO L87 Difference]: Start difference. First operand 162 states and 339 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:26,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:26,039 INFO L93 Difference]: Finished difference Result 226 states and 444 transitions. [2021-08-26 14:44:26,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 14:44:26,040 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:26,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:26,041 INFO L225 Difference]: With dead ends: 226 [2021-08-26 14:44:26,041 INFO L226 Difference]: Without dead ends: 207 [2021-08-26 14:44:26,041 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 168.0ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-08-26 14:44:26,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-08-26 14:44:26,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 164. [2021-08-26 14:44:26,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 2.111111111111111) internal successors, (342), 163 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 342 transitions. [2021-08-26 14:44:26,046 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 342 transitions. Word has length 21 [2021-08-26 14:44:26,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:26,046 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 342 transitions. [2021-08-26 14:44:26,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:26,046 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 342 transitions. [2021-08-26 14:44:26,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:26,047 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:26,047 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:26,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 14:44:26,048 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:26,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:26,048 INFO L82 PathProgramCache]: Analyzing trace with hash 538676892, now seen corresponding path program 2 times [2021-08-26 14:44:26,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:26,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821747226] [2021-08-26 14:44:26,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:26,049 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:26,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-08-26 14:44:26,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:26,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821747226] [2021-08-26 14:44:26,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821747226] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:26,756 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:26,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:26,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524849230] [2021-08-26 14:44:26,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:26,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:26,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:26,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:26,757 INFO L87 Difference]: Start difference. First operand 164 states and 342 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:27,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:27,886 INFO L93 Difference]: Finished difference Result 256 states and 520 transitions. [2021-08-26 14:44:27,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-26 14:44:27,887 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:27,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:27,888 INFO L225 Difference]: With dead ends: 256 [2021-08-26 14:44:27,888 INFO L226 Difference]: Without dead ends: 256 [2021-08-26 14:44:27,889 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 923.4ms TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2021-08-26 14:44:27,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-08-26 14:44:27,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 189. [2021-08-26 14:44:27,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 187 states have (on average 2.064171122994652) internal successors, (386), 188 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:27,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 386 transitions. [2021-08-26 14:44:27,894 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 386 transitions. Word has length 21 [2021-08-26 14:44:27,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:27,894 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 386 transitions. [2021-08-26 14:44:27,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:27,895 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 386 transitions. [2021-08-26 14:44:27,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:27,896 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:27,897 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:27,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 14:44:27,897 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:27,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:27,897 INFO L82 PathProgramCache]: Analyzing trace with hash 538676863, now seen corresponding path program 2 times [2021-08-26 14:44:27,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:27,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449860694] [2021-08-26 14:44:27,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:27,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:28,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:28,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449860694] [2021-08-26 14:44:28,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449860694] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:28,188 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:28,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 14:44:28,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381315111] [2021-08-26 14:44:28,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 14:44:28,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:28,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 14:44:28,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-26 14:44:28,189 INFO L87 Difference]: Start difference. First operand 189 states and 386 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:28,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:28,377 INFO L93 Difference]: Finished difference Result 292 states and 553 transitions. [2021-08-26 14:44:28,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 14:44:28,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:28,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:28,379 INFO L225 Difference]: With dead ends: 292 [2021-08-26 14:44:28,379 INFO L226 Difference]: Without dead ends: 275 [2021-08-26 14:44:28,379 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 138.4ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-08-26 14:44:28,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-08-26 14:44:28,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 181. [2021-08-26 14:44:28,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 179 states have (on average 2.0670391061452515) internal successors, (370), 180 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:28,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 370 transitions. [2021-08-26 14:44:28,384 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 370 transitions. Word has length 21 [2021-08-26 14:44:28,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:28,384 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 370 transitions. [2021-08-26 14:44:28,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:28,384 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 370 transitions. [2021-08-26 14:44:28,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:28,386 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:28,386 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:28,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 14:44:28,386 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:28,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:28,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1665260969, now seen corresponding path program 3 times [2021-08-26 14:44:28,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:28,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253638093] [2021-08-26 14:44:28,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:28,389 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:28,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:28,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253638093] [2021-08-26 14:44:28,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253638093] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:28,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:28,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 14:44:28,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052349656] [2021-08-26 14:44:28,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 14:44:28,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:28,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 14:44:28,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-26 14:44:28,676 INFO L87 Difference]: Start difference. First operand 181 states and 370 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:28,870 INFO L93 Difference]: Finished difference Result 297 states and 613 transitions. [2021-08-26 14:44:28,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 14:44:28,870 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:28,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:28,871 INFO L225 Difference]: With dead ends: 297 [2021-08-26 14:44:28,872 INFO L226 Difference]: Without dead ends: 282 [2021-08-26 14:44:28,872 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 130.6ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-08-26 14:44:28,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-08-26 14:44:28,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 182. [2021-08-26 14:44:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 180 states have (on average 2.1277777777777778) internal successors, (383), 181 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 383 transitions. [2021-08-26 14:44:28,877 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 383 transitions. Word has length 21 [2021-08-26 14:44:28,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:28,877 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 383 transitions. [2021-08-26 14:44:28,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 383 transitions. [2021-08-26 14:44:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:28,878 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:28,878 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:28,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 14:44:28,878 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:28,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:28,878 INFO L82 PathProgramCache]: Analyzing trace with hash -160369218, now seen corresponding path program 3 times [2021-08-26 14:44:28,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:28,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008466433] [2021-08-26 14:44:28,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:28,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:29,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:29,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008466433] [2021-08-26 14:44:29,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008466433] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:29,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:29,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:29,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362286553] [2021-08-26 14:44:29,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:29,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:29,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:29,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:29,574 INFO L87 Difference]: Start difference. First operand 182 states and 383 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:30,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:30,781 INFO L93 Difference]: Finished difference Result 268 states and 547 transitions. [2021-08-26 14:44:30,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-26 14:44:30,782 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:30,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:30,783 INFO L225 Difference]: With dead ends: 268 [2021-08-26 14:44:30,783 INFO L226 Difference]: Without dead ends: 255 [2021-08-26 14:44:30,784 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 976.0ms TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2021-08-26 14:44:30,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-08-26 14:44:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 186. [2021-08-26 14:44:30,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 184 states have (on average 2.125) internal successors, (391), 185 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:30,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 391 transitions. [2021-08-26 14:44:30,790 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 391 transitions. Word has length 21 [2021-08-26 14:44:30,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:30,790 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 391 transitions. [2021-08-26 14:44:30,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 391 transitions. [2021-08-26 14:44:30,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:30,791 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:30,791 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:30,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 14:44:30,792 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:30,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:30,792 INFO L82 PathProgramCache]: Analyzing trace with hash -385945758, now seen corresponding path program 4 times [2021-08-26 14:44:30,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:30,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903066951] [2021-08-26 14:44:30,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:30,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:31,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:31,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:31,478 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903066951] [2021-08-26 14:44:31,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903066951] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:31,478 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:31,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:31,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422962094] [2021-08-26 14:44:31,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:31,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:31,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:31,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:31,488 INFO L87 Difference]: Start difference. First operand 186 states and 391 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:32,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:32,673 INFO L93 Difference]: Finished difference Result 272 states and 551 transitions. [2021-08-26 14:44:32,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-26 14:44:32,673 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:32,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:32,675 INFO L225 Difference]: With dead ends: 272 [2021-08-26 14:44:32,675 INFO L226 Difference]: Without dead ends: 237 [2021-08-26 14:44:32,675 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 950.5ms TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2021-08-26 14:44:32,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-08-26 14:44:32,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 170. [2021-08-26 14:44:32,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 168 states have (on average 2.125) internal successors, (357), 169 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:32,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 357 transitions. [2021-08-26 14:44:32,680 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 357 transitions. Word has length 21 [2021-08-26 14:44:32,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:32,680 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 357 transitions. [2021-08-26 14:44:32,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:32,680 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 357 transitions. [2021-08-26 14:44:32,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:32,681 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:32,681 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:32,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 14:44:32,681 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:32,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:32,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1751979318, now seen corresponding path program 5 times [2021-08-26 14:44:32,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:32,682 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62520646] [2021-08-26 14:44:32,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:32,682 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:33,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:33,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:33,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62520646] [2021-08-26 14:44:33,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62520646] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:33,370 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:33,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:33,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100025856] [2021-08-26 14:44:33,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:33,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:33,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:33,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:33,372 INFO L87 Difference]: Start difference. First operand 170 states and 357 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:34,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:34,470 INFO L93 Difference]: Finished difference Result 264 states and 529 transitions. [2021-08-26 14:44:34,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-26 14:44:34,470 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:34,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:34,471 INFO L225 Difference]: With dead ends: 264 [2021-08-26 14:44:34,471 INFO L226 Difference]: Without dead ends: 245 [2021-08-26 14:44:34,472 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 910.5ms TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2021-08-26 14:44:34,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-08-26 14:44:34,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 171. [2021-08-26 14:44:34,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 2.1183431952662723) internal successors, (358), 170 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:34,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 358 transitions. [2021-08-26 14:44:34,477 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 358 transitions. Word has length 21 [2021-08-26 14:44:34,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:34,477 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 358 transitions. [2021-08-26 14:44:34,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:34,477 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 358 transitions. [2021-08-26 14:44:34,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:34,478 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:34,478 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:34,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 14:44:34,478 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:34,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:34,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1746334808, now seen corresponding path program 6 times [2021-08-26 14:44:34,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:34,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039859888] [2021-08-26 14:44:34,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:34,479 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:34,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:34,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039859888] [2021-08-26 14:44:34,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039859888] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:34,603 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:34,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 14:44:34,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067366555] [2021-08-26 14:44:34,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 14:44:34,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:34,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 14:44:34,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:44:34,604 INFO L87 Difference]: Start difference. First operand 171 states and 358 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:34,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:34,680 INFO L93 Difference]: Finished difference Result 195 states and 391 transitions. [2021-08-26 14:44:34,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 14:44:34,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:34,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:34,682 INFO L225 Difference]: With dead ends: 195 [2021-08-26 14:44:34,682 INFO L226 Difference]: Without dead ends: 192 [2021-08-26 14:44:34,682 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 70.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 14:44:34,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-08-26 14:44:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 168. [2021-08-26 14:44:34,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 166 states have (on average 2.066265060240964) internal successors, (343), 167 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 343 transitions. [2021-08-26 14:44:34,686 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 343 transitions. Word has length 21 [2021-08-26 14:44:34,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:34,686 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 343 transitions. [2021-08-26 14:44:34,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:34,686 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 343 transitions. [2021-08-26 14:44:34,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:34,687 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:34,687 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:34,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 14:44:34,687 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:34,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:34,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1157895652, now seen corresponding path program 7 times [2021-08-26 14:44:34,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:34,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126064445] [2021-08-26 14:44:34,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:34,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:35,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:35,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:35,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126064445] [2021-08-26 14:44:35,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126064445] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:35,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:35,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:35,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615538887] [2021-08-26 14:44:35,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:35,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:35,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:35,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:35,300 INFO L87 Difference]: Start difference. First operand 168 states and 343 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:36,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:36,028 INFO L93 Difference]: Finished difference Result 224 states and 426 transitions. [2021-08-26 14:44:36,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-26 14:44:36,030 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:36,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:36,031 INFO L225 Difference]: With dead ends: 224 [2021-08-26 14:44:36,031 INFO L226 Difference]: Without dead ends: 206 [2021-08-26 14:44:36,032 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 639.4ms TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-08-26 14:44:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-08-26 14:44:36,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 164. [2021-08-26 14:44:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 2.067901234567901) internal successors, (335), 163 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 335 transitions. [2021-08-26 14:44:36,036 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 335 transitions. Word has length 21 [2021-08-26 14:44:36,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:36,036 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 335 transitions. [2021-08-26 14:44:36,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:36,036 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 335 transitions. [2021-08-26 14:44:36,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:36,037 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:36,037 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:36,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-26 14:44:36,037 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:36,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:36,038 INFO L82 PathProgramCache]: Analyzing trace with hash 309397486, now seen corresponding path program 8 times [2021-08-26 14:44:36,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:36,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914394326] [2021-08-26 14:44:36,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:36,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:36,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:36,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:36,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914394326] [2021-08-26 14:44:36,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914394326] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:36,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:36,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:36,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641544939] [2021-08-26 14:44:36,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:36,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:36,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:36,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:36,677 INFO L87 Difference]: Start difference. First operand 164 states and 335 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:37,418 INFO L93 Difference]: Finished difference Result 214 states and 411 transitions. [2021-08-26 14:44:37,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-26 14:44:37,418 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:37,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:37,419 INFO L225 Difference]: With dead ends: 214 [2021-08-26 14:44:37,419 INFO L226 Difference]: Without dead ends: 200 [2021-08-26 14:44:37,420 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 620.7ms TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-08-26 14:44:37,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-08-26 14:44:37,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 159. [2021-08-26 14:44:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 157 states have (on average 2.0955414012738856) internal successors, (329), 158 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 329 transitions. [2021-08-26 14:44:37,424 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 329 transitions. Word has length 21 [2021-08-26 14:44:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:37,424 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 329 transitions. [2021-08-26 14:44:37,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:37,425 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 329 transitions. [2021-08-26 14:44:37,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:37,425 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:37,425 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:37,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-26 14:44:37,426 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:37,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:37,426 INFO L82 PathProgramCache]: Analyzing trace with hash -502486308, now seen corresponding path program 9 times [2021-08-26 14:44:37,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:37,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048677716] [2021-08-26 14:44:37,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:37,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:37,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:37,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048677716] [2021-08-26 14:44:37,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048677716] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:37,559 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:37,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 14:44:37,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573394247] [2021-08-26 14:44:37,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 14:44:37,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:37,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 14:44:37,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:44:37,562 INFO L87 Difference]: Start difference. First operand 159 states and 329 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:37,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:37,642 INFO L93 Difference]: Finished difference Result 171 states and 349 transitions. [2021-08-26 14:44:37,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 14:44:37,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:37,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:37,643 INFO L225 Difference]: With dead ends: 171 [2021-08-26 14:44:37,643 INFO L226 Difference]: Without dead ends: 171 [2021-08-26 14:44:37,644 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 71.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 14:44:37,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-08-26 14:44:37,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-08-26 14:44:37,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 2.06508875739645) internal successors, (349), 170 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 349 transitions. [2021-08-26 14:44:37,647 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 349 transitions. Word has length 21 [2021-08-26 14:44:37,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:37,647 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 349 transitions. [2021-08-26 14:44:37,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:37,647 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 349 transitions. [2021-08-26 14:44:37,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:37,648 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:37,648 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:37,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-26 14:44:37,648 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:37,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:37,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1542939810, now seen corresponding path program 10 times [2021-08-26 14:44:37,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:37,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942370887] [2021-08-26 14:44:37,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:37,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:38,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:38,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942370887] [2021-08-26 14:44:38,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942370887] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:38,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:38,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:38,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192628506] [2021-08-26 14:44:38,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:38,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:38,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:38,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:38,193 INFO L87 Difference]: Start difference. First operand 171 states and 349 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:38,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:38,868 INFO L93 Difference]: Finished difference Result 200 states and 393 transitions. [2021-08-26 14:44:38,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 14:44:38,869 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:38,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:38,870 INFO L225 Difference]: With dead ends: 200 [2021-08-26 14:44:38,870 INFO L226 Difference]: Without dead ends: 200 [2021-08-26 14:44:38,870 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 554.8ms TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-08-26 14:44:38,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-08-26 14:44:38,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2021-08-26 14:44:38,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 198 states have (on average 1.9848484848484849) internal successors, (393), 199 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 393 transitions. [2021-08-26 14:44:38,875 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 393 transitions. Word has length 21 [2021-08-26 14:44:38,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:38,875 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 393 transitions. [2021-08-26 14:44:38,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:38,876 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 393 transitions. [2021-08-26 14:44:38,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:38,876 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:38,876 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:38,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-26 14:44:38,877 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:38,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:38,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1542939781, now seen corresponding path program 4 times [2021-08-26 14:44:38,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:38,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100022989] [2021-08-26 14:44:38,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:38,878 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:39,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:39,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100022989] [2021-08-26 14:44:39,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100022989] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:39,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:39,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 14:44:39,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740186690] [2021-08-26 14:44:39,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 14:44:39,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:39,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 14:44:39,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-26 14:44:39,116 INFO L87 Difference]: Start difference. First operand 200 states and 393 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:39,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:39,311 INFO L93 Difference]: Finished difference Result 277 states and 516 transitions. [2021-08-26 14:44:39,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 14:44:39,312 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:39,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:39,317 INFO L225 Difference]: With dead ends: 277 [2021-08-26 14:44:39,317 INFO L226 Difference]: Without dead ends: 247 [2021-08-26 14:44:39,317 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 181.9ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-08-26 14:44:39,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-08-26 14:44:39,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 188. [2021-08-26 14:44:39,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 186 states have (on average 2.043010752688172) internal successors, (380), 187 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 380 transitions. [2021-08-26 14:44:39,323 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 380 transitions. Word has length 21 [2021-08-26 14:44:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:39,323 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 380 transitions. [2021-08-26 14:44:39,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 380 transitions. [2021-08-26 14:44:39,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:39,325 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:39,326 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:39,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-26 14:44:39,326 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:39,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:39,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1955977246, now seen corresponding path program 11 times [2021-08-26 14:44:39,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:39,327 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174284372] [2021-08-26 14:44:39,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:39,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:39,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:39,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174284372] [2021-08-26 14:44:39,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174284372] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:39,962 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:39,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:39,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785800247] [2021-08-26 14:44:39,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:39,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:39,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:39,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:39,963 INFO L87 Difference]: Start difference. First operand 188 states and 380 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:40,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:40,624 INFO L93 Difference]: Finished difference Result 215 states and 421 transitions. [2021-08-26 14:44:40,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 14:44:40,625 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:40,625 INFO L225 Difference]: With dead ends: 215 [2021-08-26 14:44:40,625 INFO L226 Difference]: Without dead ends: 186 [2021-08-26 14:44:40,626 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 634.7ms TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-08-26 14:44:40,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-08-26 14:44:40,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2021-08-26 14:44:40,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 184 states have (on average 2.0434782608695654) internal successors, (376), 185 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 376 transitions. [2021-08-26 14:44:40,630 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 376 transitions. Word has length 21 [2021-08-26 14:44:40,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:40,630 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 376 transitions. [2021-08-26 14:44:40,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:40,630 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 376 transitions. [2021-08-26 14:44:40,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:40,631 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:40,631 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:40,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-26 14:44:40,632 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:40,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:40,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1217238588, now seen corresponding path program 12 times [2021-08-26 14:44:40,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:40,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353939333] [2021-08-26 14:44:40,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:40,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:41,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:41,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:41,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353939333] [2021-08-26 14:44:41,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353939333] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:41,279 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:41,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:41,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073195537] [2021-08-26 14:44:41,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:41,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:41,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:41,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:41,281 INFO L87 Difference]: Start difference. First operand 186 states and 376 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:42,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:42,022 INFO L93 Difference]: Finished difference Result 212 states and 416 transitions. [2021-08-26 14:44:42,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-26 14:44:42,023 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:42,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:42,023 INFO L225 Difference]: With dead ends: 212 [2021-08-26 14:44:42,023 INFO L226 Difference]: Without dead ends: 185 [2021-08-26 14:44:42,024 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 697.0ms TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2021-08-26 14:44:42,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-08-26 14:44:42,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-08-26 14:44:42,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 183 states have (on average 2.0437158469945356) internal successors, (374), 184 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:42,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 374 transitions. [2021-08-26 14:44:42,028 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 374 transitions. Word has length 21 [2021-08-26 14:44:42,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:42,028 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 374 transitions. [2021-08-26 14:44:42,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:42,028 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 374 transitions. [2021-08-26 14:44:42,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:42,029 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:42,029 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:42,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-26 14:44:42,030 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:42,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:42,030 INFO L82 PathProgramCache]: Analyzing trace with hash -800839378, now seen corresponding path program 13 times [2021-08-26 14:44:42,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:42,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618167529] [2021-08-26 14:44:42,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:42,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:42,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:42,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:42,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618167529] [2021-08-26 14:44:42,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618167529] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:42,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:42,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:42,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967229607] [2021-08-26 14:44:42,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:42,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:42,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:42,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:42,714 INFO L87 Difference]: Start difference. First operand 185 states and 374 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:43,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:43,315 INFO L93 Difference]: Finished difference Result 247 states and 473 transitions. [2021-08-26 14:44:43,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-26 14:44:43,316 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:43,320 INFO L225 Difference]: With dead ends: 247 [2021-08-26 14:44:43,320 INFO L226 Difference]: Without dead ends: 247 [2021-08-26 14:44:43,320 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 610.8ms TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2021-08-26 14:44:43,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-08-26 14:44:43,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 206. [2021-08-26 14:44:43,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 204 states have (on average 2.0) internal successors, (408), 205 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:43,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 408 transitions. [2021-08-26 14:44:43,325 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 408 transitions. Word has length 21 [2021-08-26 14:44:43,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:43,325 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 408 transitions. [2021-08-26 14:44:43,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:43,326 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 408 transitions. [2021-08-26 14:44:43,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:43,326 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:43,326 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:43,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-26 14:44:43,327 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:43,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:43,327 INFO L82 PathProgramCache]: Analyzing trace with hash -800839407, now seen corresponding path program 5 times [2021-08-26 14:44:43,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:43,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745545313] [2021-08-26 14:44:43,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:43,328 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:43,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:43,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745545313] [2021-08-26 14:44:43,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745545313] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:43,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:43,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 14:44:43,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842887845] [2021-08-26 14:44:43,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 14:44:43,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:43,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 14:44:43,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-26 14:44:43,528 INFO L87 Difference]: Start difference. First operand 206 states and 408 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:43,715 INFO L93 Difference]: Finished difference Result 296 states and 558 transitions. [2021-08-26 14:44:43,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 14:44:43,716 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:43,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:43,717 INFO L225 Difference]: With dead ends: 296 [2021-08-26 14:44:43,717 INFO L226 Difference]: Without dead ends: 283 [2021-08-26 14:44:43,717 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 128.7ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-08-26 14:44:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-08-26 14:44:43,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 201. [2021-08-26 14:44:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 199 states have (on average 2.050251256281407) internal successors, (408), 200 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 408 transitions. [2021-08-26 14:44:43,722 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 408 transitions. Word has length 21 [2021-08-26 14:44:43,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:43,723 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 408 transitions. [2021-08-26 14:44:43,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:43,723 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 408 transitions. [2021-08-26 14:44:43,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:43,724 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:43,724 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:43,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-26 14:44:43,724 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:43,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:43,725 INFO L82 PathProgramCache]: Analyzing trace with hash -626997040, now seen corresponding path program 14 times [2021-08-26 14:44:43,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:43,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954867371] [2021-08-26 14:44:43,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:43,725 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:44,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:44,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954867371] [2021-08-26 14:44:44,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954867371] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:44,375 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:44,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:44,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764436537] [2021-08-26 14:44:44,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:44,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:44,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:44,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:44,377 INFO L87 Difference]: Start difference. First operand 201 states and 408 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:44,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:44,998 INFO L93 Difference]: Finished difference Result 240 states and 474 transitions. [2021-08-26 14:44:44,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-26 14:44:44,998 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:44,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:45,000 INFO L225 Difference]: With dead ends: 240 [2021-08-26 14:44:45,000 INFO L226 Difference]: Without dead ends: 225 [2021-08-26 14:44:45,001 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 594.6ms TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2021-08-26 14:44:45,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-08-26 14:44:45,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 199. [2021-08-26 14:44:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 2.050761421319797) internal successors, (404), 198 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 404 transitions. [2021-08-26 14:44:45,005 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 404 transitions. Word has length 21 [2021-08-26 14:44:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:45,005 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 404 transitions. [2021-08-26 14:44:45,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:45,005 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 404 transitions. [2021-08-26 14:44:45,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:45,006 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:45,006 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:45,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-26 14:44:45,006 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:45,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:45,007 INFO L82 PathProgramCache]: Analyzing trace with hash -295988382, now seen corresponding path program 15 times [2021-08-26 14:44:45,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:45,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825367279] [2021-08-26 14:44:45,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:45,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:45,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:45,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:45,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825367279] [2021-08-26 14:44:45,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825367279] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:45,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:45,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:45,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056978318] [2021-08-26 14:44:45,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:45,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:45,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:45,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:45,570 INFO L87 Difference]: Start difference. First operand 199 states and 404 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:46,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:46,164 INFO L93 Difference]: Finished difference Result 245 states and 478 transitions. [2021-08-26 14:44:46,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 14:44:46,164 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:46,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:46,165 INFO L225 Difference]: With dead ends: 245 [2021-08-26 14:44:46,165 INFO L226 Difference]: Without dead ends: 226 [2021-08-26 14:44:46,166 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 557.6ms TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-08-26 14:44:46,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-08-26 14:44:46,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2021-08-26 14:44:46,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 216 states have (on average 2.0046296296296298) internal successors, (433), 217 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:46,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 433 transitions. [2021-08-26 14:44:46,170 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 433 transitions. Word has length 21 [2021-08-26 14:44:46,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:46,170 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 433 transitions. [2021-08-26 14:44:46,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:46,170 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 433 transitions. [2021-08-26 14:44:46,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:46,171 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:46,171 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:46,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-26 14:44:46,171 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:46,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:46,172 INFO L82 PathProgramCache]: Analyzing trace with hash 816483609, now seen corresponding path program 6 times [2021-08-26 14:44:46,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:46,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931856226] [2021-08-26 14:44:46,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:46,172 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:46,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:46,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:46,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931856226] [2021-08-26 14:44:46,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931856226] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:46,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:46,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 14:44:46,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502094175] [2021-08-26 14:44:46,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 14:44:46,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:46,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 14:44:46,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-26 14:44:46,380 INFO L87 Difference]: Start difference. First operand 218 states and 433 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:46,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:46,570 INFO L93 Difference]: Finished difference Result 315 states and 586 transitions. [2021-08-26 14:44:46,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 14:44:46,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:46,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:46,571 INFO L225 Difference]: With dead ends: 315 [2021-08-26 14:44:46,571 INFO L226 Difference]: Without dead ends: 292 [2021-08-26 14:44:46,572 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 141.2ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-08-26 14:44:46,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-08-26 14:44:46,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 187. [2021-08-26 14:44:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 185 states have (on average 2.0594594594594593) internal successors, (381), 186 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:46,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 381 transitions. [2021-08-26 14:44:46,576 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 381 transitions. Word has length 21 [2021-08-26 14:44:46,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:46,576 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 381 transitions. [2021-08-26 14:44:46,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:46,576 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 381 transitions. [2021-08-26 14:44:46,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:46,577 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:46,577 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:46,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-26 14:44:46,577 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:46,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:46,578 INFO L82 PathProgramCache]: Analyzing trace with hash -458357992, now seen corresponding path program 16 times [2021-08-26 14:44:46,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:46,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479249093] [2021-08-26 14:44:46,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:46,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:47,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:47,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479249093] [2021-08-26 14:44:47,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479249093] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:47,170 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:47,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:47,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802260190] [2021-08-26 14:44:47,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:47,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:47,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:47,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:47,171 INFO L87 Difference]: Start difference. First operand 187 states and 381 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:47,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:47,820 INFO L93 Difference]: Finished difference Result 212 states and 420 transitions. [2021-08-26 14:44:47,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-26 14:44:47,821 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:47,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:47,822 INFO L225 Difference]: With dead ends: 212 [2021-08-26 14:44:47,822 INFO L226 Difference]: Without dead ends: 174 [2021-08-26 14:44:47,822 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 628.3ms TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2021-08-26 14:44:47,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-08-26 14:44:47,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2021-08-26 14:44:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 172 states have (on average 2.0988372093023258) internal successors, (361), 173 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 361 transitions. [2021-08-26 14:44:47,826 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 361 transitions. Word has length 21 [2021-08-26 14:44:47,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:47,826 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 361 transitions. [2021-08-26 14:44:47,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 361 transitions. [2021-08-26 14:44:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:47,827 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:47,827 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:47,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-26 14:44:47,827 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:47,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:47,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1747350066, now seen corresponding path program 17 times [2021-08-26 14:44:47,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:47,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202257688] [2021-08-26 14:44:47,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:47,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:47,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:47,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202257688] [2021-08-26 14:44:47,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202257688] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:47,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:47,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 14:44:47,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446921931] [2021-08-26 14:44:47,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 14:44:47,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:47,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 14:44:47,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:44:47,919 INFO L87 Difference]: Start difference. First operand 174 states and 361 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:48,005 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2021-08-26 14:44:48,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 14:44:48,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:48,005 INFO L225 Difference]: With dead ends: 64 [2021-08-26 14:44:48,006 INFO L226 Difference]: Without dead ends: 64 [2021-08-26 14:44:48,006 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 68.4ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-08-26 14:44:48,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-08-26 14:44:48,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-08-26 14:44:48,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.6666666666666667) internal successors, (105), 63 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:48,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 105 transitions. [2021-08-26 14:44:48,008 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 105 transitions. Word has length 21 [2021-08-26 14:44:48,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:48,008 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 105 transitions. [2021-08-26 14:44:48,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:48,008 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2021-08-26 14:44:48,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:48,008 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:48,008 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:48,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-26 14:44:48,008 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:48,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:48,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1731723038, now seen corresponding path program 18 times [2021-08-26 14:44:48,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:48,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819052057] [2021-08-26 14:44:48,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:48,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:48,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:48,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:48,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819052057] [2021-08-26 14:44:48,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819052057] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:48,554 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:48,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:48,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261601015] [2021-08-26 14:44:48,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:48,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:48,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:48,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:48,555 INFO L87 Difference]: Start difference. First operand 64 states and 105 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:49,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:49,108 INFO L93 Difference]: Finished difference Result 91 states and 146 transitions. [2021-08-26 14:44:49,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 14:44:49,109 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:49,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:49,109 INFO L225 Difference]: With dead ends: 91 [2021-08-26 14:44:49,109 INFO L226 Difference]: Without dead ends: 62 [2021-08-26 14:44:49,109 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 553.8ms TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-08-26 14:44:49,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-08-26 14:44:49,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-08-26 14:44:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 61 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 101 transitions. [2021-08-26 14:44:49,111 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 101 transitions. Word has length 21 [2021-08-26 14:44:49,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:49,111 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 101 transitions. [2021-08-26 14:44:49,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:49,111 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 101 transitions. [2021-08-26 14:44:49,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:49,112 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:49,112 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:49,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-26 14:44:49,112 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:49,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:49,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1824505600, now seen corresponding path program 19 times [2021-08-26 14:44:49,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:49,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546808116] [2021-08-26 14:44:49,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:49,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:49,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:49,682 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546808116] [2021-08-26 14:44:49,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546808116] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:49,682 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:49,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:49,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024819949] [2021-08-26 14:44:49,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:49,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:49,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:49,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:49,683 INFO L87 Difference]: Start difference. First operand 62 states and 101 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:50,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:50,306 INFO L93 Difference]: Finished difference Result 94 states and 151 transitions. [2021-08-26 14:44:50,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-26 14:44:50,307 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:50,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:50,307 INFO L225 Difference]: With dead ends: 94 [2021-08-26 14:44:50,307 INFO L226 Difference]: Without dead ends: 67 [2021-08-26 14:44:50,308 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 587.8ms TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2021-08-26 14:44:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-08-26 14:44:50,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2021-08-26 14:44:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.6507936507936507) internal successors, (104), 63 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2021-08-26 14:44:50,309 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 21 [2021-08-26 14:44:50,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:50,310 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2021-08-26 14:44:50,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:50,310 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2021-08-26 14:44:50,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:50,310 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:50,311 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:50,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-26 14:44:50,311 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:50,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:50,311 INFO L82 PathProgramCache]: Analyzing trace with hash -193572366, now seen corresponding path program 20 times [2021-08-26 14:44:50,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:50,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100782092] [2021-08-26 14:44:50,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:50,312 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:50,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:50,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:50,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100782092] [2021-08-26 14:44:50,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100782092] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:50,839 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:50,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:50,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056435423] [2021-08-26 14:44:50,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:50,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:50,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:50,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:50,840 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:51,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:51,446 INFO L93 Difference]: Finished difference Result 109 states and 176 transitions. [2021-08-26 14:44:51,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-26 14:44:51,447 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:51,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:51,447 INFO L225 Difference]: With dead ends: 109 [2021-08-26 14:44:51,448 INFO L226 Difference]: Without dead ends: 96 [2021-08-26 14:44:51,448 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 557.8ms TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2021-08-26 14:44:51,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-08-26 14:44:51,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 74. [2021-08-26 14:44:51,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.6712328767123288) internal successors, (122), 73 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:51,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 122 transitions. [2021-08-26 14:44:51,450 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 122 transitions. Word has length 21 [2021-08-26 14:44:51,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:51,450 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 122 transitions. [2021-08-26 14:44:51,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:51,451 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 122 transitions. [2021-08-26 14:44:51,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:51,451 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:51,451 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:51,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-26 14:44:51,451 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:51,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:51,452 INFO L82 PathProgramCache]: Analyzing trace with hash -19730028, now seen corresponding path program 21 times [2021-08-26 14:44:51,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:51,452 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061844813] [2021-08-26 14:44:51,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:51,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:51,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:51,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061844813] [2021-08-26 14:44:51,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061844813] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:51,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:51,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:51,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130998102] [2021-08-26 14:44:51,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:51,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:51,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:51,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:51,988 INFO L87 Difference]: Start difference. First operand 74 states and 122 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:52,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:52,557 INFO L93 Difference]: Finished difference Result 102 states and 167 transitions. [2021-08-26 14:44:52,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-26 14:44:52,558 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:52,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:52,558 INFO L225 Difference]: With dead ends: 102 [2021-08-26 14:44:52,558 INFO L226 Difference]: Without dead ends: 87 [2021-08-26 14:44:52,559 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 549.8ms TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2021-08-26 14:44:52,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-08-26 14:44:52,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2021-08-26 14:44:52,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 71 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:52,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 118 transitions. [2021-08-26 14:44:52,560 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 118 transitions. Word has length 21 [2021-08-26 14:44:52,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:52,561 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 118 transitions. [2021-08-26 14:44:52,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:52,561 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 118 transitions. [2021-08-26 14:44:52,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:52,561 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:52,561 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:52,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-26 14:44:52,562 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:52,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:52,562 INFO L82 PathProgramCache]: Analyzing trace with hash 311278630, now seen corresponding path program 22 times [2021-08-26 14:44:52,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:52,562 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915013863] [2021-08-26 14:44:52,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:52,563 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:53,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:53,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:53,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915013863] [2021-08-26 14:44:53,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915013863] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:53,115 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:53,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:53,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410009497] [2021-08-26 14:44:53,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:53,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:53,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:53,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:53,117 INFO L87 Difference]: Start difference. First operand 72 states and 118 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:53,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:53,721 INFO L93 Difference]: Finished difference Result 102 states and 167 transitions. [2021-08-26 14:44:53,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 14:44:53,722 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:53,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:53,722 INFO L225 Difference]: With dead ends: 102 [2021-08-26 14:44:53,723 INFO L226 Difference]: Without dead ends: 77 [2021-08-26 14:44:53,723 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 567.3ms TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-08-26 14:44:53,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-08-26 14:44:53,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2021-08-26 14:44:53,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 67 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:53,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 110 transitions. [2021-08-26 14:44:53,724 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 110 transitions. Word has length 21 [2021-08-26 14:44:53,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:53,724 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 110 transitions. [2021-08-26 14:44:53,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:53,725 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 110 transitions. [2021-08-26 14:44:53,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:53,725 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:53,725 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:53,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-26 14:44:53,725 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:53,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:53,726 INFO L82 PathProgramCache]: Analyzing trace with hash 148909020, now seen corresponding path program 23 times [2021-08-26 14:44:53,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:53,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213923329] [2021-08-26 14:44:53,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:53,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:54,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:54,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:54,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213923329] [2021-08-26 14:44:54,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213923329] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:54,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:54,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:54,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611470909] [2021-08-26 14:44:54,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:54,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:54,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:54,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:54,226 INFO L87 Difference]: Start difference. First operand 68 states and 110 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:54,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:54,836 INFO L93 Difference]: Finished difference Result 94 states and 150 transitions. [2021-08-26 14:44:54,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-26 14:44:54,836 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:54,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:54,837 INFO L225 Difference]: With dead ends: 94 [2021-08-26 14:44:54,837 INFO L226 Difference]: Without dead ends: 58 [2021-08-26 14:44:54,837 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 561.6ms TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2021-08-26 14:44:54,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-08-26 14:44:54,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-08-26 14:44:54,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.631578947368421) internal successors, (93), 57 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 93 transitions. [2021-08-26 14:44:54,838 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 93 transitions. Word has length 21 [2021-08-26 14:44:54,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:54,839 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 93 transitions. [2021-08-26 14:44:54,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 93 transitions. [2021-08-26 14:44:54,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:54,839 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:54,839 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:54,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-26 14:44:54,839 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:54,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:54,840 INFO L82 PathProgramCache]: Analyzing trace with hash -574776384, now seen corresponding path program 24 times [2021-08-26 14:44:54,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:54,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820780302] [2021-08-26 14:44:54,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:54,840 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:55,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:55,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:55,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820780302] [2021-08-26 14:44:55,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820780302] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:55,371 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:55,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:55,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038347481] [2021-08-26 14:44:55,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:55,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:55,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:55,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:55,373 INFO L87 Difference]: Start difference. First operand 58 states and 93 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:56,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:56,069 INFO L93 Difference]: Finished difference Result 84 states and 133 transitions. [2021-08-26 14:44:56,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-26 14:44:56,069 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:56,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:56,070 INFO L225 Difference]: With dead ends: 84 [2021-08-26 14:44:56,070 INFO L226 Difference]: Without dead ends: 57 [2021-08-26 14:44:56,070 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 636.8ms TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2021-08-26 14:44:56,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-08-26 14:44:56,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-08-26 14:44:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.625) internal successors, (91), 56 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 91 transitions. [2021-08-26 14:44:56,072 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 91 transitions. Word has length 21 [2021-08-26 14:44:56,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:56,072 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 91 transitions. [2021-08-26 14:44:56,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 91 transitions. [2021-08-26 14:44:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:56,073 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:56,073 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:56,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-26 14:44:56,073 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:56,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:56,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1702112946, now seen corresponding path program 25 times [2021-08-26 14:44:56,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:56,074 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191237373] [2021-08-26 14:44:56,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:56,074 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:56,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:56,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:56,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191237373] [2021-08-26 14:44:56,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191237373] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:56,625 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:56,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:56,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710302419] [2021-08-26 14:44:56,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:56,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:56,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:56,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:56,626 INFO L87 Difference]: Start difference. First operand 57 states and 91 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:57,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:57,276 INFO L93 Difference]: Finished difference Result 102 states and 163 transitions. [2021-08-26 14:44:57,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-26 14:44:57,276 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:57,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:57,277 INFO L225 Difference]: With dead ends: 102 [2021-08-26 14:44:57,277 INFO L226 Difference]: Without dead ends: 89 [2021-08-26 14:44:57,277 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 633.6ms TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2021-08-26 14:44:57,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-08-26 14:44:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2021-08-26 14:44:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.6515151515151516) internal successors, (109), 66 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 109 transitions. [2021-08-26 14:44:57,278 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 109 transitions. Word has length 21 [2021-08-26 14:44:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:57,278 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 109 transitions. [2021-08-26 14:44:57,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 109 transitions. [2021-08-26 14:44:57,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:57,279 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:57,279 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:57,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-26 14:44:57,279 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:57,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:57,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1875955284, now seen corresponding path program 26 times [2021-08-26 14:44:57,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:57,280 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9644919] [2021-08-26 14:44:57,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:57,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:57,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:57,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:57,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9644919] [2021-08-26 14:44:57,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9644919] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:57,901 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:57,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:57,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021055112] [2021-08-26 14:44:57,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:57,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:57,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:57,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:57,902 INFO L87 Difference]: Start difference. First operand 67 states and 109 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:58,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:58,554 INFO L93 Difference]: Finished difference Result 95 states and 154 transitions. [2021-08-26 14:44:58,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-26 14:44:58,555 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:58,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:58,556 INFO L225 Difference]: With dead ends: 95 [2021-08-26 14:44:58,556 INFO L226 Difference]: Without dead ends: 80 [2021-08-26 14:44:58,556 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 663.7ms TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2021-08-26 14:44:58,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-08-26 14:44:58,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 65. [2021-08-26 14:44:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.640625) internal successors, (105), 64 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:58,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 105 transitions. [2021-08-26 14:44:58,558 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 105 transitions. Word has length 21 [2021-08-26 14:44:58,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:58,558 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 105 transitions. [2021-08-26 14:44:58,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:58,558 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 105 transitions. [2021-08-26 14:44:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:58,559 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:58,559 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:58,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-26 14:44:58,559 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:58,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:58,560 INFO L82 PathProgramCache]: Analyzing trace with hash -2088003354, now seen corresponding path program 27 times [2021-08-26 14:44:58,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:58,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344688241] [2021-08-26 14:44:58,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:58,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:59,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:59,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344688241] [2021-08-26 14:44:59,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344688241] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:59,131 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:59,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:44:59,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270882783] [2021-08-26 14:44:59,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:44:59,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:59,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:44:59,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:44:59,133 INFO L87 Difference]: Start difference. First operand 65 states and 105 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:59,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:59,772 INFO L93 Difference]: Finished difference Result 95 states and 154 transitions. [2021-08-26 14:44:59,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-26 14:44:59,772 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:44:59,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:59,773 INFO L225 Difference]: With dead ends: 95 [2021-08-26 14:44:59,773 INFO L226 Difference]: Without dead ends: 70 [2021-08-26 14:44:59,773 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 640.0ms TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2021-08-26 14:44:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-08-26 14:44:59,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2021-08-26 14:44:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.6166666666666667) internal successors, (97), 60 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 97 transitions. [2021-08-26 14:44:59,775 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 97 transitions. Word has length 21 [2021-08-26 14:44:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:59,775 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 97 transitions. [2021-08-26 14:44:59,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:59,775 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 97 transitions. [2021-08-26 14:44:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:59,776 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:59,776 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:59,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-26 14:44:59,776 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:59,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:59,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2044594332, now seen corresponding path program 28 times [2021-08-26 14:44:59,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:59,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186560569] [2021-08-26 14:44:59,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:59,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:00,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:45:00,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:00,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186560569] [2021-08-26 14:45:00,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186560569] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:00,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:00,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:45:00,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075210526] [2021-08-26 14:45:00,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:45:00,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:00,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:45:00,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:45:00,330 INFO L87 Difference]: Start difference. First operand 61 states and 97 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:01,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:01,003 INFO L93 Difference]: Finished difference Result 87 states and 137 transitions. [2021-08-26 14:45:01,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-26 14:45:01,003 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:45:01,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:01,004 INFO L225 Difference]: With dead ends: 87 [2021-08-26 14:45:01,004 INFO L226 Difference]: Without dead ends: 55 [2021-08-26 14:45:01,004 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 668.7ms TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2021-08-26 14:45:01,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-08-26 14:45:01,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-08-26 14:45:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 54 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 87 transitions. [2021-08-26 14:45:01,005 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 87 transitions. Word has length 21 [2021-08-26 14:45:01,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:01,005 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 87 transitions. [2021-08-26 14:45:01,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:01,006 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 87 transitions. [2021-08-26 14:45:01,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:45:01,006 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:01,006 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:45:01,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-08-26 14:45:01,006 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:01,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:01,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1975039054, now seen corresponding path program 29 times [2021-08-26 14:45:01,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:01,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430905797] [2021-08-26 14:45:01,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:01,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:01,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:45:01,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:01,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430905797] [2021-08-26 14:45:01,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430905797] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:01,484 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:01,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:45:01,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314002427] [2021-08-26 14:45:01,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:45:01,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:01,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:45:01,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:45:01,489 INFO L87 Difference]: Start difference. First operand 55 states and 87 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:02,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:02,107 INFO L93 Difference]: Finished difference Result 102 states and 162 transitions. [2021-08-26 14:45:02,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-26 14:45:02,108 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:45:02,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:02,108 INFO L225 Difference]: With dead ends: 102 [2021-08-26 14:45:02,108 INFO L226 Difference]: Without dead ends: 89 [2021-08-26 14:45:02,108 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 573.6ms TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2021-08-26 14:45:02,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-08-26 14:45:02,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2021-08-26 14:45:02,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 66 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 108 transitions. [2021-08-26 14:45:02,110 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 108 transitions. Word has length 21 [2021-08-26 14:45:02,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:02,110 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 108 transitions. [2021-08-26 14:45:02,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:02,111 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 108 transitions. [2021-08-26 14:45:02,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:45:02,111 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:02,111 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:45:02,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-08-26 14:45:02,111 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:02,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:02,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1801196716, now seen corresponding path program 30 times [2021-08-26 14:45:02,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:02,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373223980] [2021-08-26 14:45:02,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:02,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:45:02,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:02,654 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373223980] [2021-08-26 14:45:02,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373223980] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:02,654 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:02,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:45:02,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444000343] [2021-08-26 14:45:02,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:45:02,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:02,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:45:02,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:45:02,655 INFO L87 Difference]: Start difference. First operand 67 states and 108 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:03,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:03,267 INFO L93 Difference]: Finished difference Result 95 states and 153 transitions. [2021-08-26 14:45:03,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-26 14:45:03,267 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:45:03,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:03,268 INFO L225 Difference]: With dead ends: 95 [2021-08-26 14:45:03,268 INFO L226 Difference]: Without dead ends: 80 [2021-08-26 14:45:03,268 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 619.5ms TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2021-08-26 14:45:03,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-08-26 14:45:03,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 65. [2021-08-26 14:45:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.625) internal successors, (104), 64 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:03,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 104 transitions. [2021-08-26 14:45:03,270 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 104 transitions. Word has length 21 [2021-08-26 14:45:03,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:03,270 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 104 transitions. [2021-08-26 14:45:03,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 104 transitions. [2021-08-26 14:45:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:45:03,271 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:03,271 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:45:03,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-08-26 14:45:03,271 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:03,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:03,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1470188058, now seen corresponding path program 31 times [2021-08-26 14:45:03,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:03,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389466595] [2021-08-26 14:45:03,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:03,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:45:03,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:03,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389466595] [2021-08-26 14:45:03,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389466595] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:03,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:03,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:45:03,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661521840] [2021-08-26 14:45:03,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:45:03,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:03,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:45:03,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:45:03,777 INFO L87 Difference]: Start difference. First operand 65 states and 104 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:04,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:04,429 INFO L93 Difference]: Finished difference Result 95 states and 153 transitions. [2021-08-26 14:45:04,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-26 14:45:04,431 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:45:04,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:04,431 INFO L225 Difference]: With dead ends: 95 [2021-08-26 14:45:04,431 INFO L226 Difference]: Without dead ends: 70 [2021-08-26 14:45:04,431 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 602.5ms TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2021-08-26 14:45:04,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-08-26 14:45:04,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2021-08-26 14:45:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.6) internal successors, (96), 60 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 96 transitions. [2021-08-26 14:45:04,432 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 96 transitions. Word has length 21 [2021-08-26 14:45:04,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:04,433 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 96 transitions. [2021-08-26 14:45:04,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 96 transitions. [2021-08-26 14:45:04,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:45:04,433 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:04,433 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:45:04,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-08-26 14:45:04,433 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:04,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:04,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1632557668, now seen corresponding path program 32 times [2021-08-26 14:45:04,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:04,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871365608] [2021-08-26 14:45:04,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:04,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:45:04,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:04,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871365608] [2021-08-26 14:45:04,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871365608] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:04,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:04,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:45:04,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961233006] [2021-08-26 14:45:04,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:45:04,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:04,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:45:04,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:45:04,948 INFO L87 Difference]: Start difference. First operand 61 states and 96 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:05,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:05,643 INFO L93 Difference]: Finished difference Result 87 states and 136 transitions. [2021-08-26 14:45:05,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-26 14:45:05,643 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:45:05,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:05,644 INFO L225 Difference]: With dead ends: 87 [2021-08-26 14:45:05,644 INFO L226 Difference]: Without dead ends: 51 [2021-08-26 14:45:05,644 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 675.4ms TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2021-08-26 14:45:05,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-08-26 14:45:05,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-08-26 14:45:05,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.58) internal successors, (79), 50 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:05,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 79 transitions. [2021-08-26 14:45:05,645 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 79 transitions. Word has length 21 [2021-08-26 14:45:05,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:05,645 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 79 transitions. [2021-08-26 14:45:05,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:05,645 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 79 transitions. [2021-08-26 14:45:05,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:45:05,649 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:05,649 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:45:05,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-08-26 14:45:05,649 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:05,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:05,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1707326496, now seen corresponding path program 33 times [2021-08-26 14:45:05,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:05,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198059301] [2021-08-26 14:45:05,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:05,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:45:06,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:06,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198059301] [2021-08-26 14:45:06,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198059301] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:06,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:06,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:45:06,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584022561] [2021-08-26 14:45:06,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:45:06,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:06,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:45:06,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:45:06,193 INFO L87 Difference]: Start difference. First operand 51 states and 79 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:06,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:06,773 INFO L93 Difference]: Finished difference Result 69 states and 102 transitions. [2021-08-26 14:45:06,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-26 14:45:06,773 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:45:06,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:06,773 INFO L225 Difference]: With dead ends: 69 [2021-08-26 14:45:06,773 INFO L226 Difference]: Without dead ends: 56 [2021-08-26 14:45:06,774 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 607.2ms TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2021-08-26 14:45:06,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-08-26 14:45:06,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2021-08-26 14:45:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 46 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 71 transitions. [2021-08-26 14:45:06,775 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 71 transitions. Word has length 21 [2021-08-26 14:45:06,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:06,775 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 71 transitions. [2021-08-26 14:45:06,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 71 transitions. [2021-08-26 14:45:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:45:06,776 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:06,776 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:45:06,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-08-26 14:45:06,777 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:06,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:06,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1533484158, now seen corresponding path program 34 times [2021-08-26 14:45:06,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:06,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659217687] [2021-08-26 14:45:06,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:06,778 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:45:07,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:07,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659217687] [2021-08-26 14:45:07,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659217687] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:07,265 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:07,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:45:07,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579100842] [2021-08-26 14:45:07,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:45:07,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:07,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:45:07,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:45:07,266 INFO L87 Difference]: Start difference. First operand 47 states and 71 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:07,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:07,857 INFO L93 Difference]: Finished difference Result 64 states and 95 transitions. [2021-08-26 14:45:07,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-26 14:45:07,858 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:45:07,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:07,858 INFO L225 Difference]: With dead ends: 64 [2021-08-26 14:45:07,858 INFO L226 Difference]: Without dead ends: 49 [2021-08-26 14:45:07,858 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 610.0ms TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2021-08-26 14:45:07,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-08-26 14:45:07,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2021-08-26 14:45:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 44 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2021-08-26 14:45:07,860 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 21 [2021-08-26 14:45:07,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:07,860 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2021-08-26 14:45:07,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2021-08-26 14:45:07,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:45:07,861 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:07,861 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:45:07,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-08-26 14:45:07,861 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:07,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:07,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1202475500, now seen corresponding path program 35 times [2021-08-26 14:45:07,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:07,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411423795] [2021-08-26 14:45:07,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:07,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:45:08,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:08,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411423795] [2021-08-26 14:45:08,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411423795] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:08,435 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:08,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:45:08,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744822069] [2021-08-26 14:45:08,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:45:08,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:08,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:45:08,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:45:08,436 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:09,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:09,186 INFO L93 Difference]: Finished difference Result 66 states and 99 transitions. [2021-08-26 14:45:09,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-26 14:45:09,186 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:45:09,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:09,186 INFO L225 Difference]: With dead ends: 66 [2021-08-26 14:45:09,187 INFO L226 Difference]: Without dead ends: 41 [2021-08-26 14:45:09,187 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 769.7ms TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2021-08-26 14:45:09,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-08-26 14:45:09,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-08-26 14:45:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.475) internal successors, (59), 40 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2021-08-26 14:45:09,188 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 21 [2021-08-26 14:45:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:09,188 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 59 transitions. [2021-08-26 14:45:09,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2021-08-26 14:45:09,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:45:09,189 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:09,189 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:45:09,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-08-26 14:45:09,189 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:09,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:09,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1364845110, now seen corresponding path program 36 times [2021-08-26 14:45:09,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:09,190 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284313393] [2021-08-26 14:45:09,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:09,190 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:45:09,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:09,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284313393] [2021-08-26 14:45:09,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284313393] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:09,779 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:09,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-26 14:45:09,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759238681] [2021-08-26 14:45:09,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 14:45:09,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:09,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 14:45:09,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:45:09,780 INFO L87 Difference]: Start difference. First operand 41 states and 59 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:10,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:10,389 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2021-08-26 14:45:10,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-26 14:45:10,390 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:45:10,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:10,390 INFO L225 Difference]: With dead ends: 40 [2021-08-26 14:45:10,390 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 14:45:10,390 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 711.8ms TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2021-08-26 14:45:10,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 14:45:10,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 14:45:10,390 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-08-26 14:45:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 14:45:10,391 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2021-08-26 14:45:10,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:10,391 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 14:45:10,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 14:45:10,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 14:45:10,393 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:45:10,394 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:45:10,394 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:45:10,394 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:45:10,394 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:45:10,395 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:45:10,395 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-26 14:45:10,395 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-26 14:45:10,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-08-26 14:45:10,398 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-26 14:45:10,399 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 14:45:10,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 02:45:10 BasicIcfg [2021-08-26 14:45:10,400 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 14:45:10,401 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 14:45:10,401 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 14:45:10,401 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 14:45:10,401 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:43:32" (3/4) ... [2021-08-26 14:45:10,403 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 14:45:10,407 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2021-08-26 14:45:10,411 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2021-08-26 14:45:10,411 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-08-26 14:45:10,412 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 14:45:10,412 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 14:45:10,442 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 14:45:10,442 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 14:45:10,443 INFO L168 Benchmark]: Toolchain (without parser) took 99614.13 ms. Allocated memory was 60.8 MB in the beginning and 474.0 MB in the end (delta: 413.1 MB). Free memory was 35.5 MB in the beginning and 339.0 MB in the end (delta: -303.5 MB). Peak memory consumption was 110.4 MB. Max. memory is 16.1 GB. [2021-08-26 14:45:10,444 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 60.8 MB. Free memory was 41.6 MB in the beginning and 41.5 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 14:45:10,444 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1043.79 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 35.3 MB in the beginning and 36.8 MB in the end (delta: -1.5 MB). Peak memory consumption was 18.8 MB. Max. memory is 16.1 GB. [2021-08-26 14:45:10,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.17 ms. Allocated memory is still 73.4 MB. Free memory was 36.8 MB in the beginning and 33.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 14:45:10,445 INFO L168 Benchmark]: Boogie Preprocessor took 79.91 ms. Allocated memory is still 73.4 MB. Free memory was 33.6 MB in the beginning and 47.6 MB in the end (delta: -14.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 14:45:10,445 INFO L168 Benchmark]: RCFGBuilder took 782.82 ms. Allocated memory was 73.4 MB in the beginning and 88.1 MB in the end (delta: 14.7 MB). Free memory was 47.6 MB in the beginning and 50.0 MB in the end (delta: -2.4 MB). Peak memory consumption was 19.0 MB. Max. memory is 16.1 GB. [2021-08-26 14:45:10,445 INFO L168 Benchmark]: TraceAbstraction took 97565.09 ms. Allocated memory was 88.1 MB in the beginning and 474.0 MB in the end (delta: 385.9 MB). Free memory was 49.5 MB in the beginning and 343.2 MB in the end (delta: -293.7 MB). Peak memory consumption was 91.6 MB. Max. memory is 16.1 GB. [2021-08-26 14:45:10,446 INFO L168 Benchmark]: Witness Printer took 41.60 ms. Allocated memory is still 474.0 MB. Free memory was 343.2 MB in the beginning and 339.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 14:45:10,447 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.19 ms. Allocated memory is still 60.8 MB. Free memory was 41.6 MB in the beginning and 41.5 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1043.79 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 35.3 MB in the beginning and 36.8 MB in the end (delta: -1.5 MB). Peak memory consumption was 18.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 93.17 ms. Allocated memory is still 73.4 MB. Free memory was 36.8 MB in the beginning and 33.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 79.91 ms. Allocated memory is still 73.4 MB. Free memory was 33.6 MB in the beginning and 47.6 MB in the end (delta: -14.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 782.82 ms. Allocated memory was 73.4 MB in the beginning and 88.1 MB in the end (delta: 14.7 MB). Free memory was 47.6 MB in the beginning and 50.0 MB in the end (delta: -2.4 MB). Peak memory consumption was 19.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 97565.09 ms. Allocated memory was 88.1 MB in the beginning and 474.0 MB in the end (delta: 385.9 MB). Free memory was 49.5 MB in the beginning and 343.2 MB in the end (delta: -293.7 MB). Peak memory consumption was 91.6 MB. Max. memory is 16.1 GB. * Witness Printer took 41.60 ms. Allocated memory is still 474.0 MB. Free memory was 343.2 MB in the beginning and 339.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 49133.2ms, 167 PlacesBefore, 39 PlacesAfterwards, 169 TransitionsBefore, 35 TransitionsAfterwards, 2996 CoEnabledTransitionPairs, 8 FixpointIterations, 97 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 12 TrivialYvCompositions, 18 ConcurrentYvCompositions, 6 ChoiceCompositions, 191 TotalNumberOfCompositions, 6296 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3552, positive: 3324, positive conditional: 0, positive unconditional: 3324, negative: 228, negative conditional: 0, negative unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2250, positive: 2187, positive conditional: 0, positive unconditional: 2187, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2250, positive: 2182, positive conditional: 0, positive unconditional: 2182, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36355, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 439, negative conditional: 0, negative unconditional: 439, unknown: 35903, unknown conditional: 0, unknown unconditional: 35903] ], Cache Queries: [ total: 3552, positive: 1137, positive conditional: 0, positive unconditional: 1137, negative: 165, negative conditional: 0, negative unconditional: 165, unknown: 2250, unknown conditional: 0, unknown unconditional: 2250] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 178 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 97426.0ms, OverallIterations: 46, TraceHistogramMax: 1, EmptinessCheckTime: 37.3ms, AutomataDifference: 25687.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 49188.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 913 SDtfs, 2221 SDslu, 3721 SDs, 0 SdLazy, 13222 SolverSat, 1276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9303.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 958 GetRequests, 53 SyntacticMatches, 73 SemanticMatches, 832 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2525 ImplicationChecksByTransitivity, 23157.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=495occurred in iteration=3, InterpolantAutomatonStates: 620, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 225.6ms AutomataMinimizationTime, 46 MinimizatonAttempts, 1266 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 93.6ms SsaConstructionTime, 948.0ms SatisfiabilityAnalysisTime, 20519.7ms InterpolantComputationTime, 904 NumberOfCodeBlocks, 904 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 858 ConstructedInterpolants, 0 QuantifiedInterpolants, 21662 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-08-26 14:45:10,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...