./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix046_tso.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_f1db5e5e-99a9-4a6c-89ff-049d6b2f64d6/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1db5e5e-99a9-4a6c-89ff-049d6b2f64d6/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_f1db5e5e-99a9-4a6c-89ff-049d6b2f64d6/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1db5e5e-99a9-4a6c-89ff-049d6b2f64d6/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix046_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1db5e5e-99a9-4a6c-89ff-049d6b2f64d6/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_f1db5e5e-99a9-4a6c-89ff-049d6b2f64d6/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 0770180054bb5b5be028b0dcba7450a3cf644c37 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:34,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-12 23:59:34,742 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-12 23:59:34,773 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-12 23:59:34,774 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-12 23:59:34,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-12 23:59:34,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-12 23:59:34,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-12 23:59:34,783 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-12 23:59:34,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-12 23:59:34,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-12 23:59:34,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-12 23:59:34,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-12 23:59:34,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-12 23:59:34,791 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-12 23:59:34,792 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-12 23:59:34,794 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-12 23:59:34,795 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-12 23:59:34,797 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-12 23:59:34,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-12 23:59:34,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-12 23:59:34,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-12 23:59:34,805 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-12 23:59:34,806 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-12 23:59:34,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-12 23:59:34,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-12 23:59:34,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-12 23:59:34,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-12 23:59:34,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-12 23:59:34,814 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-12 23:59:34,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-12 23:59:34,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-12 23:59:34,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-12 23:59:34,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-12 23:59:34,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-12 23:59:34,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-12 23:59:34,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-12 23:59:34,821 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-12 23:59:34,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-12 23:59:34,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-12 23:59:34,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-12 23:59:34,825 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1db5e5e-99a9-4a6c-89ff-049d6b2f64d6/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-12 23:59:34,848 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-12 23:59:34,849 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-12 23:59:34,849 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-12 23:59:34,849 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-12 23:59:34,851 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-12 23:59:34,851 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-12 23:59:34,852 INFO L138 SettingsManager]: * Use SBE=true [2021-10-12 23:59:34,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-12 23:59:34,852 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-12 23:59:34,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-12 23:59:34,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-12 23:59:34,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-12 23:59:34,854 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-12 23:59:34,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-12 23:59:34,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-12 23:59:34,855 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-12 23:59:34,855 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-12 23:59:34,856 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-12 23:59:34,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-12 23:59:34,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-12 23:59:34,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-12 23:59:34,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-12 23:59:34,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-12 23:59:34,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-12 23:59:34,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-12 23:59:34,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-12 23:59:34,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-12 23:59:34,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-12 23:59:34,860 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-12 23:59:34,860 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-12 23:59:34,860 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_f1db5e5e-99a9-4a6c-89ff-049d6b2f64d6/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_f1db5e5e-99a9-4a6c-89ff-049d6b2f64d6/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 -> 0770180054bb5b5be028b0dcba7450a3cf644c37 [2021-10-12 23:59:35,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-12 23:59:35,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-12 23:59:35,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-12 23:59:35,123 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-12 23:59:35,123 INFO L275 PluginConnector]: CDTParser initialized [2021-10-12 23:59:35,124 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1db5e5e-99a9-4a6c-89ff-049d6b2f64d6/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/pthread-wmm/mix046_tso.opt.i [2021-10-12 23:59:35,192 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1db5e5e-99a9-4a6c-89ff-049d6b2f64d6/bin/uautomizer-WNIpwEf4Nt/data/9579d841e/6f82f01af8dc463cac1d1688fae727da/FLAGe0d2255c4 [2021-10-12 23:59:35,737 INFO L306 CDTParser]: Found 1 translation units. [2021-10-12 23:59:35,738 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1db5e5e-99a9-4a6c-89ff-049d6b2f64d6/sv-benchmarks/c/pthread-wmm/mix046_tso.opt.i [2021-10-12 23:59:35,756 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1db5e5e-99a9-4a6c-89ff-049d6b2f64d6/bin/uautomizer-WNIpwEf4Nt/data/9579d841e/6f82f01af8dc463cac1d1688fae727da/FLAGe0d2255c4 [2021-10-12 23:59:36,058 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1db5e5e-99a9-4a6c-89ff-049d6b2f64d6/bin/uautomizer-WNIpwEf4Nt/data/9579d841e/6f82f01af8dc463cac1d1688fae727da [2021-10-12 23:59:36,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-12 23:59:36,062 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-12 23:59:36,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-12 23:59:36,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-12 23:59:36,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-12 23:59:36,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:59:36" (1/1) ... [2021-10-12 23:59:36,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aa5c316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:36, skipping insertion in model container [2021-10-12 23:59:36,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:59:36" (1/1) ... [2021-10-12 23:59:36,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-12 23:59:36,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-12 23:59:36,355 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_f1db5e5e-99a9-4a6c-89ff-049d6b2f64d6/sv-benchmarks/c/pthread-wmm/mix046_tso.opt.i[948,961] [2021-10-12 23:59:36,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-12 23:59:36,681 INFO L203 MainTranslator]: Completed pre-run [2021-10-12 23:59:36,694 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_f1db5e5e-99a9-4a6c-89ff-049d6b2f64d6/sv-benchmarks/c/pthread-wmm/mix046_tso.opt.i[948,961] [2021-10-12 23:59:36,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-12 23:59:36,845 INFO L208 MainTranslator]: Completed translation [2021-10-12 23:59:36,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:36 WrapperNode [2021-10-12 23:59:36,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-12 23:59:36,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-12 23:59:36,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-12 23:59:36,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-12 23:59:36,858 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:36" (1/1) ... [2021-10-12 23:59:36,899 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:36" (1/1) ... [2021-10-12 23:59:36,955 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-12 23:59:36,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-12 23:59:36,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-12 23:59:36,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-12 23:59:36,967 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:36" (1/1) ... [2021-10-12 23:59:36,967 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:36" (1/1) ... [2021-10-12 23:59:36,982 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:36" (1/1) ... [2021-10-12 23:59:36,986 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:36" (1/1) ... [2021-10-12 23:59:36,996 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:36" (1/1) ... [2021-10-12 23:59:37,016 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:36" (1/1) ... [2021-10-12 23:59:37,019 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:36" (1/1) ... [2021-10-12 23:59:37,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-12 23:59:37,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-12 23:59:37,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-12 23:59:37,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-12 23:59:37,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:36" (1/1) ... [2021-10-12 23:59:37,044 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-12 23:59:37,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1db5e5e-99a9-4a6c-89ff-049d6b2f64d6/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-12 23:59:37,068 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1db5e5e-99a9-4a6c-89ff-049d6b2f64d6/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:37,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1db5e5e-99a9-4a6c-89ff-049d6b2f64d6/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:37,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-12 23:59:37,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-12 23:59:37,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-12 23:59:37,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-12 23:59:37,111 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-12 23:59:37,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-12 23:59:37,111 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-12 23:59:37,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-12 23:59:37,112 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-12 23:59:37,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-12 23:59:37,112 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-10-12 23:59:37,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-10-12 23:59:37,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-12 23:59:37,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-12 23:59:37,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-12 23:59:37,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-12 23:59:37,115 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:39,098 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-12 23:59:39,099 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-12 23:59:39,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:59:39 BoogieIcfgContainer [2021-10-12 23:59:39,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-12 23:59:39,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-12 23:59:39,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-12 23:59:39,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-12 23:59:39,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:59:36" (1/3) ... [2021-10-12 23:59:39,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4837cdab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:59:39, skipping insertion in model container [2021-10-12 23:59:39,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:36" (2/3) ... [2021-10-12 23:59:39,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4837cdab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:59:39, skipping insertion in model container [2021-10-12 23:59:39,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:59:39" (3/3) ... [2021-10-12 23:59:39,118 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_tso.opt.i [2021-10-12 23:59:39,124 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-12 23:59:39,124 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-12 23:59:39,124 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-12 23:59:39,125 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-12 23:59:39,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,175 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,175 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,176 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,176 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,179 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,180 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,181 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,181 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,184 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,184 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,185 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,186 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,192 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,192 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,192 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,193 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,193 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,193 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,193 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,193 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,194 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,194 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,195 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,195 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,199 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,199 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,199 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,200 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,200 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,200 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,200 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,218 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,221 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,230 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,231 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,232 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,233 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,233 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,233 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,233 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,233 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,234 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,234 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,234 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,234 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,234 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,235 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,237 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,237 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:39,239 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-12 23:59:39,292 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-12 23:59:39,304 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:39,304 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-10-12 23:59:39,337 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-12 23:59:39,346 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 278 flow [2021-10-12 23:59:39,348 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 278 flow [2021-10-12 23:59:39,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2021-10-12 23:59:39,400 INFO L129 PetriNetUnfolder]: 2/125 cut-off events. [2021-10-12 23:59:39,400 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-12 23:59:39,404 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2021-10-12 23:59:39,409 INFO L116 LiptonReduction]: Number of co-enabled transitions 2878 [2021-10-12 23:59:49,988 INFO L131 LiptonReduction]: Checked pairs total: 6593 [2021-10-12 23:59:49,988 INFO L133 LiptonReduction]: Total number of compositions: 107 [2021-10-12 23:59:49,996 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2021-10-12 23:59:50,157 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3162 states, 3159 states have (on average 4.074707185818297) internal successors, (12872), 3161 states have internal predecessors, (12872), 0 states have call successors, (0), 0 states 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,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 3162 states, 3159 states have (on average 4.074707185818297) internal successors, (12872), 3161 states have internal predecessors, (12872), 0 states have call successors, (0), 0 states 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,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-12 23:59:50,179 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:50,180 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:50,180 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:50,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:50,185 INFO L82 PathProgramCache]: Analyzing trace with hash 667551178, now seen corresponding path program 1 times [2021-10-12 23:59:50,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:50,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606415725] [2021-10-12 23:59:50,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:50,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:50,470 INFO 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,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:50,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606415725] [2021-10-12 23:59:50,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606415725] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:50,472 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:50,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-12 23:59:50,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619570066] [2021-10-12 23:59:50,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-12 23:59:50,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:50,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-12 23:59:50,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-12 23:59:50,508 INFO L87 Difference]: Start difference. First operand has 3162 states, 3159 states have (on average 4.074707185818297) internal successors, (12872), 3161 states have internal predecessors, (12872), 0 states have call successors, (0), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:50,630 INFO L93 Difference]: Finished difference Result 2682 states and 10328 transitions. [2021-10-12 23:59:50,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-12 23:59:50,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-12 23:59:50,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:50,761 INFO L225 Difference]: With dead ends: 2682 [2021-10-12 23:59:50,762 INFO L226 Difference]: Without dead ends: 2602 [2021-10-12 23:59:50,764 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-12 23:59:50,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2021-10-12 23:59:50,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2021-10-12 23:59:50,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2602 states, 2601 states have (on average 3.869281045751634) internal successors, (10064), 2601 states have internal predecessors, (10064), 0 states have call successors, (0), 0 states 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,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2021-10-12 23:59:50,984 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2021-10-12 23:59:50,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:50,985 INFO L470 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2021-10-12 23:59:50,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2021-10-12 23:59:50,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-12 23:59:50,998 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:50,998 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:50,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-12 23:59:50,998 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:50,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:50,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1320442842, now seen corresponding path program 1 times [2021-10-12 23:59:51,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:51,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556989735] [2021-10-12 23:59:51,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:51,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:51,241 INFO 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,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:51,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556989735] [2021-10-12 23:59:51,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556989735] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:51,242 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:51,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-12 23:59:51,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47374332] [2021-10-12 23:59:51,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-12 23:59:51,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:51,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-12 23:59:51,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-12 23:59:51,245 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 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:51,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:51,324 INFO L93 Difference]: Finished difference Result 2762 states and 10352 transitions. [2021-10-12 23:59:51,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-12 23:59:51,325 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:51,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:51,351 INFO L225 Difference]: With dead ends: 2762 [2021-10-12 23:59:51,351 INFO L226 Difference]: Without dead ends: 2282 [2021-10-12 23:59:51,352 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:51,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2021-10-12 23:59:51,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2282. [2021-10-12 23:59:51,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2282 states, 2281 states have (on average 3.8088557650153443) internal successors, (8688), 2281 states have internal predecessors, (8688), 0 states have call successors, (0), 0 states 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,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8688 transitions. [2021-10-12 23:59:51,545 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8688 transitions. Word has length 12 [2021-10-12 23:59:51,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:51,545 INFO L470 AbstractCegarLoop]: Abstraction has 2282 states and 8688 transitions. [2021-10-12 23:59:51,545 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:51,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8688 transitions. [2021-10-12 23:59:51,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-12 23:59:51,549 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:51,549 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:51,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-12 23:59:51,550 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:51,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:51,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1840877363, now seen corresponding path program 1 times [2021-10-12 23:59:51,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:51,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405515893] [2021-10-12 23:59:51,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:51,551 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:51,687 INFO 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,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:51,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405515893] [2021-10-12 23:59:51,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405515893] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:51,689 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:51,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-12 23:59:51,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913982495] [2021-10-12 23:59:51,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-12 23:59:51,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:51,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-12 23:59:51,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-12 23:59:51,692 INFO L87 Difference]: Start difference. First operand 2282 states and 8688 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:51,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:51,754 INFO L93 Difference]: Finished difference Result 2538 states and 9408 transitions. [2021-10-12 23:59:51,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-12 23:59:51,755 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:51,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:51,782 INFO L225 Difference]: With dead ends: 2538 [2021-10-12 23:59:51,782 INFO L226 Difference]: Without dead ends: 2218 [2021-10-12 23:59:51,782 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:51,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2021-10-12 23:59:51,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2218. [2021-10-12 23:59:51,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2218 states, 2217 states have (on average 3.7889039242219216) internal successors, (8400), 2217 states have internal predecessors, (8400), 0 states have call successors, (0), 0 states 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,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 8400 transitions. [2021-10-12 23:59:51,898 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 8400 transitions. Word has length 14 [2021-10-12 23:59:51,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:51,899 INFO L470 AbstractCegarLoop]: Abstraction has 2218 states and 8400 transitions. [2021-10-12 23:59:51,899 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:51,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 8400 transitions. [2021-10-12 23:59:51,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-12 23:59:51,902 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:51,903 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:51,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-12 23:59:51,903 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:51,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:51,904 INFO L82 PathProgramCache]: Analyzing trace with hash -999631143, now seen corresponding path program 1 times [2021-10-12 23:59:51,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:51,904 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713484281] [2021-10-12 23:59:51,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:51,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:52,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:52,197 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713484281] [2021-10-12 23:59:52,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713484281] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:52,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:52,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-12 23:59:52,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624727982] [2021-10-12 23:59:52,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-12 23:59:52,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:52,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-12 23:59:52,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-12 23:59:52,202 INFO L87 Difference]: Start difference. First operand 2218 states and 8400 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:52,362 INFO L93 Difference]: Finished difference Result 2346 states and 8632 transitions. [2021-10-12 23:59:52,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-12 23:59:52,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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:52,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:52,386 INFO L225 Difference]: With dead ends: 2346 [2021-10-12 23:59:52,386 INFO L226 Difference]: Without dead ends: 2058 [2021-10-12 23:59:52,386 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 52.3ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-10-12 23:59:52,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2021-10-12 23:59:52,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2058. [2021-10-12 23:59:52,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2058 states, 2057 states have (on average 3.737481769567331) internal successors, (7688), 2057 states have internal predecessors, (7688), 0 states have call successors, (0), 0 states 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,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 7688 transitions. [2021-10-12 23:59:52,472 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 7688 transitions. Word has length 15 [2021-10-12 23:59:52,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:52,473 INFO L470 AbstractCegarLoop]: Abstraction has 2058 states and 7688 transitions. [2021-10-12 23:59:52,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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:52,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 7688 transitions. [2021-10-12 23:59:52,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-12 23:59:52,478 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:52,478 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:52,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-12 23:59:52,478 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:52,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:52,479 INFO L82 PathProgramCache]: Analyzing trace with hash -541204454, now seen corresponding path program 1 times [2021-10-12 23:59:52,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:52,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134811021] [2021-10-12 23:59:52,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:52,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:52,790 INFO 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,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:52,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134811021] [2021-10-12 23:59:52,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134811021] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:52,791 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:52,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-12 23:59:52,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928522880] [2021-10-12 23:59:52,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-12 23:59:52,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:52,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-12 23:59:52,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-12 23:59:52,793 INFO L87 Difference]: Start difference. First operand 2058 states and 7688 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:52,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:52,969 INFO L93 Difference]: Finished difference Result 2666 states and 9912 transitions. [2021-10-12 23:59:52,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-12 23:59:52,969 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:52,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:52,998 INFO L225 Difference]: With dead ends: 2666 [2021-10-12 23:59:52,998 INFO L226 Difference]: Without dead ends: 2538 [2021-10-12 23:59:52,998 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 72.5ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-10-12 23:59:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2021-10-12 23:59:53,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2394. [2021-10-12 23:59:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2394 states, 2393 states have (on average 3.717509402423736) internal successors, (8896), 2393 states have internal predecessors, (8896), 0 states have call successors, (0), 0 states 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,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 8896 transitions. [2021-10-12 23:59:53,113 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 8896 transitions. Word has length 17 [2021-10-12 23:59:53,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:53,113 INFO L470 AbstractCegarLoop]: Abstraction has 2394 states and 8896 transitions. [2021-10-12 23:59:53,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 8896 transitions. [2021-10-12 23:59:53,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-12 23:59:53,119 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:53,119 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:53,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-12 23:59:53,120 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:53,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:53,120 INFO L82 PathProgramCache]: Analyzing trace with hash -450043994, now seen corresponding path program 2 times [2021-10-12 23:59:53,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:53,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954885615] [2021-10-12 23:59:53,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:53,121 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:53,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:53,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:53,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954885615] [2021-10-12 23:59:53,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954885615] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:53,435 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:53,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-12 23:59:53,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093465825] [2021-10-12 23:59:53,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-12 23:59:53,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:53,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-12 23:59:53,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-12 23:59:53,436 INFO L87 Difference]: Start difference. First operand 2394 states and 8896 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:53,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:53,594 INFO L93 Difference]: Finished difference Result 2762 states and 10200 transitions. [2021-10-12 23:59:53,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-12 23:59:53,595 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:53,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:53,618 INFO L225 Difference]: With dead ends: 2762 [2021-10-12 23:59:53,619 INFO L226 Difference]: Without dead ends: 2634 [2021-10-12 23:59:53,619 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 72.4ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-10-12 23:59:53,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2021-10-12 23:59:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2346. [2021-10-12 23:59:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 2345 states have (on average 3.7287846481876334) internal successors, (8744), 2345 states have internal predecessors, (8744), 0 states have call successors, (0), 0 states 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,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 8744 transitions. [2021-10-12 23:59:53,713 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 8744 transitions. Word has length 17 [2021-10-12 23:59:53,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:53,713 INFO L470 AbstractCegarLoop]: Abstraction has 2346 states and 8744 transitions. [2021-10-12 23:59:53,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 8744 transitions. [2021-10-12 23:59:53,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-12 23:59:53,719 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:53,719 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:53,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-12 23:59:53,720 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:53,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:53,720 INFO L82 PathProgramCache]: Analyzing trace with hash -711961202, now seen corresponding path program 3 times [2021-10-12 23:59:53,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:53,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090906160] [2021-10-12 23:59:53,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:53,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:54,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:54,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:54,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090906160] [2021-10-12 23:59:54,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090906160] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:54,027 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:54,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-12 23:59:54,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748566465] [2021-10-12 23:59:54,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-12 23:59:54,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:54,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-12 23:59:54,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-12 23:59:54,029 INFO L87 Difference]: Start difference. First operand 2346 states and 8744 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:54,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:54,195 INFO L93 Difference]: Finished difference Result 2906 states and 10816 transitions. [2021-10-12 23:59:54,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-12 23:59:54,196 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:54,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:54,212 INFO L225 Difference]: With dead ends: 2906 [2021-10-12 23:59:54,212 INFO L226 Difference]: Without dead ends: 2778 [2021-10-12 23:59:54,213 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 93.9ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-10-12 23:59:54,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2021-10-12 23:59:54,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2490. [2021-10-12 23:59:54,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 2489 states have (on average 3.754118119726798) internal successors, (9344), 2489 states have internal predecessors, (9344), 0 states have call successors, (0), 0 states 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,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 9344 transitions. [2021-10-12 23:59:54,316 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 9344 transitions. Word has length 17 [2021-10-12 23:59:54,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:54,317 INFO L470 AbstractCegarLoop]: Abstraction has 2490 states and 9344 transitions. [2021-10-12 23:59:54,317 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:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 9344 transitions. [2021-10-12 23:59:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-12 23:59:54,324 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:54,325 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:54,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-12 23:59:54,325 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:54,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:54,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1500497016, now seen corresponding path program 4 times [2021-10-12 23:59:54,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:54,326 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529626781] [2021-10-12 23:59:54,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:54,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:54,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:54,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:54,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529626781] [2021-10-12 23:59:54,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529626781] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:54,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:54,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-12 23:59:54,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575362141] [2021-10-12 23:59:54,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-12 23:59:54,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:54,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-12 23:59:54,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-12 23:59:54,655 INFO L87 Difference]: Start difference. First operand 2490 states and 9344 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:54,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:54,858 INFO L93 Difference]: Finished difference Result 3066 states and 11168 transitions. [2021-10-12 23:59:54,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-12 23:59:54,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:54,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:54,899 INFO L225 Difference]: With dead ends: 3066 [2021-10-12 23:59:54,908 INFO L226 Difference]: Without dead ends: 2554 [2021-10-12 23:59:54,909 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 177.1ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-10-12 23:59:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2021-10-12 23:59:54,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 1930. [2021-10-12 23:59:54,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1929 states have (on average 3.6702954898911355) internal successors, (7080), 1929 states have internal predecessors, (7080), 0 states have call successors, (0), 0 states 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:55,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 7080 transitions. [2021-10-12 23:59:55,001 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 7080 transitions. Word has length 17 [2021-10-12 23:59:55,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:55,001 INFO L470 AbstractCegarLoop]: Abstraction has 1930 states and 7080 transitions. [2021-10-12 23:59:55,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:55,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 7080 transitions. [2021-10-12 23:59:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-12 23:59:55,007 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:55,007 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:55,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-12 23:59:55,008 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:55,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:55,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1426285594, now seen corresponding path program 1 times [2021-10-12 23:59:55,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:55,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220033350] [2021-10-12 23:59:55,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:55,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:55,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:55,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:55,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220033350] [2021-10-12 23:59:55,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220033350] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:55,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:55,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-12 23:59:55,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008219441] [2021-10-12 23:59:55,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-12 23:59:55,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:55,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-12 23:59:55,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-12 23:59:55,082 INFO L87 Difference]: Start difference. First operand 1930 states and 7080 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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:55,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:55,125 INFO L93 Difference]: Finished difference Result 1990 states and 6650 transitions. [2021-10-12 23:59:55,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-12 23:59:55,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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:55,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:55,133 INFO L225 Difference]: With dead ends: 1990 [2021-10-12 23:59:55,134 INFO L226 Difference]: Without dead ends: 1510 [2021-10-12 23:59:55,134 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:55,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2021-10-12 23:59:55,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1510. [2021-10-12 23:59:55,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1509 states have (on average 3.3121272365805168) internal successors, (4998), 1509 states have internal predecessors, (4998), 0 states have call successors, (0), 0 states 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:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 4998 transitions. [2021-10-12 23:59:55,222 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 4998 transitions. Word has length 17 [2021-10-12 23:59:55,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:55,223 INFO L470 AbstractCegarLoop]: Abstraction has 1510 states and 4998 transitions. [2021-10-12 23:59:55,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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:55,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 4998 transitions. [2021-10-12 23:59:55,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-12 23:59:55,228 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:55,228 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:55,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-12 23:59:55,229 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:55,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:55,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1185344434, now seen corresponding path program 1 times [2021-10-12 23:59:55,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:55,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20177192] [2021-10-12 23:59:55,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:55,231 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:55,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:55,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:55,318 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20177192] [2021-10-12 23:59:55,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20177192] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:55,318 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:55,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-12 23:59:55,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256648145] [2021-10-12 23:59:55,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-12 23:59:55,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:55,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-12 23:59:55,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:55,320 INFO L87 Difference]: Start difference. First operand 1510 states and 4998 transitions. Second operand has 5 states, 5 states have (on average 3.6) 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:55,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:55,377 INFO L93 Difference]: Finished difference Result 1286 states and 3894 transitions. [2021-10-12 23:59:55,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-12 23:59:55,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) 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:55,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:55,384 INFO L225 Difference]: With dead ends: 1286 [2021-10-12 23:59:55,384 INFO L226 Difference]: Without dead ends: 986 [2021-10-12 23:59:55,384 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 19.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-12 23:59:55,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2021-10-12 23:59:55,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2021-10-12 23:59:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 985 states have (on average 2.9766497461928934) internal successors, (2932), 985 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states 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:55,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2932 transitions. [2021-10-12 23:59:55,429 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2932 transitions. Word has length 18 [2021-10-12 23:59:55,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:55,429 INFO L470 AbstractCegarLoop]: Abstraction has 986 states and 2932 transitions. [2021-10-12 23:59:55,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) 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:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2932 transitions. [2021-10-12 23:59:55,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-12 23:59:55,434 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:55,434 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:55,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-12 23:59:55,435 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:55,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:55,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1732479307, now seen corresponding path program 1 times [2021-10-12 23:59:55,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:55,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528794688] [2021-10-12 23:59:55,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:55,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:55,501 INFO 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:55,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:55,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528794688] [2021-10-12 23:59:55,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528794688] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:55,502 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:55,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-12 23:59:55,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107258557] [2021-10-12 23:59:55,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-12 23:59:55,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:55,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-12 23:59:55,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-12 23:59:55,505 INFO L87 Difference]: Start difference. First operand 986 states and 2932 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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:55,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:55,544 INFO L93 Difference]: Finished difference Result 1449 states and 4154 transitions. [2021-10-12 23:59:55,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-12 23:59:55,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-12 23:59:55,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:55,549 INFO L225 Difference]: With dead ends: 1449 [2021-10-12 23:59:55,549 INFO L226 Difference]: Without dead ends: 1006 [2021-10-12 23:59:55,550 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:55,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2021-10-12 23:59:55,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 974. [2021-10-12 23:59:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 973 states have (on average 2.8221993833504624) internal successors, (2746), 973 states have internal predecessors, (2746), 0 states have call successors, (0), 0 states 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:55,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 2746 transitions. [2021-10-12 23:59:55,585 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 2746 transitions. Word has length 20 [2021-10-12 23:59:55,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:55,585 INFO L470 AbstractCegarLoop]: Abstraction has 974 states and 2746 transitions. [2021-10-12 23:59:55,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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:55,586 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 2746 transitions. [2021-10-12 23:59:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-12 23:59:55,589 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:55,590 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:55,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-12 23:59:55,590 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:55,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:55,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1352024983, now seen corresponding path program 1 times [2021-10-12 23:59:55,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:55,591 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576066540] [2021-10-12 23:59:55,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:55,592 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-12 23:59:55,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:55,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576066540] [2021-10-12 23:59:55,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576066540] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:55,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:55,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-12 23:59:55,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914974570] [2021-10-12 23:59:55,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-12 23:59:55,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:55,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-12 23:59:55,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-12 23:59:55,680 INFO L87 Difference]: Start difference. First operand 974 states and 2746 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:55,739 INFO L93 Difference]: Finished difference Result 835 states and 2312 transitions. [2021-10-12 23:59:55,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-12 23:59:55,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-12 23:59:55,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:55,742 INFO L225 Difference]: With dead ends: 835 [2021-10-12 23:59:55,743 INFO L226 Difference]: Without dead ends: 720 [2021-10-12 23:59:55,743 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 26.4ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-10-12 23:59:55,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2021-10-12 23:59:55,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2021-10-12 23:59:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 719 states have (on average 2.803894297635605) internal successors, (2016), 719 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states 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:55,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 2016 transitions. [2021-10-12 23:59:55,767 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 2016 transitions. Word has length 21 [2021-10-12 23:59:55,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:55,767 INFO L470 AbstractCegarLoop]: Abstraction has 720 states and 2016 transitions. [2021-10-12 23:59:55,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:55,768 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 2016 transitions. [2021-10-12 23:59:55,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-12 23:59:55,771 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:55,771 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 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:55,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-12 23:59:55,771 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:55,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:55,772 INFO L82 PathProgramCache]: Analyzing trace with hash -2021386923, now seen corresponding path program 1 times [2021-10-12 23:59:55,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:55,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655671154] [2021-10-12 23:59:55,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:55,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:55,928 INFO 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:55,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:55,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655671154] [2021-10-12 23:59:55,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655671154] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:55,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:55,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-12 23:59:55,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092625594] [2021-10-12 23:59:55,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-12 23:59:55,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:55,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-12 23:59:55,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-12 23:59:55,932 INFO L87 Difference]: Start difference. First operand 720 states and 2016 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:56,031 INFO L93 Difference]: Finished difference Result 686 states and 1948 transitions. [2021-10-12 23:59:56,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-12 23:59:56,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-12 23:59:56,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:56,036 INFO L225 Difference]: With dead ends: 686 [2021-10-12 23:59:56,036 INFO L226 Difference]: Without dead ends: 382 [2021-10-12 23:59:56,036 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 58.8ms TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2021-10-12 23:59:56,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-10-12 23:59:56,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2021-10-12 23:59:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 2.7716535433070866) internal successors, (1056), 381 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states 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:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1056 transitions. [2021-10-12 23:59:56,049 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1056 transitions. Word has length 24 [2021-10-12 23:59:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:56,050 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 1056 transitions. [2021-10-12 23:59:56,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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:56,050 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1056 transitions. [2021-10-12 23:59:56,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-12 23:59:56,054 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:56,054 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:56,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-12 23:59:56,055 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:56,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:56,056 INFO L82 PathProgramCache]: Analyzing trace with hash 2009918228, now seen corresponding path program 1 times [2021-10-12 23:59:56,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:56,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674803853] [2021-10-12 23:59:56,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:56,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:56,152 INFO 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:56,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:56,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674803853] [2021-10-12 23:59:56,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674803853] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:56,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:56,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-12 23:59:56,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103805240] [2021-10-12 23:59:56,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-12 23:59:56,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:56,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-12 23:59:56,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:56,155 INFO L87 Difference]: Start difference. First operand 382 states and 1056 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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:56,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:56,190 INFO L93 Difference]: Finished difference Result 457 states and 1230 transitions. [2021-10-12 23:59:56,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-12 23:59:56,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-12 23:59:56,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:56,192 INFO L225 Difference]: With dead ends: 457 [2021-10-12 23:59:56,193 INFO L226 Difference]: Without dead ends: 172 [2021-10-12 23:59:56,194 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-12 23:59:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-10-12 23:59:56,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2021-10-12 23:59:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 2.2982456140350878) internal successors, (393), 171 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:56,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 393 transitions. [2021-10-12 23:59:56,200 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 393 transitions. Word has length 27 [2021-10-12 23:59:56,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:56,201 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 393 transitions. [2021-10-12 23:59:56,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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:56,201 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 393 transitions. [2021-10-12 23:59:56,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-12 23:59:56,203 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:56,204 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:56,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-12 23:59:56,204 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:56,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:56,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1479723906, now seen corresponding path program 2 times [2021-10-12 23:59:56,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:56,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625809405] [2021-10-12 23:59:56,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:56,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:56,315 INFO 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:56,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:56,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625809405] [2021-10-12 23:59:56,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625809405] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:56,315 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:56,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-12 23:59:56,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499279911] [2021-10-12 23:59:56,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-12 23:59:56,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:56,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-12 23:59:56,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:56,319 INFO L87 Difference]: Start difference. First operand 172 states and 393 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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:56,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:56,352 INFO L93 Difference]: Finished difference Result 221 states and 499 transitions. [2021-10-12 23:59:56,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-12 23:59:56,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-12 23:59:56,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:56,354 INFO L225 Difference]: With dead ends: 221 [2021-10-12 23:59:56,354 INFO L226 Difference]: Without dead ends: 65 [2021-10-12 23:59:56,356 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-12 23:59:56,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-10-12 23:59:56,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-10-12 23:59:56,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.921875) internal successors, (123), 64 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2021-10-12 23:59:56,359 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 27 [2021-10-12 23:59:56,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:56,360 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2021-10-12 23:59:56,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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:56,360 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2021-10-12 23:59:56,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-12 23:59:56,361 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:56,361 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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:56,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-12 23:59:56,362 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-12 23:59:56,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:56,362 INFO L82 PathProgramCache]: Analyzing trace with hash -493015646, now seen corresponding path program 3 times [2021-10-12 23:59:56,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:56,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183938570] [2021-10-12 23:59:56,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:56,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:56,432 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-12 23:59:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:56,560 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-12 23:59:56,560 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-12 23:59:56,561 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-12 23:59:56,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-12 23:59:56,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-12 23:59:56,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-12 23:59:56,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-12 23:59:56,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION [2021-10-12 23:59:56,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-12 23:59:56,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-12 23:59:56,573 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-12 23:59:56,573 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-12 23:59:56,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:59:56 BasicIcfg [2021-10-12 23:59:56,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-12 23:59:56,757 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-12 23:59:56,757 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-12 23:59:56,757 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-12 23:59:56,758 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:39" (3/4) ... [2021-10-12 23:59:56,759 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-12 23:59:56,889 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1db5e5e-99a9-4a6c-89ff-049d6b2f64d6/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-12 23:59:56,890 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-12 23:59:56,891 INFO L168 Benchmark]: Toolchain (without parser) took 20828.60 ms. Allocated memory was 121.6 MB in the beginning and 323.0 MB in the end (delta: 201.3 MB). Free memory was 84.3 MB in the beginning and 139.9 MB in the end (delta: -55.6 MB). Peak memory consumption was 144.1 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:56,892 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 121.6 MB. Free memory is still 102.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-12 23:59:56,893 INFO L168 Benchmark]: CACSL2BoogieTranslator took 784.50 ms. Allocated memory is still 121.6 MB. Free memory was 84.1 MB in the beginning and 85.4 MB in the end (delta: -1.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:56,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.08 ms. Allocated memory is still 121.6 MB. Free memory was 85.4 MB in the beginning and 82.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:56,896 INFO L168 Benchmark]: Boogie Preprocessor took 71.33 ms. Allocated memory is still 121.6 MB. Free memory was 82.4 MB in the beginning and 80.3 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:56,896 INFO L168 Benchmark]: RCFGBuilder took 2074.19 ms. Allocated memory is still 121.6 MB. Free memory was 80.3 MB in the beginning and 84.8 MB in the end (delta: -4.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:56,897 INFO L168 Benchmark]: TraceAbstraction took 17648.35 ms. Allocated memory was 121.6 MB in the beginning and 323.0 MB in the end (delta: 201.3 MB). Free memory was 84.1 MB in the beginning and 158.8 MB in the end (delta: -74.7 MB). Peak memory consumption was 126.1 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:56,897 INFO L168 Benchmark]: Witness Printer took 133.12 ms. Allocated memory is still 323.0 MB. Free memory was 158.8 MB in the beginning and 139.9 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:56,899 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.25 ms. Allocated memory is still 121.6 MB. Free memory is still 102.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 784.50 ms. Allocated memory is still 121.6 MB. Free memory was 84.1 MB in the beginning and 85.4 MB in the end (delta: -1.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 109.08 ms. Allocated memory is still 121.6 MB. Free memory was 85.4 MB in the beginning and 82.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 71.33 ms. Allocated memory is still 121.6 MB. Free memory was 82.4 MB in the beginning and 80.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2074.19 ms. Allocated memory is still 121.6 MB. Free memory was 80.3 MB in the beginning and 84.8 MB in the end (delta: -4.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17648.35 ms. Allocated memory was 121.6 MB in the beginning and 323.0 MB in the end (delta: 201.3 MB). Free memory was 84.1 MB in the beginning and 158.8 MB in the end (delta: -74.7 MB). Peak memory consumption was 126.1 MB. Max. memory is 16.1 GB. * Witness Printer took 133.12 ms. Allocated memory is still 323.0 MB. Free memory was 158.8 MB in the beginning and 139.9 MB in the end (delta: 18.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: 10640.9ms, 140 PlacesBefore, 46 PlacesAfterwards, 129 TransitionsBefore, 34 TransitionsAfterwards, 2878 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 6593 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3871, positive: 3700, positive conditional: 0, positive unconditional: 3700, negative: 171, negative conditional: 0, negative unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2005, positive: 1956, positive conditional: 0, positive unconditional: 1956, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2005, positive: 1934, positive conditional: 0, positive unconditional: 1934, negative: 71, negative conditional: 0, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 71, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 513, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 486, negative conditional: 0, negative unconditional: 486, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3871, positive: 1744, positive conditional: 0, positive unconditional: 1744, negative: 122, negative conditional: 0, negative unconditional: 122, unknown: 2005, unknown conditional: 0, unknown unconditional: 2005] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 226, Positive conditional cache size: 0, Positive unconditional cache size: 226, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1245; [L847] FCALL, FORK 0 pthread_create(&t1245, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1246; [L849] FCALL, FORK 0 pthread_create(&t1246, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1247; [L851] FCALL, FORK 0 pthread_create(&t1247, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1248; [L853] FCALL, FORK 0 pthread_create(&t1248, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L770] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L782] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$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_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 853]: 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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 17278.7ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 89.1ms, AutomataDifference: 1910.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10853.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 560 SDtfs, 921 SDslu, 1393 SDs, 0 SdLazy, 395 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 667.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 662.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3162occurred in iteration=0, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1214.9ms AutomataMinimizationTime, 15 MinimizatonAttempts, 1376 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 75.6ms SsaConstructionTime, 653.0ms SatisfiabilityAnalysisTime, 2026.5ms InterpolantComputationTime, 299 NumberOfCodeBlocks, 299 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 1953 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:56,960 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1db5e5e-99a9-4a6c-89ff-049d6b2f64d6/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...