./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix030_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcaca7b-f3ab-4591-aa43-6dcc3a22476c/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcaca7b-f3ab-4591-aa43-6dcc3a22476c/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcaca7b-f3ab-4591-aa43-6dcc3a22476c/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcaca7b-f3ab-4591-aa43-6dcc3a22476c/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix030_pso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcaca7b-f3ab-4591-aa43-6dcc3a22476c/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcaca7b-f3ab-4591-aa43-6dcc3a22476c/bin/uautomizer-WNIpwEf4Nt --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 ee8d2d4036b1590dd429e125dca0467c8278ce64 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-12 23:59:29,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-12 23:59:29,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-12 23:59:29,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-12 23:59:29,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-12 23:59:29,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-12 23:59:29,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-12 23:59:29,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-12 23:59:29,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-12 23:59:29,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-12 23:59:29,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-12 23:59:29,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-12 23:59:29,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-12 23:59:29,937 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-12 23:59:29,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-12 23:59:29,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-12 23:59:29,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-12 23:59:29,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-12 23:59:29,950 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-12 23:59:29,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-12 23:59:29,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-12 23:59:29,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-12 23:59:29,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-12 23:59:29,968 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-12 23:59:29,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-12 23:59:29,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-12 23:59:29,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-12 23:59:29,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-12 23:59:29,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-12 23:59:29,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-12 23:59:29,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-12 23:59:29,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-12 23:59:29,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-12 23:59:29,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-12 23:59:29,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-12 23:59:29,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-12 23:59:29,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-12 23:59:29,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-12 23:59:29,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-12 23:59:29,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-12 23:59:29,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-12 23:59:29,990 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcaca7b-f3ab-4591-aa43-6dcc3a22476c/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-12 23:59:30,039 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-12 23:59:30,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-12 23:59:30,040 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-12 23:59:30,040 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-12 23:59:30,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-12 23:59:30,049 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-12 23:59:30,049 INFO L138 SettingsManager]: * Use SBE=true [2021-10-12 23:59:30,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-12 23:59:30,050 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-12 23:59:30,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-12 23:59:30,051 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-12 23:59:30,051 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-12 23:59:30,051 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-12 23:59:30,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-12 23:59:30,052 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-12 23:59:30,052 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-12 23:59:30,052 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-12 23:59:30,053 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-12 23:59:30,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-12 23:59:30,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-12 23:59:30,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-12 23:59:30,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-12 23:59:30,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-12 23:59:30,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-12 23:59:30,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-12 23:59:30,055 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-12 23:59:30,055 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-12 23:59:30,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-12 23:59:30,056 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-12 23:59:30,057 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-12 23:59:30,057 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcaca7b-f3ab-4591-aa43-6dcc3a22476c/bin/uautomizer-WNIpwEf4Nt/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcaca7b-f3ab-4591-aa43-6dcc3a22476c/bin/uautomizer-WNIpwEf4Nt 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 -> ee8d2d4036b1590dd429e125dca0467c8278ce64 [2021-10-12 23:59:30,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-12 23:59:30,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-12 23:59:30,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-12 23:59:30,380 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-12 23:59:30,380 INFO L275 PluginConnector]: CDTParser initialized [2021-10-12 23:59:30,381 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcaca7b-f3ab-4591-aa43-6dcc3a22476c/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/pthread-wmm/mix030_pso.opt.i [2021-10-12 23:59:30,465 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcaca7b-f3ab-4591-aa43-6dcc3a22476c/bin/uautomizer-WNIpwEf4Nt/data/dac1c2fad/fb00e73829a04eee8bed980f518d4142/FLAGc1ab0f383 [2021-10-12 23:59:31,113 INFO L306 CDTParser]: Found 1 translation units. [2021-10-12 23:59:31,114 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcaca7b-f3ab-4591-aa43-6dcc3a22476c/sv-benchmarks/c/pthread-wmm/mix030_pso.opt.i [2021-10-12 23:59:31,130 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcaca7b-f3ab-4591-aa43-6dcc3a22476c/bin/uautomizer-WNIpwEf4Nt/data/dac1c2fad/fb00e73829a04eee8bed980f518d4142/FLAGc1ab0f383 [2021-10-12 23:59:31,345 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcaca7b-f3ab-4591-aa43-6dcc3a22476c/bin/uautomizer-WNIpwEf4Nt/data/dac1c2fad/fb00e73829a04eee8bed980f518d4142 [2021-10-12 23:59:31,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-12 23:59:31,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-12 23:59:31,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-12 23:59:31,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-12 23:59:31,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-12 23:59:31,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:59:31" (1/1) ... [2021-10-12 23:59:31,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae2717c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:31, skipping insertion in model container [2021-10-12 23:59:31,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:59:31" (1/1) ... [2021-10-12 23:59:31,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-12 23:59:31,445 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-12 23:59:31,648 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcaca7b-f3ab-4591-aa43-6dcc3a22476c/sv-benchmarks/c/pthread-wmm/mix030_pso.opt.i[948,961] [2021-10-12 23:59:31,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-12 23:59:31,856 INFO L203 MainTranslator]: Completed pre-run [2021-10-12 23:59:31,868 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcaca7b-f3ab-4591-aa43-6dcc3a22476c/sv-benchmarks/c/pthread-wmm/mix030_pso.opt.i[948,961] [2021-10-12 23:59:31,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-12 23:59:32,026 INFO L208 MainTranslator]: Completed translation [2021-10-12 23:59:32,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:32 WrapperNode [2021-10-12 23:59:32,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-12 23:59:32,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-12 23:59:32,029 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-12 23:59:32,029 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-12 23:59:32,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:32" (1/1) ... [2021-10-12 23:59:32,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:32" (1/1) ... [2021-10-12 23:59:32,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-12 23:59:32,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-12 23:59:32,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-12 23:59:32,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-12 23:59:32,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:32" (1/1) ... [2021-10-12 23:59:32,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:32" (1/1) ... [2021-10-12 23:59:32,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:32" (1/1) ... [2021-10-12 23:59:32,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:32" (1/1) ... [2021-10-12 23:59:32,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:32" (1/1) ... [2021-10-12 23:59:32,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:32" (1/1) ... [2021-10-12 23:59:32,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:32" (1/1) ... [2021-10-12 23:59:32,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-12 23:59:32,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-12 23:59:32,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-12 23:59:32,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-12 23:59:32,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:32" (1/1) ... [2021-10-12 23:59:32,216 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-12 23:59:32,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcaca7b-f3ab-4591-aa43-6dcc3a22476c/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-12 23:59:32,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcaca7b-f3ab-4591-aa43-6dcc3a22476c/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-12 23:59:32,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcaca7b-f3ab-4591-aa43-6dcc3a22476c/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-12 23:59:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-12 23:59:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-12 23:59:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-12 23:59:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-12 23:59:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-12 23:59:32,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-12 23:59:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-12 23:59:32,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-12 23:59:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-12 23:59:32,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-12 23:59:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-10-12 23:59:32,297 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-10-12 23:59:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-12 23:59:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-12 23:59:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-12 23:59:32,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-12 23:59:32,300 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-12 23:59:34,383 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-12 23:59:34,383 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-12 23:59:34,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:59:34 BoogieIcfgContainer [2021-10-12 23:59:34,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-12 23:59:34,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-12 23:59:34,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-12 23:59:34,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-12 23:59:34,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:59:31" (1/3) ... [2021-10-12 23:59:34,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d43f888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:59:34, skipping insertion in model container [2021-10-12 23:59:34,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:32" (2/3) ... [2021-10-12 23:59:34,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d43f888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:59:34, skipping insertion in model container [2021-10-12 23:59:34,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:59:34" (3/3) ... [2021-10-12 23:59:34,396 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_pso.opt.i [2021-10-12 23:59:34,401 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-12 23:59:34,402 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-12 23:59:34,402 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-12 23:59:34,402 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-12 23:59:34,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,462 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,462 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,463 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,463 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,465 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,465 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,467 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,467 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,473 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,473 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,474 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,474 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,474 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,475 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,475 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,476 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,481 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,481 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,482 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,482 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,491 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,491 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,498 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,498 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,503 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,504 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,504 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,504 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,504 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,504 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,504 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,505 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,505 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,505 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,507 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,508 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,516 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,516 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,517 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,520 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,521 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:34,522 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-12 23:59:34,568 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-12 23:59:34,575 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-12 23:59:34,575 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-10-12 23:59:34,600 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-12 23:59:34,612 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 274 flow [2021-10-12 23:59:34,628 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 274 flow [2021-10-12 23:59:34,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 274 flow [2021-10-12 23:59:34,680 INFO L129 PetriNetUnfolder]: 2/123 cut-off events. [2021-10-12 23:59:34,680 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-12 23:59:34,684 INFO L84 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2021-10-12 23:59:34,689 INFO L116 LiptonReduction]: Number of co-enabled transitions 2928 [2021-10-12 23:59:43,467 INFO L131 LiptonReduction]: Checked pairs total: 7994 [2021-10-12 23:59:43,468 INFO L133 LiptonReduction]: Total number of compositions: 105 [2021-10-12 23:59:43,476 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 35 transitions, 90 flow [2021-10-12 23:59:43,699 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4130 states, 4127 states have (on average 4.1293918100315) internal successors, (17042), 4129 states have internal predecessors, (17042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:43,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 4130 states, 4127 states have (on average 4.1293918100315) internal successors, (17042), 4129 states have internal predecessors, (17042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:43,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-12 23:59:43,725 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:43,725 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:43,726 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:43,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:43,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1763146594, now seen corresponding path program 1 times [2021-10-12 23:59:43,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:43,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875605235] [2021-10-12 23:59:43,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:43,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:44,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:44,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875605235] [2021-10-12 23:59:44,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875605235] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:44,131 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:44,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-12 23:59:44,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463813005] [2021-10-12 23:59:44,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-12 23:59:44,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:44,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-12 23:59:44,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-12 23:59:44,188 INFO L87 Difference]: Start difference. First operand has 4130 states, 4127 states have (on average 4.1293918100315) internal successors, (17042), 4129 states have internal predecessors, (17042), 0 states have call successors, (0), 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 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:44,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:44,379 INFO L93 Difference]: Finished difference Result 3370 states and 13144 transitions. [2021-10-12 23:59:44,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-12 23:59:44,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-12 23:59:44,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:44,443 INFO L225 Difference]: With dead ends: 3370 [2021-10-12 23:59:44,443 INFO L226 Difference]: Without dead ends: 3250 [2021-10-12 23:59:44,444 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-12 23:59:44,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2021-10-12 23:59:44,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 3250. [2021-10-12 23:59:44,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3250 states, 3249 states have (on average 3.920590951061865) internal successors, (12738), 3249 states have internal predecessors, (12738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 12738 transitions. [2021-10-12 23:59:44,714 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 12738 transitions. Word has length 7 [2021-10-12 23:59:44,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:44,715 INFO L470 AbstractCegarLoop]: Abstraction has 3250 states and 12738 transitions. [2021-10-12 23:59:44,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 12738 transitions. [2021-10-12 23:59:44,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-12 23:59:44,720 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:44,720 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:44,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-12 23:59:44,721 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:44,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:44,722 INFO L82 PathProgramCache]: Analyzing trace with hash -364657913, now seen corresponding path program 1 times [2021-10-12 23:59:44,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:44,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661204077] [2021-10-12 23:59:44,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:44,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:44,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:44,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661204077] [2021-10-12 23:59:44,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661204077] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:44,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:44,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-12 23:59:44,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725223376] [2021-10-12 23:59:44,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-12 23:59:44,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:44,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-12 23:59:44,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-12 23:59:44,959 INFO L87 Difference]: Start difference. First operand 3250 states and 12738 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:45,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:45,045 INFO L93 Difference]: Finished difference Result 3770 states and 14324 transitions. [2021-10-12 23:59:45,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-12 23:59:45,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-12 23:59:45,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:45,086 INFO L225 Difference]: With dead ends: 3770 [2021-10-12 23:59:45,086 INFO L226 Difference]: Without dead ends: 3170 [2021-10-12 23:59:45,087 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:45,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2021-10-12 23:59:45,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 3170. [2021-10-12 23:59:45,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3170 states, 3169 states have (on average 3.904701798674661) internal successors, (12374), 3169 states have internal predecessors, (12374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 12374 transitions. [2021-10-12 23:59:45,341 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 12374 transitions. Word has length 12 [2021-10-12 23:59:45,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:45,342 INFO L470 AbstractCegarLoop]: Abstraction has 3170 states and 12374 transitions. [2021-10-12 23:59:45,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:45,343 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 12374 transitions. [2021-10-12 23:59:45,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-12 23:59:45,349 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:45,349 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:45,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-12 23:59:45,350 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:45,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:45,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1580519167, now seen corresponding path program 1 times [2021-10-12 23:59:45,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:45,351 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070886578] [2021-10-12 23:59:45,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:45,352 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:45,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:45,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070886578] [2021-10-12 23:59:45,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070886578] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:45,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:45,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-12 23:59:45,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601309929] [2021-10-12 23:59:45,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-12 23:59:45,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:45,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-12 23:59:45,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-12 23:59:45,491 INFO L87 Difference]: Start difference. First operand 3170 states and 12374 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:45,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:45,564 INFO L93 Difference]: Finished difference Result 3618 states and 13682 transitions. [2021-10-12 23:59:45,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-12 23:59:45,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-10-12 23:59:45,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:45,666 INFO L225 Difference]: With dead ends: 3618 [2021-10-12 23:59:45,666 INFO L226 Difference]: Without dead ends: 3058 [2021-10-12 23:59:45,667 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:45,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2021-10-12 23:59:45,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 3058. [2021-10-12 23:59:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3058 states, 3057 states have (on average 3.878966306836768) internal successors, (11858), 3057 states have internal predecessors, (11858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 11858 transitions. [2021-10-12 23:59:45,827 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 11858 transitions. Word has length 13 [2021-10-12 23:59:45,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:45,827 INFO L470 AbstractCegarLoop]: Abstraction has 3058 states and 11858 transitions. [2021-10-12 23:59:45,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:45,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 11858 transitions. [2021-10-12 23:59:45,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-12 23:59:45,831 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:45,832 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:45,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-12 23:59:45,832 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:45,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:45,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1958089549, now seen corresponding path program 1 times [2021-10-12 23:59:45,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:45,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490567826] [2021-10-12 23:59:45,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:45,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:45,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:45,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490567826] [2021-10-12 23:59:45,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490567826] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:45,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:45,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-12 23:59:45,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344065373] [2021-10-12 23:59:45,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-12 23:59:45,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:45,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-12 23:59:45,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-12 23:59:45,924 INFO L87 Difference]: Start difference. First operand 3058 states and 11858 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:46,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:46,056 INFO L93 Difference]: Finished difference Result 3274 states and 12344 transitions. [2021-10-12 23:59:46,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-12 23:59:46,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-10-12 23:59:46,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:46,088 INFO L225 Difference]: With dead ends: 3274 [2021-10-12 23:59:46,088 INFO L226 Difference]: Without dead ends: 2770 [2021-10-12 23:59:46,088 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:46,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2021-10-12 23:59:46,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2770. [2021-10-12 23:59:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2770 states, 2769 states have (on average 3.84037558685446) internal successors, (10634), 2769 states have internal predecessors, (10634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:46,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 10634 transitions. [2021-10-12 23:59:46,207 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 10634 transitions. Word has length 14 [2021-10-12 23:59:46,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:46,208 INFO L470 AbstractCegarLoop]: Abstraction has 2770 states and 10634 transitions. [2021-10-12 23:59:46,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:46,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 10634 transitions. [2021-10-12 23:59:46,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-12 23:59:46,212 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:46,212 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:46,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-12 23:59:46,213 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:46,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:46,213 INFO L82 PathProgramCache]: Analyzing trace with hash 571200329, now seen corresponding path program 1 times [2021-10-12 23:59:46,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:46,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808382525] [2021-10-12 23:59:46,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:46,214 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:46,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:46,383 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808382525] [2021-10-12 23:59:46,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808382525] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:46,383 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:46,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-12 23:59:46,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858471392] [2021-10-12 23:59:46,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-12 23:59:46,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:46,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-12 23:59:46,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:46,385 INFO L87 Difference]: Start difference. First operand 2770 states and 10634 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:46,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:46,535 INFO L93 Difference]: Finished difference Result 3082 states and 11544 transitions. [2021-10-12 23:59:46,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-12 23:59:46,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-10-12 23:59:46,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:46,558 INFO L225 Difference]: With dead ends: 3082 [2021-10-12 23:59:46,558 INFO L226 Difference]: Without dead ends: 2722 [2021-10-12 23:59:46,558 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 27.2ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-12 23:59:46,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2021-10-12 23:59:46,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2722. [2021-10-12 23:59:46,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2722 states, 2721 states have (on average 3.8302094818081587) internal successors, (10422), 2721 states have internal predecessors, (10422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:46,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 10422 transitions. [2021-10-12 23:59:46,739 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 10422 transitions. Word has length 15 [2021-10-12 23:59:46,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:46,739 INFO L470 AbstractCegarLoop]: Abstraction has 2722 states and 10422 transitions. [2021-10-12 23:59:46,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:46,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 10422 transitions. [2021-10-12 23:59:46,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-12 23:59:46,744 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:46,744 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:46,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-12 23:59:46,745 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:46,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:46,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1986096926, now seen corresponding path program 1 times [2021-10-12 23:59:46,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:46,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333755566] [2021-10-12 23:59:46,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:46,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:46,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:46,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:46,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333755566] [2021-10-12 23:59:46,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333755566] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:46,906 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:46,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-12 23:59:46,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347295594] [2021-10-12 23:59:46,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-12 23:59:46,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:46,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-12 23:59:46,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-12 23:59:46,908 INFO L87 Difference]: Start difference. First operand 2722 states and 10422 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:47,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:47,062 INFO L93 Difference]: Finished difference Result 2866 states and 10782 transitions. [2021-10-12 23:59:47,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-12 23:59:47,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-12 23:59:47,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:47,078 INFO L225 Difference]: With dead ends: 2866 [2021-10-12 23:59:47,078 INFO L226 Difference]: Without dead ends: 2626 [2021-10-12 23:59:47,079 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 39.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-12 23:59:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states. [2021-10-12 23:59:47,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2021-10-12 23:59:47,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2625 states have (on average 3.817904761904762) internal successors, (10022), 2625 states have internal predecessors, (10022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:47,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 10022 transitions. [2021-10-12 23:59:47,299 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 10022 transitions. Word has length 16 [2021-10-12 23:59:47,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:47,300 INFO L470 AbstractCegarLoop]: Abstraction has 2626 states and 10022 transitions. [2021-10-12 23:59:47,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:47,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 10022 transitions. [2021-10-12 23:59:47,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-12 23:59:47,306 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:47,306 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:47,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-12 23:59:47,307 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:47,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:47,308 INFO L82 PathProgramCache]: Analyzing trace with hash 527330533, now seen corresponding path program 1 times [2021-10-12 23:59:47,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:47,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206881745] [2021-10-12 23:59:47,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:47,309 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:47,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:47,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206881745] [2021-10-12 23:59:47,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206881745] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:47,660 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:47,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-12 23:59:47,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833355083] [2021-10-12 23:59:47,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-12 23:59:47,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:47,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-12 23:59:47,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-12 23:59:47,668 INFO L87 Difference]: Start difference. First operand 2626 states and 10022 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:47,818 INFO L93 Difference]: Finished difference Result 2986 states and 11162 transitions. [2021-10-12 23:59:47,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-12 23:59:47,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-12 23:59:47,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:47,836 INFO L225 Difference]: With dead ends: 2986 [2021-10-12 23:59:47,836 INFO L226 Difference]: Without dead ends: 2674 [2021-10-12 23:59:47,837 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 46.4ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-12 23:59:47,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2021-10-12 23:59:48,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2674. [2021-10-12 23:59:48,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2673 states have (on average 3.8062102506546953) internal successors, (10174), 2673 states have internal predecessors, (10174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 10174 transitions. [2021-10-12 23:59:48,048 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 10174 transitions. Word has length 16 [2021-10-12 23:59:48,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:48,048 INFO L470 AbstractCegarLoop]: Abstraction has 2674 states and 10174 transitions. [2021-10-12 23:59:48,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:48,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 10174 transitions. [2021-10-12 23:59:48,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-12 23:59:48,056 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:48,056 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:48,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-12 23:59:48,058 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:48,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:48,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1439452080, now seen corresponding path program 1 times [2021-10-12 23:59:48,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:48,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770211399] [2021-10-12 23:59:48,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:48,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:48,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:48,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:48,310 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770211399] [2021-10-12 23:59:48,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770211399] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:48,310 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:48,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-12 23:59:48,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875770408] [2021-10-12 23:59:48,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-12 23:59:48,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:48,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-12 23:59:48,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-12 23:59:48,313 INFO L87 Difference]: Start difference. First operand 2674 states and 10174 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:48,516 INFO L93 Difference]: Finished difference Result 3050 states and 11532 transitions. [2021-10-12 23:59:48,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-12 23:59:48,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-12 23:59:48,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:48,531 INFO L225 Difference]: With dead ends: 3050 [2021-10-12 23:59:48,531 INFO L226 Difference]: Without dead ends: 2858 [2021-10-12 23:59:48,532 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 36.7ms TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-12 23:59:48,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2021-10-12 23:59:48,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2746. [2021-10-12 23:59:48,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2746 states, 2745 states have (on average 3.80327868852459) internal successors, (10440), 2745 states have internal predecessors, (10440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2746 states and 10440 transitions. [2021-10-12 23:59:48,656 INFO L78 Accepts]: Start accepts. Automaton has 2746 states and 10440 transitions. Word has length 17 [2021-10-12 23:59:48,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:48,657 INFO L470 AbstractCegarLoop]: Abstraction has 2746 states and 10440 transitions. [2021-10-12 23:59:48,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2746 states and 10440 transitions. [2021-10-12 23:59:48,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-12 23:59:48,665 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:48,665 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:48,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-12 23:59:48,666 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:48,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:48,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1738660604, now seen corresponding path program 2 times [2021-10-12 23:59:48,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:48,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426310812] [2021-10-12 23:59:48,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:48,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:48,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:48,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:48,911 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426310812] [2021-10-12 23:59:48,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426310812] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:48,911 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:48,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-12 23:59:48,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003810932] [2021-10-12 23:59:48,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-12 23:59:48,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:48,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-12 23:59:48,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-12 23:59:48,915 INFO L87 Difference]: Start difference. First operand 2746 states and 10440 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:49,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:49,108 INFO L93 Difference]: Finished difference Result 3186 states and 12014 transitions. [2021-10-12 23:59:49,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-12 23:59:49,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-12 23:59:49,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:49,124 INFO L225 Difference]: With dead ends: 3186 [2021-10-12 23:59:49,125 INFO L226 Difference]: Without dead ends: 2978 [2021-10-12 23:59:49,125 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 47.7ms TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-12 23:59:49,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2021-10-12 23:59:49,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2858. [2021-10-12 23:59:49,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2858 states, 2857 states have (on average 3.8291914595729786) internal successors, (10940), 2857 states have internal predecessors, (10940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:49,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 10940 transitions. [2021-10-12 23:59:49,285 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 10940 transitions. Word has length 17 [2021-10-12 23:59:49,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:49,285 INFO L470 AbstractCegarLoop]: Abstraction has 2858 states and 10940 transitions. [2021-10-12 23:59:49,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:49,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 10940 transitions. [2021-10-12 23:59:49,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-12 23:59:49,293 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:49,293 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:49,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-12 23:59:49,293 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:49,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:49,294 INFO L82 PathProgramCache]: Analyzing trace with hash -832670622, now seen corresponding path program 3 times [2021-10-12 23:59:49,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:49,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849673045] [2021-10-12 23:59:49,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:49,295 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:49,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:49,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849673045] [2021-10-12 23:59:49,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849673045] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:49,493 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:49,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-12 23:59:49,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473442126] [2021-10-12 23:59:49,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-12 23:59:49,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:49,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-12 23:59:49,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-12 23:59:49,495 INFO L87 Difference]: Start difference. First operand 2858 states and 10940 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:49,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:49,666 INFO L93 Difference]: Finished difference Result 3386 states and 12808 transitions. [2021-10-12 23:59:49,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-12 23:59:49,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-12 23:59:49,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:49,686 INFO L225 Difference]: With dead ends: 3386 [2021-10-12 23:59:49,686 INFO L226 Difference]: Without dead ends: 3194 [2021-10-12 23:59:49,687 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 55.0ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-12 23:59:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2021-10-12 23:59:49,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2906. [2021-10-12 23:59:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2906 states, 2905 states have (on average 3.816867469879518) internal successors, (11088), 2905 states have internal predecessors, (11088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:49,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 11088 transitions. [2021-10-12 23:59:49,810 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 11088 transitions. Word has length 17 [2021-10-12 23:59:49,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:49,812 INFO L470 AbstractCegarLoop]: Abstraction has 2906 states and 11088 transitions. [2021-10-12 23:59:49,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 11088 transitions. [2021-10-12 23:59:49,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-12 23:59:49,819 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:49,819 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:49,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-12 23:59:49,820 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:49,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:49,820 INFO L82 PathProgramCache]: Analyzing trace with hash -144286800, now seen corresponding path program 4 times [2021-10-12 23:59:49,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:49,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762221941] [2021-10-12 23:59:49,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:49,821 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:50,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:50,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762221941] [2021-10-12 23:59:50,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762221941] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:50,122 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:50,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-12 23:59:50,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915960721] [2021-10-12 23:59:50,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-12 23:59:50,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:50,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-12 23:59:50,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-12 23:59:50,124 INFO L87 Difference]: Start difference. First operand 2906 states and 11088 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:50,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:50,331 INFO L93 Difference]: Finished difference Result 3802 states and 14272 transitions. [2021-10-12 23:59:50,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-12 23:59:50,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-12 23:59:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:50,353 INFO L225 Difference]: With dead ends: 3802 [2021-10-12 23:59:50,353 INFO L226 Difference]: Without dead ends: 3498 [2021-10-12 23:59:50,354 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 66.5ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-10-12 23:59:50,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2021-10-12 23:59:50,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 3170. [2021-10-12 23:59:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3170 states, 3169 states have (on average 3.782265698958662) internal successors, (11986), 3169 states have internal predecessors, (11986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 11986 transitions. [2021-10-12 23:59:50,508 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 11986 transitions. Word has length 17 [2021-10-12 23:59:50,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:50,509 INFO L470 AbstractCegarLoop]: Abstraction has 3170 states and 11986 transitions. [2021-10-12 23:59:50,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 11986 transitions. [2021-10-12 23:59:50,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-12 23:59:50,519 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:50,519 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:50,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-12 23:59:50,520 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:50,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:50,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1673294520, now seen corresponding path program 1 times [2021-10-12 23:59:50,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:50,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849988168] [2021-10-12 23:59:50,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:50,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:50,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:50,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849988168] [2021-10-12 23:59:50,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849988168] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:50,837 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:50,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-12 23:59:50,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369363451] [2021-10-12 23:59:50,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-12 23:59:50,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:50,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-12 23:59:50,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-12 23:59:50,839 INFO L87 Difference]: Start difference. First operand 3170 states and 11986 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:51,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:51,025 INFO L93 Difference]: Finished difference Result 4010 states and 15052 transitions. [2021-10-12 23:59:51,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-12 23:59:51,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-12 23:59:51,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:51,050 INFO L225 Difference]: With dead ends: 4010 [2021-10-12 23:59:51,050 INFO L226 Difference]: Without dead ends: 3882 [2021-10-12 23:59:51,050 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 53.3ms TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-12 23:59:51,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3882 states. [2021-10-12 23:59:51,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3882 to 3242. [2021-10-12 23:59:51,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3242 states, 3241 states have (on average 3.7803147176797283) internal successors, (12252), 3241 states have internal predecessors, (12252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3242 states to 3242 states and 12252 transitions. [2021-10-12 23:59:51,197 INFO L78 Accepts]: Start accepts. Automaton has 3242 states and 12252 transitions. Word has length 18 [2021-10-12 23:59:51,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:51,197 INFO L470 AbstractCegarLoop]: Abstraction has 3242 states and 12252 transitions. [2021-10-12 23:59:51,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:51,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3242 states and 12252 transitions. [2021-10-12 23:59:51,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-12 23:59:51,207 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:51,208 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:51,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-12 23:59:51,208 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:51,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:51,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1936143124, now seen corresponding path program 2 times [2021-10-12 23:59:51,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:51,209 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018516410] [2021-10-12 23:59:51,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:51,210 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:51,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:51,519 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018516410] [2021-10-12 23:59:51,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018516410] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:51,520 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:51,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-12 23:59:51,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650639022] [2021-10-12 23:59:51,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-12 23:59:51,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:51,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-12 23:59:51,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-12 23:59:51,522 INFO L87 Difference]: Start difference. First operand 3242 states and 12252 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:51,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:51,774 INFO L93 Difference]: Finished difference Result 3506 states and 13086 transitions. [2021-10-12 23:59:51,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-12 23:59:51,778 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-12 23:59:51,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:51,797 INFO L225 Difference]: With dead ends: 3506 [2021-10-12 23:59:51,797 INFO L226 Difference]: Without dead ends: 3346 [2021-10-12 23:59:51,798 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 178.5ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-10-12 23:59:51,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2021-10-12 23:59:51,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2930. [2021-10-12 23:59:51,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2930 states, 2929 states have (on average 3.7712529873677023) internal successors, (11046), 2929 states have internal predecessors, (11046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:51,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 11046 transitions. [2021-10-12 23:59:51,901 INFO L78 Accepts]: Start accepts. Automaton has 2930 states and 11046 transitions. Word has length 18 [2021-10-12 23:59:51,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:51,903 INFO L470 AbstractCegarLoop]: Abstraction has 2930 states and 11046 transitions. [2021-10-12 23:59:51,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2930 states and 11046 transitions. [2021-10-12 23:59:51,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-12 23:59:51,912 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:51,912 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:51,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-12 23:59:51,912 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:51,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:51,913 INFO L82 PathProgramCache]: Analyzing trace with hash -63096264, now seen corresponding path program 1 times [2021-10-12 23:59:51,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:51,913 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055319654] [2021-10-12 23:59:51,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:51,913 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:52,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:52,177 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055319654] [2021-10-12 23:59:52,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055319654] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:52,177 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:52,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-12 23:59:52,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883943894] [2021-10-12 23:59:52,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-12 23:59:52,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:52,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-12 23:59:52,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-12 23:59:52,179 INFO L87 Difference]: Start difference. First operand 2930 states and 11046 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:52,336 INFO L93 Difference]: Finished difference Result 3026 states and 11266 transitions. [2021-10-12 23:59:52,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-12 23:59:52,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-12 23:59:52,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:52,350 INFO L225 Difference]: With dead ends: 3026 [2021-10-12 23:59:52,350 INFO L226 Difference]: Without dead ends: 2882 [2021-10-12 23:59:52,351 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 94.1ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-10-12 23:59:52,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2021-10-12 23:59:52,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2882. [2021-10-12 23:59:52,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2882 states, 2881 states have (on average 3.7646650468587297) internal successors, (10846), 2881 states have internal predecessors, (10846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:52,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 10846 transitions. [2021-10-12 23:59:52,451 INFO L78 Accepts]: Start accepts. Automaton has 2882 states and 10846 transitions. Word has length 18 [2021-10-12 23:59:52,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:52,452 INFO L470 AbstractCegarLoop]: Abstraction has 2882 states and 10846 transitions. [2021-10-12 23:59:52,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:52,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2882 states and 10846 transitions. [2021-10-12 23:59:52,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-12 23:59:52,460 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:52,460 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:52,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-12 23:59:52,461 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:52,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:52,461 INFO L82 PathProgramCache]: Analyzing trace with hash -42786490, now seen corresponding path program 1 times [2021-10-12 23:59:52,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:52,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537876264] [2021-10-12 23:59:52,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:52,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:52,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:52,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537876264] [2021-10-12 23:59:52,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537876264] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:52,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:52,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-12 23:59:52,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997714469] [2021-10-12 23:59:52,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-12 23:59:52,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:52,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-12 23:59:52,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-12 23:59:52,530 INFO L87 Difference]: Start difference. First operand 2882 states and 10846 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:52,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:52,582 INFO L93 Difference]: Finished difference Result 4238 states and 15779 transitions. [2021-10-12 23:59:52,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-12 23:59:52,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-12 23:59:52,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:52,594 INFO L225 Difference]: With dead ends: 4238 [2021-10-12 23:59:52,594 INFO L226 Difference]: Without dead ends: 2666 [2021-10-12 23:59:52,596 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:52,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2021-10-12 23:59:52,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2522. [2021-10-12 23:59:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2522 states, 2521 states have (on average 3.6191987306624354) internal successors, (9124), 2521 states have internal predecessors, (9124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:52,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 9124 transitions. [2021-10-12 23:59:52,699 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 9124 transitions. Word has length 18 [2021-10-12 23:59:52,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:52,699 INFO L470 AbstractCegarLoop]: Abstraction has 2522 states and 9124 transitions. [2021-10-12 23:59:52,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:52,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 9124 transitions. [2021-10-12 23:59:52,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-12 23:59:52,708 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:52,708 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:52,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-12 23:59:52,709 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:52,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:52,709 INFO L82 PathProgramCache]: Analyzing trace with hash -94503770, now seen corresponding path program 2 times [2021-10-12 23:59:52,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:52,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521926502] [2021-10-12 23:59:52,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:52,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:52,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:52,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521926502] [2021-10-12 23:59:52,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521926502] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:52,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:52,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-12 23:59:52,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135607452] [2021-10-12 23:59:52,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-12 23:59:52,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:52,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-12 23:59:52,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-12 23:59:52,812 INFO L87 Difference]: Start difference. First operand 2522 states and 9124 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:52,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:52,833 INFO L93 Difference]: Finished difference Result 1940 states and 6340 transitions. [2021-10-12 23:59:52,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-12 23:59:52,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-12 23:59:52,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:52,843 INFO L225 Difference]: With dead ends: 1940 [2021-10-12 23:59:52,844 INFO L226 Difference]: Without dead ends: 1940 [2021-10-12 23:59:52,844 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-12 23:59:52,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2021-10-12 23:59:52,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1940. [2021-10-12 23:59:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1940 states, 1939 states have (on average 3.2697266632284685) internal successors, (6340), 1939 states have internal predecessors, (6340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:52,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 6340 transitions. [2021-10-12 23:59:52,915 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 6340 transitions. Word has length 18 [2021-10-12 23:59:52,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:52,915 INFO L470 AbstractCegarLoop]: Abstraction has 1940 states and 6340 transitions. [2021-10-12 23:59:52,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:52,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 6340 transitions. [2021-10-12 23:59:52,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-12 23:59:52,925 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:52,926 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:52,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-12 23:59:52,926 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:52,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:52,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1647054081, now seen corresponding path program 1 times [2021-10-12 23:59:52,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:52,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241907027] [2021-10-12 23:59:52,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:52,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:53,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:53,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:53,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241907027] [2021-10-12 23:59:53,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241907027] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:53,014 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:53,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-12 23:59:53,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657276535] [2021-10-12 23:59:53,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-12 23:59:53,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:53,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-12 23:59:53,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-12 23:59:53,017 INFO L87 Difference]: Start difference. First operand 1940 states and 6340 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:53,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:53,041 INFO L93 Difference]: Finished difference Result 1254 states and 3698 transitions. [2021-10-12 23:59:53,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-12 23:59:53,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-12 23:59:53,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:53,074 INFO L225 Difference]: With dead ends: 1254 [2021-10-12 23:59:53,074 INFO L226 Difference]: Without dead ends: 1254 [2021-10-12 23:59:53,075 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-12 23:59:53,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2021-10-12 23:59:53,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1254. [2021-10-12 23:59:53,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 2.951316839584996) internal successors, (3698), 1253 states have internal predecessors, (3698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 3698 transitions. [2021-10-12 23:59:53,107 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 3698 transitions. Word has length 19 [2021-10-12 23:59:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:53,107 INFO L470 AbstractCegarLoop]: Abstraction has 1254 states and 3698 transitions. [2021-10-12 23:59:53,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 3698 transitions. [2021-10-12 23:59:53,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-12 23:59:53,110 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:53,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-10-12 23:59:53,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-12 23:59:53,111 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:53,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:53,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1736390888, now seen corresponding path program 1 times [2021-10-12 23:59:53,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:53,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199374842] [2021-10-12 23:59:53,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:53,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:53,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:53,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199374842] [2021-10-12 23:59:53,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199374842] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:53,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:53,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-12 23:59:53,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32678967] [2021-10-12 23:59:53,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-12 23:59:53,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:53,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-12 23:59:53,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-12 23:59:53,170 INFO L87 Difference]: Start difference. First operand 1254 states and 3698 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:53,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:53,201 INFO L93 Difference]: Finished difference Result 1867 states and 5308 transitions. [2021-10-12 23:59:53,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-12 23:59:53,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-12 23:59:53,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:53,205 INFO L225 Difference]: With dead ends: 1867 [2021-10-12 23:59:53,205 INFO L226 Difference]: Without dead ends: 1282 [2021-10-12 23:59:53,205 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:53,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2021-10-12 23:59:53,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1210. [2021-10-12 23:59:53,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 1209 states have (on average 2.7841191066997517) internal successors, (3366), 1209 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 3366 transitions. [2021-10-12 23:59:53,237 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 3366 transitions. Word has length 21 [2021-10-12 23:59:53,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:53,238 INFO L470 AbstractCegarLoop]: Abstraction has 1210 states and 3366 transitions. [2021-10-12 23:59:53,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:53,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 3366 transitions. [2021-10-12 23:59:53,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-12 23:59:53,241 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:53,241 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:53,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-12 23:59:53,242 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:53,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:53,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1335495724, now seen corresponding path program 1 times [2021-10-12 23:59:53,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:53,243 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39889603] [2021-10-12 23:59:53,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:53,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:53,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:53,318 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39889603] [2021-10-12 23:59:53,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39889603] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:53,318 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:53,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-12 23:59:53,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310579909] [2021-10-12 23:59:53,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-12 23:59:53,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:53,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-12 23:59:53,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:53,320 INFO L87 Difference]: Start difference. First operand 1210 states and 3366 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:53,351 INFO L93 Difference]: Finished difference Result 918 states and 2540 transitions. [2021-10-12 23:59:53,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-12 23:59:53,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-12 23:59:53,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:53,354 INFO L225 Difference]: With dead ends: 918 [2021-10-12 23:59:53,354 INFO L226 Difference]: Without dead ends: 854 [2021-10-12 23:59:53,354 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:53,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2021-10-12 23:59:53,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 814. [2021-10-12 23:59:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 2.7601476014760147) internal successors, (2244), 813 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 2244 transitions. [2021-10-12 23:59:53,376 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 2244 transitions. Word has length 22 [2021-10-12 23:59:53,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:53,376 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 2244 transitions. [2021-10-12 23:59:53,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 2244 transitions. [2021-10-12 23:59:53,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-12 23:59:53,379 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:53,379 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:53,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-12 23:59:53,380 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:53,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:53,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1076223676, now seen corresponding path program 1 times [2021-10-12 23:59:53,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:53,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218260961] [2021-10-12 23:59:53,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:53,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:53,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:53,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218260961] [2021-10-12 23:59:53,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218260961] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:53,446 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:53,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-12 23:59:53,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682628329] [2021-10-12 23:59:53,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-12 23:59:53,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:53,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-12 23:59:53,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:53,448 INFO L87 Difference]: Start difference. First operand 814 states and 2244 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:53,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:53,480 INFO L93 Difference]: Finished difference Result 1044 states and 2769 transitions. [2021-10-12 23:59:53,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-12 23:59:53,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-12 23:59:53,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:53,482 INFO L225 Difference]: With dead ends: 1044 [2021-10-12 23:59:53,483 INFO L226 Difference]: Without dead ends: 684 [2021-10-12 23:59:53,483 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-12 23:59:53,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2021-10-12 23:59:53,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 678. [2021-10-12 23:59:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 677 states have (on average 2.553914327917282) internal successors, (1729), 677 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1729 transitions. [2021-10-12 23:59:53,499 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1729 transitions. Word has length 25 [2021-10-12 23:59:53,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:53,499 INFO L470 AbstractCegarLoop]: Abstraction has 678 states and 1729 transitions. [2021-10-12 23:59:53,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:53,499 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1729 transitions. [2021-10-12 23:59:53,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-12 23:59:53,501 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:53,501 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:53,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-12 23:59:53,502 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:53,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:53,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1635143422, now seen corresponding path program 1 times [2021-10-12 23:59:53,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:53,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478973092] [2021-10-12 23:59:53,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:53,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:53,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:53,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478973092] [2021-10-12 23:59:53,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478973092] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:53,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:53,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-12 23:59:53,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867419819] [2021-10-12 23:59:53,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-12 23:59:53,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:53,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-12 23:59:53,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-12 23:59:53,620 INFO L87 Difference]: Start difference. First operand 678 states and 1729 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:53,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:53,657 INFO L93 Difference]: Finished difference Result 622 states and 1623 transitions. [2021-10-12 23:59:53,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-12 23:59:53,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-12 23:59:53,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:53,658 INFO L225 Difference]: With dead ends: 622 [2021-10-12 23:59:53,658 INFO L226 Difference]: Without dead ends: 147 [2021-10-12 23:59:53,659 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-12 23:59:53,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-10-12 23:59:53,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 139. [2021-10-12 23:59:53,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 2.347826086956522) internal successors, (324), 138 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:53,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 324 transitions. [2021-10-12 23:59:53,662 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 324 transitions. Word has length 25 [2021-10-12 23:59:53,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:53,664 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 324 transitions. [2021-10-12 23:59:53,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:53,664 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 324 transitions. [2021-10-12 23:59:53,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-12 23:59:53,665 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:53,665 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:53,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-12 23:59:53,666 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:53,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:53,666 INFO L82 PathProgramCache]: Analyzing trace with hash 348630712, now seen corresponding path program 1 times [2021-10-12 23:59:53,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:53,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100094329] [2021-10-12 23:59:53,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:53,667 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:54,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:54,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:54,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100094329] [2021-10-12 23:59:54,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100094329] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:54,030 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:54,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-12 23:59:54,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864909502] [2021-10-12 23:59:54,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-12 23:59:54,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:54,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-12 23:59:54,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-12 23:59:54,031 INFO L87 Difference]: Start difference. First operand 139 states and 324 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:54,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:54,276 INFO L93 Difference]: Finished difference Result 203 states and 465 transitions. [2021-10-12 23:59:54,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-12 23:59:54,276 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-12 23:59:54,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:54,277 INFO L225 Difference]: With dead ends: 203 [2021-10-12 23:59:54,277 INFO L226 Difference]: Without dead ends: 93 [2021-10-12 23:59:54,277 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 220.3ms TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-10-12 23:59:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-10-12 23:59:54,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-10-12 23:59:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.130434782608696) internal successors, (196), 92 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 196 transitions. [2021-10-12 23:59:54,279 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 196 transitions. Word has length 28 [2021-10-12 23:59:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:54,280 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 196 transitions. [2021-10-12 23:59:54,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 196 transitions. [2021-10-12 23:59:54,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-12 23:59:54,280 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:54,280 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:54,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-12 23:59:54,281 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:54,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:54,281 INFO L82 PathProgramCache]: Analyzing trace with hash 216556974, now seen corresponding path program 2 times [2021-10-12 23:59:54,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:54,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877439150] [2021-10-12 23:59:54,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:54,282 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:54,334 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-12 23:59:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:54,426 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-12 23:59:54,426 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-12 23:59:54,427 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-12 23:59:54,429 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-12 23:59:54,429 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-12 23:59:54,430 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-12 23:59:54,430 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-12 23:59:54,430 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION [2021-10-12 23:59:54,431 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-12 23:59:54,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-12 23:59:54,438 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-12 23:59:54,438 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-12 23:59:54,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:59:54 BasicIcfg [2021-10-12 23:59:54,553 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-12 23:59:54,554 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-12 23:59:54,554 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-12 23:59:54,554 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-12 23:59:54,555 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:59:34" (3/4) ... [2021-10-12 23:59:54,556 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-12 23:59:54,707 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcaca7b-f3ab-4591-aa43-6dcc3a22476c/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-12 23:59:54,707 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-12 23:59:54,709 INFO L168 Benchmark]: Toolchain (without parser) took 23357.52 ms. Allocated memory was 92.3 MB in the beginning and 725.6 MB in the end (delta: 633.3 MB). Free memory was 57.7 MB in the beginning and 333.8 MB in the end (delta: -276.1 MB). Peak memory consumption was 356.5 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:54,709 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 92.3 MB. Free memory was 48.7 MB in the beginning and 48.7 MB in the end (delta: 39.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-12 23:59:54,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 672.88 ms. Allocated memory is still 92.3 MB. Free memory was 57.4 MB in the beginning and 54.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:54,710 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.22 ms. Allocated memory is still 92.3 MB. Free memory was 54.8 MB in the beginning and 51.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:54,711 INFO L168 Benchmark]: Boogie Preprocessor took 53.88 ms. Allocated memory is still 92.3 MB. Free memory was 51.8 MB in the beginning and 49.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:54,712 INFO L168 Benchmark]: RCFGBuilder took 2197.55 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 49.7 MB in the beginning and 39.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 35.4 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:54,712 INFO L168 Benchmark]: TraceAbstraction took 20165.29 ms. Allocated memory was 111.1 MB in the beginning and 725.6 MB in the end (delta: 614.5 MB). Free memory was 39.0 MB in the beginning and 353.7 MB in the end (delta: -314.7 MB). Peak memory consumption was 300.5 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:54,712 INFO L168 Benchmark]: Witness Printer took 153.43 ms. Allocated memory is still 725.6 MB. Free memory was 353.7 MB in the beginning and 333.8 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:54,715 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.28 ms. Allocated memory is still 92.3 MB. Free memory was 48.7 MB in the beginning and 48.7 MB in the end (delta: 39.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 672.88 ms. Allocated memory is still 92.3 MB. Free memory was 57.4 MB in the beginning and 54.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 105.22 ms. Allocated memory is still 92.3 MB. Free memory was 54.8 MB in the beginning and 51.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 53.88 ms. Allocated memory is still 92.3 MB. Free memory was 51.8 MB in the beginning and 49.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2197.55 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 49.7 MB in the beginning and 39.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 35.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20165.29 ms. Allocated memory was 111.1 MB in the beginning and 725.6 MB in the end (delta: 614.5 MB). Free memory was 39.0 MB in the beginning and 353.7 MB in the end (delta: -314.7 MB). Peak memory consumption was 300.5 MB. Max. memory is 16.1 GB. * Witness Printer took 153.43 ms. Allocated memory is still 725.6 MB. Free memory was 353.7 MB in the beginning and 333.8 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8839.7ms, 138 PlacesBefore, 47 PlacesAfterwards, 127 TransitionsBefore, 35 TransitionsAfterwards, 2928 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 7994 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3556, positive: 3343, positive conditional: 0, positive unconditional: 3343, negative: 213, negative conditional: 0, negative unconditional: 213, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1962, positive: 1911, positive conditional: 0, positive unconditional: 1911, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1962, positive: 1875, positive conditional: 0, positive unconditional: 1875, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 87, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 575, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 520, negative conditional: 0, negative unconditional: 520, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3556, positive: 1432, positive conditional: 0, positive unconditional: 1432, negative: 162, negative conditional: 0, negative unconditional: 162, unknown: 1962, unknown conditional: 0, unknown unconditional: 1962] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 144, Positive conditional cache size: 0, Positive unconditional cache size: 144, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t813; [L845] FCALL, FORK 0 pthread_create(&t813, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t814; [L847] FCALL, FORK 0 pthread_create(&t814, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t815; [L849] FCALL, FORK 0 pthread_create(&t815, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t816; [L851] FCALL, FORK 0 pthread_create(&t816, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L816] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L826] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L869] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L869] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L870] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L870] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L871] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L871] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L872] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L873] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L873] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 163 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 19868.3ms, OverallIterations: 23, TraceHistogramMax: 1, EmptinessCheckTime: 146.7ms, AutomataDifference: 3363.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9123.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 958 SDtfs, 1109 SDslu, 2010 SDs, 0 SdLazy, 747 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1346.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 956.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=4130occurred in iteration=0, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2587.1ms AutomataMinimizationTime, 22 MinimizatonAttempts, 2174 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 103.2ms SsaConstructionTime, 878.8ms SatisfiabilityAnalysisTime, 3152.4ms InterpolantComputationTime, 419 NumberOfCodeBlocks, 419 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 369 ConstructedInterpolants, 0 QuantifiedInterpolants, 3532 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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 RESULT: Ultimate proved your program to be incorrect! [2021-10-12 23:59:54,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcaca7b-f3ab-4591-aa43-6dcc3a22476c/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...