./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 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6644c2e5-a338-47f1-ba98-639582f459ad/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6644c2e5-a338-47f1-ba98-639582f459ad/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6644c2e5-a338-47f1-ba98-639582f459ad/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6644c2e5-a338-47f1-ba98-639582f459ad/bin/uautomizer-QkZJyEgLgS/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_6644c2e5-a338-47f1-ba98-639582f459ad/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6644c2e5-a338-47f1-ba98-639582f459ad/bin/uautomizer-QkZJyEgLgS --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-4e7fbc6 [2022-11-23 02:26:56,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:26:56,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:26:56,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:26:56,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:26:56,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:26:56,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:26:56,133 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:26:56,135 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:26:56,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:26:56,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:26:56,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:26:56,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:26:56,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:26:56,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:26:56,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:26:56,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:26:56,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:26:56,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:26:56,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:26:56,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:26:56,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:26:56,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:26:56,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:26:56,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:26:56,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:26:56,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:26:56,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:26:56,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:26:56,170 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:26:56,170 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:26:56,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:26:56,173 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:26:56,174 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:26:56,176 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:26:56,176 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:26:56,177 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:26:56,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:26:56,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:26:56,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:26:56,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:26:56,183 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6644c2e5-a338-47f1-ba98-639582f459ad/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 02:26:56,211 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:26:56,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:26:56,212 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:26:56,212 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:26:56,213 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:26:56,214 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:26:56,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:26:56,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:26:56,216 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:26:56,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:26:56,217 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:26:56,217 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:26:56,217 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:26:56,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:26:56,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 02:26:56,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:26:56,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 02:26:56,219 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:26:56,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 02:26:56,220 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:26:56,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 02:26:56,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:26:56,221 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:26:56,222 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:26:56,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:26:56,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:26:56,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:26:56,223 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 02:26:56,224 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 02:26:56,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 02:26:56,224 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:26:56,225 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 02:26:56,225 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:26:56,225 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:26:56,226 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_6644c2e5-a338-47f1-ba98-639582f459ad/bin/uautomizer-QkZJyEgLgS/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_6644c2e5-a338-47f1-ba98-639582f459ad/bin/uautomizer-QkZJyEgLgS 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-23 02:26:56,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:26:56,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:26:56,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:26:56,660 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:26:56,660 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:26:56,662 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6644c2e5-a338-47f1-ba98-639582f459ad/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2022-11-23 02:26:59,912 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:27:00,142 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:27:00,143 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6644c2e5-a338-47f1-ba98-639582f459ad/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2022-11-23 02:27:00,154 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6644c2e5-a338-47f1-ba98-639582f459ad/bin/uautomizer-QkZJyEgLgS/data/5d1a72bd8/1ade86f493df441495f2ed99c77d703f/FLAG79806e762 [2022-11-23 02:27:00,178 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6644c2e5-a338-47f1-ba98-639582f459ad/bin/uautomizer-QkZJyEgLgS/data/5d1a72bd8/1ade86f493df441495f2ed99c77d703f [2022-11-23 02:27:00,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:27:00,184 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:27:00,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:27:00,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:27:00,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:27:00,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:27:00" (1/1) ... [2022-11-23 02:27:00,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@735d6891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:00, skipping insertion in model container [2022-11-23 02:27:00,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:27:00" (1/1) ... [2022-11-23 02:27:00,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:27:00,274 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:27:00,430 WARN L237 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_6644c2e5-a338-47f1-ba98-639582f459ad/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c[643,656] [2022-11-23 02:27:00,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:27:00,560 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:27:00,579 WARN L237 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_6644c2e5-a338-47f1-ba98-639582f459ad/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c[643,656] [2022-11-23 02:27:00,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:27:00,664 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:27:00,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:00 WrapperNode [2022-11-23 02:27:00,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:27:00,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:27:00,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:27:00,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:27:00,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:00" (1/1) ... [2022-11-23 02:27:00,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:00" (1/1) ... [2022-11-23 02:27:00,743 INFO L138 Inliner]: procedures = 29, calls = 32, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 188 [2022-11-23 02:27:00,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:27:00,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:27:00,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:27:00,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:27:00,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:00" (1/1) ... [2022-11-23 02:27:00,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:00" (1/1) ... [2022-11-23 02:27:00,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:00" (1/1) ... [2022-11-23 02:27:00,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:00" (1/1) ... [2022-11-23 02:27:00,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:00" (1/1) ... [2022-11-23 02:27:00,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:00" (1/1) ... [2022-11-23 02:27:00,799 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:00" (1/1) ... [2022-11-23 02:27:00,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:00" (1/1) ... [2022-11-23 02:27:00,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:27:00,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:27:00,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:27:00,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:27:00,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:00" (1/1) ... [2022-11-23 02:27:00,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:27:00,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6644c2e5-a338-47f1-ba98-639582f459ad/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:27:00,847 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6644c2e5-a338-47f1-ba98-639582f459ad/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:27:00,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6644c2e5-a338-47f1-ba98-639582f459ad/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:27:00,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:27:00,900 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-23 02:27:00,901 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-23 02:27:00,901 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-23 02:27:00,901 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-23 02:27:00,902 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-23 02:27:00,902 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-23 02:27:00,903 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-23 02:27:00,903 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-23 02:27:00,903 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-23 02:27:00,903 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-23 02:27:00,904 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-23 02:27:00,904 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-23 02:27:00,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 02:27:00,904 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-23 02:27:00,905 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-23 02:27:00,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:27:00,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:27:00,906 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-23 02:27:00,906 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-23 02:27:01,034 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:27:01,040 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:27:01,434 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:27:01,444 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:27:01,444 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-23 02:27:01,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:27:01 BoogieIcfgContainer [2022-11-23 02:27:01,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:27:01,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:27:01,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:27:01,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:27:01,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:27:00" (1/3) ... [2022-11-23 02:27:01,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a70b16b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:27:01, skipping insertion in model container [2022-11-23 02:27:01,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:00" (2/3) ... [2022-11-23 02:27:01,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a70b16b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:27:01, skipping insertion in model container [2022-11-23 02:27:01,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:27:01" (3/3) ... [2022-11-23 02:27:01,477 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2.c [2022-11-23 02:27:01,505 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:27:01,505 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 02:27:01,581 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:27:01,587 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;@4a2795ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:27:01,588 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 02:27:01,593 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-23 02:27:01,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 02:27:01,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:27:01,605 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-23 02:27:01,605 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:27:01,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:01,612 INFO L85 PathProgramCache]: Analyzing trace with hash -651219767, now seen corresponding path program 1 times [2022-11-23 02:27:01,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:27:01,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279746591] [2022-11-23 02:27:01,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:27:01,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:27:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:02,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:27:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:02,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 02:27:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:02,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:27:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:02,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 02:27:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:02,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:27:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:02,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-23 02:27:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:02,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-23 02:27:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:02,311 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-23 02:27:02,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:27:02,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279746591] [2022-11-23 02:27:02,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279746591] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:27:02,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:27:02,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 02:27:02,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748826670] [2022-11-23 02:27:02,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:27:02,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:27:02,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:27:02,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:27:02,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:27:02,377 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-23 02:27:02,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:27:02,940 INFO L93 Difference]: Finished difference Result 217 states and 317 transitions. [2022-11-23 02:27:02,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:27:02,945 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-23 02:27:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:27:02,956 INFO L225 Difference]: With dead ends: 217 [2022-11-23 02:27:02,957 INFO L226 Difference]: Without dead ends: 116 [2022-11-23 02:27:02,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-23 02:27:02,964 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 214 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 02:27:02,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 240 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 02:27:02,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-23 02:27:03,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2022-11-23 02:27:03,048 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-23 02:27:03,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2022-11-23 02:27:03,052 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 58 [2022-11-23 02:27:03,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:27:03,053 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2022-11-23 02:27:03,053 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-23 02:27:03,053 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2022-11-23 02:27:03,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 02:27:03,056 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:27:03,056 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-23 02:27:03,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 02:27:03,057 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:27:03,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:03,058 INFO L85 PathProgramCache]: Analyzing trace with hash -635701049, now seen corresponding path program 1 times [2022-11-23 02:27:03,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:27:03,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859532520] [2022-11-23 02:27:03,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:27:03,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:27:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:03,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:27:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:03,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 02:27:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:03,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:27:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:03,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 02:27:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:03,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:27:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:03,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-23 02:27:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:03,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-23 02:27:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:03,397 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-23 02:27:03,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:27:03,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859532520] [2022-11-23 02:27:03,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859532520] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:27:03,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:27:03,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 02:27:03,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963359996] [2022-11-23 02:27:03,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:27:03,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 02:27:03,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:27:03,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 02:27:03,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:27:03,403 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-23 02:27:04,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:27:04,284 INFO L93 Difference]: Finished difference Result 323 states and 448 transitions. [2022-11-23 02:27:04,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 02:27:04,285 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-23 02:27:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:27:04,296 INFO L225 Difference]: With dead ends: 323 [2022-11-23 02:27:04,296 INFO L226 Difference]: Without dead ends: 234 [2022-11-23 02:27:04,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-23 02:27:04,305 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 491 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 02:27:04,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 304 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 02:27:04,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-11-23 02:27:04,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 194. [2022-11-23 02:27:04,382 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-23 02:27:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 263 transitions. [2022-11-23 02:27:04,390 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 263 transitions. Word has length 58 [2022-11-23 02:27:04,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:27:04,390 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 263 transitions. [2022-11-23 02:27:04,390 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-23 02:27:04,391 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 263 transitions. [2022-11-23 02:27:04,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 02:27:04,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:27:04,400 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-23 02:27:04,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 02:27:04,400 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:27:04,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:04,401 INFO L85 PathProgramCache]: Analyzing trace with hash 126948582, now seen corresponding path program 1 times [2022-11-23 02:27:04,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:27:04,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549479095] [2022-11-23 02:27:04,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:27:04,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:27:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:04,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:27:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:04,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 02:27:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:04,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:27:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:04,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 02:27:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:04,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:27:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:04,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-23 02:27:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:04,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-23 02:27:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:04,743 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-23 02:27:04,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:27:04,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549479095] [2022-11-23 02:27:04,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549479095] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:27:04,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:27:04,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 02:27:04,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450187427] [2022-11-23 02:27:04,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:27:04,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 02:27:04,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:27:04,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 02:27:04,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:27:04,751 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-23 02:27:05,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:27:05,752 INFO L93 Difference]: Finished difference Result 543 states and 741 transitions. [2022-11-23 02:27:05,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 02:27:05,753 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-23 02:27:05,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:27:05,762 INFO L225 Difference]: With dead ends: 543 [2022-11-23 02:27:05,762 INFO L226 Difference]: Without dead ends: 365 [2022-11-23 02:27:05,769 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-23 02:27:05,775 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 444 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 02:27:05,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 583 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 02:27:05,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-11-23 02:27:05,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 290. [2022-11-23 02:27:05,860 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-23 02:27:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 396 transitions. [2022-11-23 02:27:05,865 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 396 transitions. Word has length 58 [2022-11-23 02:27:05,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:27:05,866 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 396 transitions. [2022-11-23 02:27:05,866 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-23 02:27:05,867 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 396 transitions. [2022-11-23 02:27:05,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 02:27:05,871 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:27:05,871 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-23 02:27:05,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 02:27:05,872 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:27:05,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:05,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1020434920, now seen corresponding path program 1 times [2022-11-23 02:27:05,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:27:05,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113128914] [2022-11-23 02:27:05,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:27:05,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:27:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:05,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:27:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:05,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 02:27:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:05,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:27:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:06,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 02:27:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:06,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:27:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:06,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-23 02:27:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:06,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-23 02:27:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:06,094 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-23 02:27:06,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:27:06,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113128914] [2022-11-23 02:27:06,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113128914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:27:06,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:27:06,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-23 02:27:06,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236634702] [2022-11-23 02:27:06,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:27:06,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 02:27:06,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:27:06,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 02:27:06,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-23 02:27:06,098 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-23 02:27:06,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:27:06,723 INFO L93 Difference]: Finished difference Result 592 states and 811 transitions. [2022-11-23 02:27:06,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 02:27:06,724 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-23 02:27:06,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:27:06,727 INFO L225 Difference]: With dead ends: 592 [2022-11-23 02:27:06,728 INFO L226 Difference]: Without dead ends: 324 [2022-11-23 02:27:06,729 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-23 02:27:06,730 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 120 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 02:27:06,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 494 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 02:27:06,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-11-23 02:27:06,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 295. [2022-11-23 02:27:06,766 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-23 02:27:06,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 399 transitions. [2022-11-23 02:27:06,769 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 399 transitions. Word has length 58 [2022-11-23 02:27:06,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:27:06,770 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 399 transitions. [2022-11-23 02:27:06,770 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-23 02:27:06,771 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 399 transitions. [2022-11-23 02:27:06,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 02:27:06,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:27:06,772 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-23 02:27:06,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 02:27:06,773 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:27:06,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:06,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1295194534, now seen corresponding path program 1 times [2022-11-23 02:27:06,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:27:06,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226649499] [2022-11-23 02:27:06,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:27:06,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:27:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:06,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:27:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:06,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 02:27:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:06,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:27:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:06,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 02:27:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:06,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:27:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:06,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-23 02:27:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:06,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-23 02:27:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:06,992 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-23 02:27:06,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:27:06,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226649499] [2022-11-23 02:27:06,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226649499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:27:06,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:27:06,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-23 02:27:06,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278012436] [2022-11-23 02:27:06,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:27:06,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 02:27:06,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:27:06,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 02:27:06,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-23 02:27:06,996 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-23 02:27:09,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:27:09,045 INFO L93 Difference]: Finished difference Result 1963 states and 2677 transitions. [2022-11-23 02:27:09,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-23 02:27:09,046 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-23 02:27:09,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:27:09,059 INFO L225 Difference]: With dead ends: 1963 [2022-11-23 02:27:09,059 INFO L226 Difference]: Without dead ends: 1690 [2022-11-23 02:27:09,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-11-23 02:27:09,062 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 1197 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:27:09,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 753 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-23 02:27:09,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2022-11-23 02:27:09,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1432. [2022-11-23 02:27:09,230 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-23 02:27:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1877 transitions. [2022-11-23 02:27:09,240 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1877 transitions. Word has length 58 [2022-11-23 02:27:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:27:09,241 INFO L495 AbstractCegarLoop]: Abstraction has 1432 states and 1877 transitions. [2022-11-23 02:27:09,241 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-23 02:27:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1877 transitions. [2022-11-23 02:27:09,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 02:27:09,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:27:09,244 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-23 02:27:09,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 02:27:09,244 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:27:09,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:09,245 INFO L85 PathProgramCache]: Analyzing trace with hash 323519847, now seen corresponding path program 1 times [2022-11-23 02:27:09,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:27:09,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804971767] [2022-11-23 02:27:09,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:27:09,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:27:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:09,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:27:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:09,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 02:27:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:09,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:27:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:09,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 02:27:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:09,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:27:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:09,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-23 02:27:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:09,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-23 02:27:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:09,477 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-23 02:27:09,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:27:09,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804971767] [2022-11-23 02:27:09,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804971767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:27:09,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:27:09,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-23 02:27:09,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211451629] [2022-11-23 02:27:09,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:27:09,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 02:27:09,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:27:09,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 02:27:09,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-23 02:27:09,481 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-23 02:27:10,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:27:10,161 INFO L93 Difference]: Finished difference Result 3031 states and 3996 transitions. [2022-11-23 02:27:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 02:27:10,162 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-23 02:27:10,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:27:10,171 INFO L225 Difference]: With dead ends: 3031 [2022-11-23 02:27:10,171 INFO L226 Difference]: Without dead ends: 1621 [2022-11-23 02:27:10,175 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-23 02:27:10,176 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 169 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 02:27:10,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 443 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 02:27:10,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2022-11-23 02:27:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1477. [2022-11-23 02:27:10,335 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-23 02:27:10,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 1916 transitions. [2022-11-23 02:27:10,344 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 1916 transitions. Word has length 58 [2022-11-23 02:27:10,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:27:10,344 INFO L495 AbstractCegarLoop]: Abstraction has 1477 states and 1916 transitions. [2022-11-23 02:27:10,345 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-23 02:27:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1916 transitions. [2022-11-23 02:27:10,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 02:27:10,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:27:10,346 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-23 02:27:10,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 02:27:10,347 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:27:10,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:10,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1481918487, now seen corresponding path program 1 times [2022-11-23 02:27:10,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:27:10,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420943653] [2022-11-23 02:27:10,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:27:10,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:27:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:10,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:27:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:10,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 02:27:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:10,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:27:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:10,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 02:27:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:10,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 02:27:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:10,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-23 02:27:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:10,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-23 02:27:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:10,525 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-23 02:27:10,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:27:10,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420943653] [2022-11-23 02:27:10,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420943653] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:27:10,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:27:10,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 02:27:10,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667787604] [2022-11-23 02:27:10,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:27:10,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 02:27:10,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:27:10,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 02:27:10,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:27:10,529 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-23 02:27:11,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:27:11,482 INFO L93 Difference]: Finished difference Result 2912 states and 3753 transitions. [2022-11-23 02:27:11,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 02:27:11,483 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-23 02:27:11,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:27:11,493 INFO L225 Difference]: With dead ends: 2912 [2022-11-23 02:27:11,494 INFO L226 Difference]: Without dead ends: 1676 [2022-11-23 02:27:11,497 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-23 02:27:11,499 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 338 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 02:27:11,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 407 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 02:27:11,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2022-11-23 02:27:11,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1455. [2022-11-23 02:27:11,652 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-23 02:27:11,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 1876 transitions. [2022-11-23 02:27:11,660 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 1876 transitions. Word has length 58 [2022-11-23 02:27:11,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:27:11,661 INFO L495 AbstractCegarLoop]: Abstraction has 1455 states and 1876 transitions. [2022-11-23 02:27:11,661 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-23 02:27:11,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1876 transitions. [2022-11-23 02:27:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 02:27:11,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:27:11,663 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-23 02:27:11,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 02:27:11,663 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:27:11,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:11,664 INFO L85 PathProgramCache]: Analyzing trace with hash 818904103, now seen corresponding path program 1 times [2022-11-23 02:27:11,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:27:11,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370468170] [2022-11-23 02:27:11,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:27:11,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:27:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:27:11,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:27:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:27:11,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:27:11,716 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 02:27:11,718 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 02:27:11,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 02:27:11,724 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:27:11,729 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 02:27:11,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:27:11 BoogieIcfgContainer [2022-11-23 02:27:11,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 02:27:11,823 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 02:27:11,823 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 02:27:11,823 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 02:27:11,824 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:27:01" (3/4) ... [2022-11-23 02:27:11,826 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 02:27:11,964 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6644c2e5-a338-47f1-ba98-639582f459ad/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 02:27:11,964 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 02:27:11,965 INFO L158 Benchmark]: Toolchain (without parser) took 11780.97ms. Allocated memory was 182.5MB in the beginning and 264.2MB in the end (delta: 81.8MB). Free memory was 133.3MB in the beginning and 115.2MB in the end (delta: 18.1MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. [2022-11-23 02:27:11,965 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 151.0MB. Free memory is still 96.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:27:11,966 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.04ms. Allocated memory is still 182.5MB. Free memory was 133.3MB in the beginning and 120.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-23 02:27:11,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.54ms. Allocated memory is still 182.5MB. Free memory was 120.8MB in the beginning and 118.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:27:11,967 INFO L158 Benchmark]: Boogie Preprocessor took 62.37ms. Allocated memory is still 182.5MB. Free memory was 118.7MB in the beginning and 117.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:27:11,967 INFO L158 Benchmark]: RCFGBuilder took 640.48ms. Allocated memory is still 182.5MB. Free memory was 117.3MB in the beginning and 99.8MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-23 02:27:11,968 INFO L158 Benchmark]: TraceAbstraction took 10372.43ms. Allocated memory was 182.5MB in the beginning and 264.2MB in the end (delta: 81.8MB). Free memory was 99.8MB in the beginning and 121.5MB in the end (delta: -21.7MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2022-11-23 02:27:11,968 INFO L158 Benchmark]: Witness Printer took 141.53ms. Allocated memory is still 264.2MB. Free memory was 121.5MB in the beginning and 115.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-23 02:27:11,970 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.36ms. Allocated memory is still 151.0MB. Free memory is still 96.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 480.04ms. Allocated memory is still 182.5MB. Free memory was 133.3MB in the beginning and 120.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.54ms. Allocated memory is still 182.5MB. Free memory was 120.8MB in the beginning and 118.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.37ms. Allocated memory is still 182.5MB. Free memory was 118.7MB in the beginning and 117.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 640.48ms. Allocated memory is still 182.5MB. Free memory was 117.3MB in the beginning and 99.8MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10372.43ms. Allocated memory was 182.5MB in the beginning and 264.2MB in the end (delta: 81.8MB). Free memory was 99.8MB in the beginning and 121.5MB in the end (delta: -21.7MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Witness Printer took 141.53ms. Allocated memory is still 264.2MB. Free memory was 121.5MB in the beginning and 115.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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: 10.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3018 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2973 mSDsluCounter, 3224 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2418 mSDsCounter, 848 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3779 IncrementalHoareTripleChecker+Invalid, 4627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 848 mSolverCounterUnsat, 806 mSDtfsCounter, 3779 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.8s 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.8s AutomataMinimizationTime, 7 MinimizatonAttempts, 785 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s 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-23 02:27:12,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6644c2e5-a338-47f1-ba98-639582f459ad/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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