./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff84ae02-1051-4517-aff4-2e643e2c69f2/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff84ae02-1051-4517-aff4-2e643e2c69f2/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff84ae02-1051-4517-aff4-2e643e2c69f2/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff84ae02-1051-4517-aff4-2e643e2c69f2/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff84ae02-1051-4517-aff4-2e643e2c69f2/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff84ae02-1051-4517-aff4-2e643e2c69f2/bin/uautomizer-Dbtcem3rbc --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 5adc3402a12b42bc2aef7c382784898827eb467d1d3955bed162b3bd231708de --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:53:09,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:53:09,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:53:09,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:53:09,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:53:09,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:53:09,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:53:09,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:53:09,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:53:09,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:53:09,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:53:09,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:53:09,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:53:09,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:53:09,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:53:09,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:53:09,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:53:09,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:53:09,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:53:09,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:53:09,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:53:09,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:53:09,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:53:09,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:53:09,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:53:09,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:53:10,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:53:10,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:53:10,002 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:53:10,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:53:10,004 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:53:10,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:53:10,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:53:10,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:53:10,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:53:10,011 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:53:10,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:53:10,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:53:10,012 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:53:10,013 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:53:10,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:53:10,015 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff84ae02-1051-4517-aff4-2e643e2c69f2/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:53:10,056 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:53:10,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:53:10,060 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:53:10,060 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:53:10,061 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:53:10,061 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:53:10,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:53:10,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:53:10,062 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:53:10,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:53:10,064 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:53:10,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:53:10,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:53:10,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:53:10,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:53:10,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:53:10,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:53:10,065 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:53:10,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:53:10,066 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:53:10,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:53:10,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:53:10,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:53:10,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:53:10,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:10,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:53:10,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:53:10,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:53:10,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:53:10,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:53:10,070 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:53:10,070 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:53:10,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:53:10,070 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_ff84ae02-1051-4517-aff4-2e643e2c69f2/bin/uautomizer-Dbtcem3rbc/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_ff84ae02-1051-4517-aff4-2e643e2c69f2/bin/uautomizer-Dbtcem3rbc 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 -> 5adc3402a12b42bc2aef7c382784898827eb467d1d3955bed162b3bd231708de [2022-11-02 20:53:10,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:53:10,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:53:10,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:53:10,408 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:53:10,409 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:53:10,411 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff84ae02-1051-4517-aff4-2e643e2c69f2/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2022-11-02 20:53:10,476 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff84ae02-1051-4517-aff4-2e643e2c69f2/bin/uautomizer-Dbtcem3rbc/data/25fcf50d8/1fe8106b92ad41d9b95a3e54f7722fda/FLAG8a5694d73 [2022-11-02 20:53:10,988 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:53:10,989 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff84ae02-1051-4517-aff4-2e643e2c69f2/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2022-11-02 20:53:11,004 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff84ae02-1051-4517-aff4-2e643e2c69f2/bin/uautomizer-Dbtcem3rbc/data/25fcf50d8/1fe8106b92ad41d9b95a3e54f7722fda/FLAG8a5694d73 [2022-11-02 20:53:11,331 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff84ae02-1051-4517-aff4-2e643e2c69f2/bin/uautomizer-Dbtcem3rbc/data/25fcf50d8/1fe8106b92ad41d9b95a3e54f7722fda [2022-11-02 20:53:11,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:53:11,335 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:53:11,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:11,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:53:11,341 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:53:11,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44e6640b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11, skipping insertion in model container [2022-11-02 20:53:11,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:53:11,403 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:53:11,601 WARN L230 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_ff84ae02-1051-4517-aff4-2e643e2c69f2/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c[643,656] [2022-11-02 20:53:11,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:11,656 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:53:11,668 WARN L230 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_ff84ae02-1051-4517-aff4-2e643e2c69f2/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c[643,656] [2022-11-02 20:53:11,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:11,703 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:53:11,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11 WrapperNode [2022-11-02 20:53:11,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:11,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:11,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:53:11,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:53:11,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,721 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,743 INFO L138 Inliner]: procedures = 29, calls = 32, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 188 [2022-11-02 20:53:11,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:11,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:53:11,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:53:11,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:53:11,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,767 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:53:11,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:53:11,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:53:11,772 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:53:11,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:11,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff84ae02-1051-4517-aff4-2e643e2c69f2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:11,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff84ae02-1051-4517-aff4-2e643e2c69f2/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:53:11,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff84ae02-1051-4517-aff4-2e643e2c69f2/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:53:11,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:53:11,885 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-02 20:53:11,885 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-02 20:53:11,885 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-02 20:53:11,886 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-02 20:53:11,886 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-02 20:53:11,886 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-02 20:53:11,886 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-02 20:53:11,888 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-02 20:53:11,888 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-02 20:53:11,888 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-02 20:53:11,888 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-02 20:53:11,888 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-02 20:53:11,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:53:11,889 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-02 20:53:11,889 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-02 20:53:11,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:53:11,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:53:11,889 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-02 20:53:11,890 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-02 20:53:11,976 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:53:11,978 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:53:12,401 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:53:12,412 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:53:12,415 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:53:12,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:12 BoogieIcfgContainer [2022-11-02 20:53:12,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:53:12,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:53:12,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:53:12,426 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:53:12,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:53:11" (1/3) ... [2022-11-02 20:53:12,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5867d84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:53:12, skipping insertion in model container [2022-11-02 20:53:12,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11" (2/3) ... [2022-11-02 20:53:12,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5867d84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:53:12, skipping insertion in model container [2022-11-02 20:53:12,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:12" (3/3) ... [2022-11-02 20:53:12,430 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2.c [2022-11-02 20:53:12,451 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:53:12,452 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:53:12,539 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:53:12,549 INFO L357 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, mAutomataTypeConcurrency=PETRI_NET, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4200a364, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:53:12,549 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:53:12,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 79 states have (on average 1.518987341772152) internal successors, (120), 84 states have internal predecessors, (120), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-02 20:53:12,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:53:12,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:12,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:12,582 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:12,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:12,589 INFO L85 PathProgramCache]: Analyzing trace with hash -651219767, now seen corresponding path program 1 times [2022-11-02 20:53:12,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:12,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004034098] [2022-11-02 20:53:12,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:12,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:12,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:53:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:12,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:53:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:12,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:53:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:12,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:13,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:53:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:13,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:53:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:13,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:53:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:13,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:13,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004034098] [2022-11-02 20:53:13,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004034098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:13,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:13,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:53:13,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38043250] [2022-11-02 20:53:13,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:13,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:53:13,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:13,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:53:13,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:53:13,135 INFO L87 Difference]: Start difference. First operand has 104 states, 79 states have (on average 1.518987341772152) internal successors, (120), 84 states have internal predecessors, (120), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:53:13,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:13,612 INFO L93 Difference]: Finished difference Result 217 states and 317 transitions. [2022-11-02 20:53:13,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:53:13,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2022-11-02 20:53:13,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:13,633 INFO L225 Difference]: With dead ends: 217 [2022-11-02 20:53:13,633 INFO L226 Difference]: Without dead ends: 116 [2022-11-02 20:53:13,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:53:13,643 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 210 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:13,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 290 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:53:13,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-02 20:53:13,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2022-11-02 20:53:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.4) internal successors, (105), 78 states have internal predecessors, (105), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-02 20:53:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2022-11-02 20:53:13,731 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 58 [2022-11-02 20:53:13,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:13,732 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2022-11-02 20:53:13,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:53:13,734 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2022-11-02 20:53:13,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:53:13,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:13,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:13,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:53:13,742 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:13,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:13,746 INFO L85 PathProgramCache]: Analyzing trace with hash -635701049, now seen corresponding path program 1 times [2022-11-02 20:53:13,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:13,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964202613] [2022-11-02 20:53:13,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:13,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:13,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:53:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:13,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:53:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:13,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:53:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:13,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:13,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:53:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:53:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:53:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:14,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:14,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964202613] [2022-11-02 20:53:14,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964202613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:14,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:14,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:53:14,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205412258] [2022-11-02 20:53:14,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:14,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:53:14,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:14,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:53:14,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:53:14,034 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:53:14,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:14,730 INFO L93 Difference]: Finished difference Result 323 states and 448 transitions. [2022-11-02 20:53:14,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:53:14,731 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2022-11-02 20:53:14,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:14,734 INFO L225 Difference]: With dead ends: 323 [2022-11-02 20:53:14,734 INFO L226 Difference]: Without dead ends: 234 [2022-11-02 20:53:14,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:53:14,737 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 478 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:14,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 352 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:53:14,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-11-02 20:53:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 194. [2022-11-02 20:53:14,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 156 states have internal predecessors, (209), 26 states have call successors, (26), 15 states have call predecessors, (26), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2022-11-02 20:53:14,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 263 transitions. [2022-11-02 20:53:14,773 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 263 transitions. Word has length 58 [2022-11-02 20:53:14,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:14,787 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 263 transitions. [2022-11-02 20:53:14,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:53:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 263 transitions. [2022-11-02 20:53:14,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:53:14,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:14,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:14,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:53:14,791 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:14,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:14,791 INFO L85 PathProgramCache]: Analyzing trace with hash 126948582, now seen corresponding path program 1 times [2022-11-02 20:53:14,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:14,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676552614] [2022-11-02 20:53:14,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:14,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:15,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:53:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:15,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:53:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:15,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:53:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:15,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:15,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:53:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:15,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:53:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:15,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:53:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:15,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:15,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:15,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676552614] [2022-11-02 20:53:15,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676552614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:15,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:15,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:53:15,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914514391] [2022-11-02 20:53:15,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:15,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:53:15,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:15,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:53:15,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:53:15,128 INFO L87 Difference]: Start difference. First operand 194 states and 263 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:53:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:15,871 INFO L93 Difference]: Finished difference Result 543 states and 741 transitions. [2022-11-02 20:53:15,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:53:15,872 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2022-11-02 20:53:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:15,881 INFO L225 Difference]: With dead ends: 543 [2022-11-02 20:53:15,881 INFO L226 Difference]: Without dead ends: 365 [2022-11-02 20:53:15,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:53:15,891 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 438 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:15,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 646 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:53:15,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-11-02 20:53:15,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 290. [2022-11-02 20:53:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 234 states have internal predecessors, (312), 37 states have call successors, (37), 22 states have call predecessors, (37), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2022-11-02 20:53:15,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 396 transitions. [2022-11-02 20:53:15,999 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 396 transitions. Word has length 58 [2022-11-02 20:53:15,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:16,000 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 396 transitions. [2022-11-02 20:53:16,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:53:16,000 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 396 transitions. [2022-11-02 20:53:16,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:53:16,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:16,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:16,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:53:16,009 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:16,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:16,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1020434920, now seen corresponding path program 1 times [2022-11-02 20:53:16,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:16,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995082511] [2022-11-02 20:53:16,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:16,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:53:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:53:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:53:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:53:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:53:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:53:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:16,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:16,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995082511] [2022-11-02 20:53:16,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995082511] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:16,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:16,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:53:16,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451799150] [2022-11-02 20:53:16,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:16,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:53:16,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:16,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:53:16,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:53:16,182 INFO L87 Difference]: Start difference. First operand 290 states and 396 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:53:16,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:16,700 INFO L93 Difference]: Finished difference Result 592 states and 811 transitions. [2022-11-02 20:53:16,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:53:16,701 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2022-11-02 20:53:16,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:16,704 INFO L225 Difference]: With dead ends: 592 [2022-11-02 20:53:16,704 INFO L226 Difference]: Without dead ends: 324 [2022-11-02 20:53:16,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:53:16,716 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 114 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:16,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 533 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:53:16,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-11-02 20:53:16,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 295. [2022-11-02 20:53:16,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 238 states have internal predecessors, (314), 37 states have call successors, (37), 22 states have call predecessors, (37), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2022-11-02 20:53:16,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 399 transitions. [2022-11-02 20:53:16,763 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 399 transitions. Word has length 58 [2022-11-02 20:53:16,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:16,765 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 399 transitions. [2022-11-02 20:53:16,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:53:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 399 transitions. [2022-11-02 20:53:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:53:16,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:16,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:16,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:53:16,769 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:16,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:16,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1295194534, now seen corresponding path program 1 times [2022-11-02 20:53:16,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:16,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457650510] [2022-11-02 20:53:16,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:16,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:53:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:53:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:53:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:53:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:53:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:53:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:17,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:17,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457650510] [2022-11-02 20:53:17,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457650510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:17,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:17,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:53:17,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454297993] [2022-11-02 20:53:17,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:17,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:53:17,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:17,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:53:17,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:53:17,060 INFO L87 Difference]: Start difference. First operand 295 states and 399 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-02 20:53:18,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:18,914 INFO L93 Difference]: Finished difference Result 1963 states and 2677 transitions. [2022-11-02 20:53:18,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:53:18,914 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2022-11-02 20:53:18,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:18,923 INFO L225 Difference]: With dead ends: 1963 [2022-11-02 20:53:18,923 INFO L226 Difference]: Without dead ends: 1690 [2022-11-02 20:53:18,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-11-02 20:53:18,926 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 1152 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:18,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 869 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:53:18,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2022-11-02 20:53:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1432. [2022-11-02 20:53:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1128 states have (on average 1.3200354609929077) internal successors, (1489), 1155 states have internal predecessors, (1489), 154 states have call successors, (154), 124 states have call predecessors, (154), 149 states have return successors, (234), 155 states have call predecessors, (234), 151 states have call successors, (234) [2022-11-02 20:53:19,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1877 transitions. [2022-11-02 20:53:19,077 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1877 transitions. Word has length 58 [2022-11-02 20:53:19,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:19,077 INFO L495 AbstractCegarLoop]: Abstraction has 1432 states and 1877 transitions. [2022-11-02 20:53:19,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-02 20:53:19,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1877 transitions. [2022-11-02 20:53:19,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:53:19,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:19,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:19,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:53:19,079 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:19,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:19,080 INFO L85 PathProgramCache]: Analyzing trace with hash 323519847, now seen corresponding path program 1 times [2022-11-02 20:53:19,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:19,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182116495] [2022-11-02 20:53:19,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:19,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:19,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:53:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:19,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:53:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:19,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:53:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:19,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:19,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:53:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:19,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:53:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:19,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:53:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:19,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:19,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:19,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182116495] [2022-11-02 20:53:19,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182116495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:19,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:19,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:53:19,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506040750] [2022-11-02 20:53:19,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:19,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:53:19,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:19,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:53:19,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:53:19,235 INFO L87 Difference]: Start difference. First operand 1432 states and 1877 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:53:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:19,831 INFO L93 Difference]: Finished difference Result 3031 states and 3996 transitions. [2022-11-02 20:53:19,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:53:19,832 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2022-11-02 20:53:19,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:19,840 INFO L225 Difference]: With dead ends: 3031 [2022-11-02 20:53:19,840 INFO L226 Difference]: Without dead ends: 1621 [2022-11-02 20:53:19,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:53:19,844 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 162 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:19,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 481 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:53:19,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2022-11-02 20:53:19,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1477. [2022-11-02 20:53:19,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1164 states have (on average 1.302405498281787) internal successors, (1516), 1191 states have internal predecessors, (1516), 154 states have call successors, (154), 124 states have call predecessors, (154), 158 states have return successors, (246), 164 states have call predecessors, (246), 151 states have call successors, (246) [2022-11-02 20:53:19,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 1916 transitions. [2022-11-02 20:53:19,972 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 1916 transitions. Word has length 58 [2022-11-02 20:53:19,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:19,973 INFO L495 AbstractCegarLoop]: Abstraction has 1477 states and 1916 transitions. [2022-11-02 20:53:19,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:53:19,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1916 transitions. [2022-11-02 20:53:19,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:53:19,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:19,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:19,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:53:19,975 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:19,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:19,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1481918487, now seen corresponding path program 1 times [2022-11-02 20:53:19,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:19,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398403391] [2022-11-02 20:53:19,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:19,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:20,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:53:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:20,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:53:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:20,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:53:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:20,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:20,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:53:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:20,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:53:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:20,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:53:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:20,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:20,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398403391] [2022-11-02 20:53:20,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398403391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:20,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:20,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:53:20,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30376272] [2022-11-02 20:53:20,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:20,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:53:20,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:20,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:53:20,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:53:20,156 INFO L87 Difference]: Start difference. First operand 1477 states and 1916 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:53:21,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:21,080 INFO L93 Difference]: Finished difference Result 2912 states and 3753 transitions. [2022-11-02 20:53:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:53:21,081 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2022-11-02 20:53:21,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:21,092 INFO L225 Difference]: With dead ends: 2912 [2022-11-02 20:53:21,092 INFO L226 Difference]: Without dead ends: 1676 [2022-11-02 20:53:21,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:53:21,099 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 333 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:21,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 471 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:53:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2022-11-02 20:53:21,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1455. [2022-11-02 20:53:21,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1455 states, 1150 states have (on average 1.297391304347826) internal successors, (1492), 1171 states have internal predecessors, (1492), 154 states have call successors, (154), 124 states have call predecessors, (154), 150 states have return successors, (230), 162 states have call predecessors, (230), 151 states have call successors, (230) [2022-11-02 20:53:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 1876 transitions. [2022-11-02 20:53:21,230 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 1876 transitions. Word has length 58 [2022-11-02 20:53:21,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:21,232 INFO L495 AbstractCegarLoop]: Abstraction has 1455 states and 1876 transitions. [2022-11-02 20:53:21,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:53:21,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1876 transitions. [2022-11-02 20:53:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:53:21,233 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:21,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:21,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:53:21,235 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:21,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:21,235 INFO L85 PathProgramCache]: Analyzing trace with hash 818904103, now seen corresponding path program 1 times [2022-11-02 20:53:21,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:21,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658757340] [2022-11-02 20:53:21,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:21,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:53:21,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:53:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:53:21,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:53:21,310 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:53:21,311 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:53:21,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:53:21,317 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:21,321 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:53:21,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:53:21 BoogieIcfgContainer [2022-11-02 20:53:21,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:53:21,422 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:53:21,422 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:53:21,423 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:53:21,423 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:12" (3/4) ... [2022-11-02 20:53:21,425 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 20:53:21,493 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff84ae02-1051-4517-aff4-2e643e2c69f2/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:53:21,493 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:53:21,493 INFO L158 Benchmark]: Toolchain (without parser) took 10158.48ms. Allocated memory was 111.1MB in the beginning and 211.8MB in the end (delta: 100.7MB). Free memory was 74.8MB in the beginning and 68.9MB in the end (delta: 6.0MB). Peak memory consumption was 104.9MB. Max. memory is 16.1GB. [2022-11-02 20:53:21,494 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 111.1MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:53:21,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.60ms. Allocated memory is still 111.1MB. Free memory was 74.6MB in the beginning and 85.3MB in the end (delta: -10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:53:21,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.31ms. Allocated memory is still 111.1MB. Free memory was 85.3MB in the beginning and 83.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:53:21,495 INFO L158 Benchmark]: Boogie Preprocessor took 26.90ms. Allocated memory is still 111.1MB. Free memory was 83.9MB in the beginning and 82.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:53:21,495 INFO L158 Benchmark]: RCFGBuilder took 646.95ms. Allocated memory is still 111.1MB. Free memory was 82.2MB in the beginning and 65.0MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-02 20:53:21,495 INFO L158 Benchmark]: TraceAbstraction took 8999.95ms. Allocated memory was 111.1MB in the beginning and 211.8MB in the end (delta: 100.7MB). Free memory was 64.4MB in the beginning and 75.2MB in the end (delta: -10.8MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB. [2022-11-02 20:53:21,496 INFO L158 Benchmark]: Witness Printer took 70.59ms. Allocated memory is still 211.8MB. Free memory was 75.2MB in the beginning and 68.9MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:53:21,498 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.30ms. Allocated memory is still 111.1MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.60ms. Allocated memory is still 111.1MB. Free memory was 74.6MB in the beginning and 85.3MB in the end (delta: -10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.31ms. Allocated memory is still 111.1MB. Free memory was 85.3MB in the beginning and 83.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.90ms. Allocated memory is still 111.1MB. Free memory was 83.9MB in the beginning and 82.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 646.95ms. Allocated memory is still 111.1MB. Free memory was 82.2MB in the beginning and 65.0MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8999.95ms. Allocated memory was 111.1MB in the beginning and 211.8MB in the end (delta: 100.7MB). Free memory was 64.4MB in the beginning and 75.2MB in the end (delta: -10.8MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB. * Witness Printer took 70.59ms. Allocated memory is still 211.8MB. Free memory was 75.2MB in the beginning and 68.9MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int q_buf_0 ; [L26] int q_free ; [L27] int q_read_ev ; [L28] int q_write_ev ; [L29] int q_req_up ; [L30] int q_ev ; [L51] int p_num_write ; [L52] int p_last_write ; [L53] int p_dw_st ; [L54] int p_dw_pc ; [L55] int p_dw_i ; [L56] int c_num_read ; [L57] int c_last_read ; [L58] int c_dr_st ; [L59] int c_dr_pc ; [L60] int c_dr_i ; [L164] static int a_t ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0] [L466] int __retres1 ; [L470] CALL init_model() [L452] q_free = 1 [L453] q_write_ev = 2 [L454] q_read_ev = q_write_ev [L455] p_num_write = 0 [L456] p_dw_pc = 0 [L457] p_dw_i = 1 [L458] c_num_read = 0 [L459] c_dr_pc = 0 [L460] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L470] RET init_model() [L471] CALL start_simulation() [L406] int kernel_st ; [L407] int tmp ; [L411] kernel_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L412] CALL update_channels() VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L222] COND FALSE !((int )q_req_up == 1) VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L412] RET update_channels() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L413] CALL init_threads() [L237] COND TRUE (int )p_dw_i == 1 [L238] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L242] COND TRUE (int )c_dr_i == 1 [L243] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L413] RET init_threads() [L414] CALL fire_delta_events() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L275] COND FALSE !((int )q_read_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L280] COND FALSE !((int )q_write_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L414] RET fire_delta_events() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L415] CALL activate_threads() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L308] int tmp ; [L309] int tmp___0 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L313] CALL, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L62] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L65] COND FALSE !((int )p_dw_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L75] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L77] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L313] RET, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, is_do_write_p_triggered()=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L313] tmp = is_do_write_p_triggered() [L315] COND FALSE !(\read(tmp)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0] [L321] CALL, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L81] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L84] COND FALSE !((int )c_dr_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L94] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L96] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L321] RET, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, is_do_read_c_triggered()=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0] [L321] tmp___0 = is_do_read_c_triggered() [L323] COND FALSE !(\read(tmp___0)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0, tmp___0=0] [L415] RET activate_threads() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L416] CALL reset_delta_events() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L293] COND FALSE !((int )q_read_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L298] COND FALSE !((int )q_write_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L416] RET reset_delta_events() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L419] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L422] kernel_st = 1 [L423] CALL eval() [L333] int tmp ; [L334] int tmp___0 ; [L335] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L339] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L342] CALL, EXPR exists_runnable_thread() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L252] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L255] COND TRUE (int )p_dw_st == 0 [L256] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L268] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L342] RET, EXPR exists_runnable_thread() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, exists_runnable_thread()=1, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L342] tmp___1 = exists_runnable_thread() [L344] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp___1=1] [L349] COND TRUE (int )p_dw_st == 0 [L351] tmp = __VERIFIER_nondet_int() [L353] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0, tmp___1=1] [L359] CALL error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L20] reach_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2932 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2887 mSDsluCounter, 3642 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2418 mSDsCounter, 934 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3361 IncrementalHoareTripleChecker+Invalid, 4295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 934 mSolverCounterUnsat, 1224 mSDtfsCounter, 3361 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 259 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1477occurred in iteration=6, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 7 MinimizatonAttempts, 785 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 399 ConstructedInterpolants, 0 QuantifiedInterpolants, 976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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! [2022-11-02 20:53:21,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff84ae02-1051-4517-aff4-2e643e2c69f2/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE