./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/kundu2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/kundu2.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa --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 87760fc84dfa44e1b5109b35af0fae7e5f68f814afbb1ba90e7b46e4e9e3b4bf --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:40:45,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:40:45,930 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:40:45,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:40:45,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:40:45,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:40:45,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:40:45,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:40:45,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:40:45,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:40:45,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:40:45,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:40:45,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:40:45,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:40:45,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:40:45,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:40:45,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:40:45,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:40:45,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:40:45,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:40:45,978 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:40:45,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:40:45,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:40:45,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:40:45,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:40:45,984 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:40:45,984 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:40:45,985 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:40:45,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:40:45,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:40:45,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:40:45,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:40:45,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:40:45,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:40:45,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:40:45,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:40:45,991 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:40:45,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:40:45,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:40:45,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:40:45,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:40:45,994 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 17:40:46,012 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:40:46,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:40:46,012 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:40:46,012 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:40:46,013 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:40:46,013 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:40:46,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:40:46,013 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:40:46,014 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:40:46,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:40:46,014 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:40:46,014 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 17:40:46,014 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:40:46,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:40:46,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 17:40:46,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:40:46,015 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 17:40:46,015 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:40:46,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 17:40:46,015 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:40:46,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 17:40:46,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:40:46,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:40:46,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:40:46,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:40:46,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:40:46,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:40:46,016 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 17:40:46,016 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 17:40:46,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 17:40:46,016 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 17:40:46,017 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 17:40:46,017 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 17:40:46,017 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:40:46,017 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/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_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa 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 -> 87760fc84dfa44e1b5109b35af0fae7e5f68f814afbb1ba90e7b46e4e9e3b4bf [2021-12-06 17:40:46,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:40:46,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:40:46,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:40:46,225 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:40:46,225 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:40:46,226 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/systemc/kundu2.cil.c [2021-12-06 17:40:46,273 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/data/1b05deb7f/dc0da4219d764addb9f2d316a20f7be8/FLAGea05e6132 [2021-12-06 17:40:46,643 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:40:46,644 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/sv-benchmarks/c/systemc/kundu2.cil.c [2021-12-06 17:40:46,651 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/data/1b05deb7f/dc0da4219d764addb9f2d316a20f7be8/FLAGea05e6132 [2021-12-06 17:40:46,662 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/data/1b05deb7f/dc0da4219d764addb9f2d316a20f7be8 [2021-12-06 17:40:46,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:40:46,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:40:46,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:40:46,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:40:46,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:40:46,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:40:46" (1/1) ... [2021-12-06 17:40:46,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d685bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:46, skipping insertion in model container [2021-12-06 17:40:46,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:40:46" (1/1) ... [2021-12-06 17:40:46,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:40:46,697 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:40:46,804 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/sv-benchmarks/c/systemc/kundu2.cil.c[636,649] [2021-12-06 17:40:46,857 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:40:46,866 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:40:46,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/sv-benchmarks/c/systemc/kundu2.cil.c[636,649] [2021-12-06 17:40:46,905 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:40:46,920 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:40:46,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:46 WrapperNode [2021-12-06 17:40:46,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:40:46,922 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:40:46,922 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:40:46,922 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:40:46,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:46" (1/1) ... [2021-12-06 17:40:46,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:46" (1/1) ... [2021-12-06 17:40:46,965 INFO L137 Inliner]: procedures = 34, calls = 40, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 310 [2021-12-06 17:40:46,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:40:46,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:40:46,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:40:46,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:40:46,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:46" (1/1) ... [2021-12-06 17:40:46,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:46" (1/1) ... [2021-12-06 17:40:46,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:46" (1/1) ... [2021-12-06 17:40:46,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:46" (1/1) ... [2021-12-06 17:40:46,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:46" (1/1) ... [2021-12-06 17:40:46,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:46" (1/1) ... [2021-12-06 17:40:46,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:46" (1/1) ... [2021-12-06 17:40:46,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:40:46,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:40:46,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:40:46,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:40:46,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:46" (1/1) ... [2021-12-06 17:40:47,004 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:40:47,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:40:47,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 17:40:47,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 17:40:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:40:47,065 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2021-12-06 17:40:47,065 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2021-12-06 17:40:47,065 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-12-06 17:40:47,065 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-12-06 17:40:47,065 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-06 17:40:47,065 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-06 17:40:47,065 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-06 17:40:47,066 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-06 17:40:47,066 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-06 17:40:47,066 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-06 17:40:47,066 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-06 17:40:47,066 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-06 17:40:47,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 17:40:47,066 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-06 17:40:47,066 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-06 17:40:47,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:40:47,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:40:47,132 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:40:47,133 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:40:47,360 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:40:47,366 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:40:47,366 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-06 17:40:47,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:40:47 BoogieIcfgContainer [2021-12-06 17:40:47,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:40:47,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 17:40:47,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 17:40:47,372 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 17:40:47,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:40:46" (1/3) ... [2021-12-06 17:40:47,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8b4d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:40:47, skipping insertion in model container [2021-12-06 17:40:47,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:46" (2/3) ... [2021-12-06 17:40:47,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8b4d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:40:47, skipping insertion in model container [2021-12-06 17:40:47,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:40:47" (3/3) ... [2021-12-06 17:40:47,374 INFO L111 eAbstractionObserver]: Analyzing ICFG kundu2.cil.c [2021-12-06 17:40:47,378 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 17:40:47,379 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 17:40:47,418 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 17:40:47,423 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 17:40:47,424 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 17:40:47,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 107 states have (on average 1.514018691588785) internal successors, (162), 111 states have internal predecessors, (162), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-06 17:40:47,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 17:40:47,445 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:47,445 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:47,446 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:47,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:47,451 INFO L85 PathProgramCache]: Analyzing trace with hash 734266899, now seen corresponding path program 1 times [2021-12-06 17:40:47,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:47,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390208457] [2021-12-06 17:40:47,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:47,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:47,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:40:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:47,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:40:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:47,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:40:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:47,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 17:40:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:47,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:40:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:47,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:47,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390208457] [2021-12-06 17:40:47,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390208457] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:47,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:40:47,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:40:47,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936405977] [2021-12-06 17:40:47,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:47,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 17:40:47,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:47,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 17:40:47,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 17:40:47,719 INFO L87 Difference]: Start difference. First operand has 134 states, 107 states have (on average 1.514018691588785) internal successors, (162), 111 states have internal predecessors, (162), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:40:47,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:47,847 INFO L93 Difference]: Finished difference Result 277 states and 417 transitions. [2021-12-06 17:40:47,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 17:40:47,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2021-12-06 17:40:47,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:47,858 INFO L225 Difference]: With dead ends: 277 [2021-12-06 17:40:47,858 INFO L226 Difference]: Without dead ends: 145 [2021-12-06 17:40:47,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:40:47,864 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 219 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:47,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 308 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:40:47,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-12-06 17:40:47,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 127. [2021-12-06 17:40:47,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 102 states have (on average 1.4411764705882353) internal successors, (147), 105 states have internal predecessors, (147), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-06 17:40:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 180 transitions. [2021-12-06 17:40:47,906 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 180 transitions. Word has length 59 [2021-12-06 17:40:47,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:47,906 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 180 transitions. [2021-12-06 17:40:47,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:40:47,907 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 180 transitions. [2021-12-06 17:40:47,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 17:40:47,909 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:47,909 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:47,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 17:40:47,909 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:47,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:47,910 INFO L85 PathProgramCache]: Analyzing trace with hash -804073131, now seen corresponding path program 1 times [2021-12-06 17:40:47,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:47,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783701583] [2021-12-06 17:40:47,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:47,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:47,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:40:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:47,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:40:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:47,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:40:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:47,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 17:40:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:47,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:40:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:47,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:47,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:47,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783701583] [2021-12-06 17:40:47,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783701583] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:47,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:40:47,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:40:47,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412110362] [2021-12-06 17:40:47,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:47,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:40:47,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:47,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:40:47,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:40:47,998 INFO L87 Difference]: Start difference. First operand 127 states and 180 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:40:48,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:48,214 INFO L93 Difference]: Finished difference Result 392 states and 563 transitions. [2021-12-06 17:40:48,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:40:48,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2021-12-06 17:40:48,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:48,218 INFO L225 Difference]: With dead ends: 392 [2021-12-06 17:40:48,218 INFO L226 Difference]: Without dead ends: 276 [2021-12-06 17:40:48,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:40:48,220 INFO L933 BasicCegarLoop]: 373 mSDtfsCounter, 385 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:48,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 834 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:40:48,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-12-06 17:40:48,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 234. [2021-12-06 17:40:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 192 states have (on average 1.4322916666666667) internal successors, (275), 196 states have internal predecessors, (275), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-06 17:40:48,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 330 transitions. [2021-12-06 17:40:48,250 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 330 transitions. Word has length 59 [2021-12-06 17:40:48,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:48,250 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 330 transitions. [2021-12-06 17:40:48,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:40:48,251 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 330 transitions. [2021-12-06 17:40:48,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 17:40:48,252 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:48,253 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:48,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 17:40:48,253 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:48,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:48,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1094457174, now seen corresponding path program 1 times [2021-12-06 17:40:48,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:48,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950090162] [2021-12-06 17:40:48,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:48,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:48,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:40:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:48,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:40:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:48,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:40:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:48,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 17:40:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:48,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:40:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:48,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:48,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950090162] [2021-12-06 17:40:48,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950090162] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:48,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:40:48,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:40:48,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585165598] [2021-12-06 17:40:48,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:48,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:40:48,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:48,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:40:48,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:40:48,345 INFO L87 Difference]: Start difference. First operand 234 states and 330 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:40:48,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:48,506 INFO L93 Difference]: Finished difference Result 529 states and 766 transitions. [2021-12-06 17:40:48,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 17:40:48,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2021-12-06 17:40:48,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:48,509 INFO L225 Difference]: With dead ends: 529 [2021-12-06 17:40:48,509 INFO L226 Difference]: Without dead ends: 306 [2021-12-06 17:40:48,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-06 17:40:48,511 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 183 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:48,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 893 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:40:48,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-12-06 17:40:48,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 237. [2021-12-06 17:40:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 195 states have (on average 1.4205128205128206) internal successors, (277), 199 states have internal predecessors, (277), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-06 17:40:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 332 transitions. [2021-12-06 17:40:48,531 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 332 transitions. Word has length 59 [2021-12-06 17:40:48,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:48,532 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 332 transitions. [2021-12-06 17:40:48,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:40:48,532 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 332 transitions. [2021-12-06 17:40:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 17:40:48,533 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:48,533 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:48,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 17:40:48,534 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:48,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:48,534 INFO L85 PathProgramCache]: Analyzing trace with hash -750909992, now seen corresponding path program 1 times [2021-12-06 17:40:48,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:48,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468410449] [2021-12-06 17:40:48,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:48,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:48,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:40:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:48,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:40:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:48,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:40:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:48,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 17:40:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:48,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:40:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:48,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:48,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468410449] [2021-12-06 17:40:48,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468410449] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:48,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:40:48,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:40:48,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313886198] [2021-12-06 17:40:48,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:48,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:40:48,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:48,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:40:48,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:40:48,606 INFO L87 Difference]: Start difference. First operand 237 states and 332 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:40:48,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:48,765 INFO L93 Difference]: Finished difference Result 549 states and 797 transitions. [2021-12-06 17:40:48,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:40:48,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2021-12-06 17:40:48,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:48,768 INFO L225 Difference]: With dead ends: 549 [2021-12-06 17:40:48,768 INFO L226 Difference]: Without dead ends: 323 [2021-12-06 17:40:48,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-12-06 17:40:48,770 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 196 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:48,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 799 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:40:48,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-12-06 17:40:48,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 243. [2021-12-06 17:40:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 201 states have (on average 1.407960199004975) internal successors, (283), 205 states have internal predecessors, (283), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-06 17:40:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2021-12-06 17:40:48,793 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 59 [2021-12-06 17:40:48,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:48,793 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2021-12-06 17:40:48,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:40:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2021-12-06 17:40:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 17:40:48,795 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:48,795 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:48,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 17:40:48,795 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:48,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:48,795 INFO L85 PathProgramCache]: Analyzing trace with hash -823296550, now seen corresponding path program 1 times [2021-12-06 17:40:48,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:48,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151534692] [2021-12-06 17:40:48,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:48,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:48,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:40:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:48,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:40:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:48,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:40:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:48,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 17:40:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:48,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:40:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:48,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:48,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151534692] [2021-12-06 17:40:48,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151534692] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:48,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:40:48,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:40:48,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748373674] [2021-12-06 17:40:48,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:48,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:40:48,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:48,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:40:48,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:40:48,876 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:40:49,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:49,286 INFO L93 Difference]: Finished difference Result 1005 states and 1437 transitions. [2021-12-06 17:40:49,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 17:40:49,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2021-12-06 17:40:49,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:49,291 INFO L225 Difference]: With dead ends: 1005 [2021-12-06 17:40:49,291 INFO L226 Difference]: Without dead ends: 773 [2021-12-06 17:40:49,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:40:49,293 INFO L933 BasicCegarLoop]: 354 mSDtfsCounter, 767 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:49,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [785 Valid, 1032 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:40:49,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2021-12-06 17:40:49,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 455. [2021-12-06 17:40:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 379 states have (on average 1.3984168865435356) internal successors, (530), 385 states have internal predecessors, (530), 51 states have call successors, (51), 25 states have call predecessors, (51), 24 states have return successors, (51), 45 states have call predecessors, (51), 48 states have call successors, (51) [2021-12-06 17:40:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 632 transitions. [2021-12-06 17:40:49,328 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 632 transitions. Word has length 59 [2021-12-06 17:40:49,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:49,328 INFO L470 AbstractCegarLoop]: Abstraction has 455 states and 632 transitions. [2021-12-06 17:40:49,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:40:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 632 transitions. [2021-12-06 17:40:49,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-06 17:40:49,329 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:49,329 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:49,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 17:40:49,330 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:49,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:49,330 INFO L85 PathProgramCache]: Analyzing trace with hash 225843183, now seen corresponding path program 1 times [2021-12-06 17:40:49,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:49,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620086142] [2021-12-06 17:40:49,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:49,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:49,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:40:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:49,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:40:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:49,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:40:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:49,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:40:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:49,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:40:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:49,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:49,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620086142] [2021-12-06 17:40:49,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620086142] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:49,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:40:49,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:40:49,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991678737] [2021-12-06 17:40:49,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:49,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:40:49,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:49,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:40:49,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:40:49,390 INFO L87 Difference]: Start difference. First operand 455 states and 632 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:40:49,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:49,566 INFO L93 Difference]: Finished difference Result 1000 states and 1442 transitions. [2021-12-06 17:40:49,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:40:49,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2021-12-06 17:40:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:49,570 INFO L225 Difference]: With dead ends: 1000 [2021-12-06 17:40:49,570 INFO L226 Difference]: Without dead ends: 556 [2021-12-06 17:40:49,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-12-06 17:40:49,572 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 75 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:49,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 783 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:40:49,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-12-06 17:40:49,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 467. [2021-12-06 17:40:49,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 391 states have (on average 1.3861892583120206) internal successors, (542), 397 states have internal predecessors, (542), 51 states have call successors, (51), 25 states have call predecessors, (51), 24 states have return successors, (51), 45 states have call predecessors, (51), 48 states have call successors, (51) [2021-12-06 17:40:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 644 transitions. [2021-12-06 17:40:49,610 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 644 transitions. Word has length 60 [2021-12-06 17:40:49,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:49,610 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 644 transitions. [2021-12-06 17:40:49,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:40:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 644 transitions. [2021-12-06 17:40:49,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-06 17:40:49,611 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:49,612 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:49,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 17:40:49,612 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:49,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:49,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2145896079, now seen corresponding path program 1 times [2021-12-06 17:40:49,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:49,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701133198] [2021-12-06 17:40:49,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:49,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:49,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:40:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:49,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:40:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:49,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:40:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:49,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:40:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:49,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:40:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:49,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:49,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701133198] [2021-12-06 17:40:49,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701133198] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:49,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:40:49,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:40:49,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850014088] [2021-12-06 17:40:49,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:49,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:40:49,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:49,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:40:49,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:40:49,668 INFO L87 Difference]: Start difference. First operand 467 states and 644 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-06 17:40:49,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:49,837 INFO L93 Difference]: Finished difference Result 1472 states and 2042 transitions. [2021-12-06 17:40:49,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 17:40:49,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2021-12-06 17:40:49,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:49,843 INFO L225 Difference]: With dead ends: 1472 [2021-12-06 17:40:49,843 INFO L226 Difference]: Without dead ends: 1017 [2021-12-06 17:40:49,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:40:49,845 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 249 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:49,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 845 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:40:49,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2021-12-06 17:40:49,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 871. [2021-12-06 17:40:49,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 731 states have (on average 1.377564979480164) internal successors, (1007), 745 states have internal predecessors, (1007), 91 states have call successors, (91), 49 states have call predecessors, (91), 48 states have return successors, (93), 77 states have call predecessors, (93), 88 states have call successors, (93) [2021-12-06 17:40:49,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1191 transitions. [2021-12-06 17:40:49,897 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1191 transitions. Word has length 60 [2021-12-06 17:40:49,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:49,898 INFO L470 AbstractCegarLoop]: Abstraction has 871 states and 1191 transitions. [2021-12-06 17:40:49,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-06 17:40:49,898 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1191 transitions. [2021-12-06 17:40:49,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-06 17:40:49,899 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:49,899 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:49,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 17:40:49,899 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:49,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:49,899 INFO L85 PathProgramCache]: Analyzing trace with hash 370475399, now seen corresponding path program 1 times [2021-12-06 17:40:49,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:49,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718810932] [2021-12-06 17:40:49,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:49,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:49,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:40:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:49,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:40:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:49,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:40:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:49,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:40:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:49,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:40:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:49,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 17:40:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:49,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:49,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:49,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718810932] [2021-12-06 17:40:49,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718810932] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:40:49,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115198856] [2021-12-06 17:40:49,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:49,976 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:40:49,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:40:49,977 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:40:49,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 17:40:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:50,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 17:40:50,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:40:50,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:50,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:40:50,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:50,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115198856] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 17:40:50,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:40:50,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 8 [2021-12-06 17:40:50,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224851737] [2021-12-06 17:40:50,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:50,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:40:50,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:50,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:40:50,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:40:50,331 INFO L87 Difference]: Start difference. First operand 871 states and 1191 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 17:40:50,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:50,531 INFO L93 Difference]: Finished difference Result 2417 states and 3325 transitions. [2021-12-06 17:40:50,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 17:40:50,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 71 [2021-12-06 17:40:50,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:50,540 INFO L225 Difference]: With dead ends: 2417 [2021-12-06 17:40:50,540 INFO L226 Difference]: Without dead ends: 1656 [2021-12-06 17:40:50,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 149 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-06 17:40:50,543 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 289 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:50,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 1326 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:40:50,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2021-12-06 17:40:50,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1627. [2021-12-06 17:40:50,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1371 states have (on average 1.37490882567469) internal successors, (1885), 1394 states have internal predecessors, (1885), 165 states have call successors, (165), 91 states have call predecessors, (165), 90 states have return successors, (172), 142 states have call predecessors, (172), 162 states have call successors, (172) [2021-12-06 17:40:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 2222 transitions. [2021-12-06 17:40:50,641 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 2222 transitions. Word has length 71 [2021-12-06 17:40:50,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:50,642 INFO L470 AbstractCegarLoop]: Abstraction has 1627 states and 2222 transitions. [2021-12-06 17:40:50,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 17:40:50,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2222 transitions. [2021-12-06 17:40:50,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-06 17:40:50,643 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:50,643 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:50,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 17:40:50,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-12-06 17:40:50,844 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:50,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:50,845 INFO L85 PathProgramCache]: Analyzing trace with hash -153594449, now seen corresponding path program 1 times [2021-12-06 17:40:50,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:50,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881651] [2021-12-06 17:40:50,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:50,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:50,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:40:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:50,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:40:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:50,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:40:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:50,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:40:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:50,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:40:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:50,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 17:40:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:50,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:50,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881651] [2021-12-06 17:40:50,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881651] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:50,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:40:50,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:40:50,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427413033] [2021-12-06 17:40:50,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:50,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:40:50,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:50,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:40:50,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:40:50,911 INFO L87 Difference]: Start difference. First operand 1627 states and 2222 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 17:40:51,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:51,322 INFO L93 Difference]: Finished difference Result 5161 states and 7145 transitions. [2021-12-06 17:40:51,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:40:51,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2021-12-06 17:40:51,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:51,340 INFO L225 Difference]: With dead ends: 5161 [2021-12-06 17:40:51,340 INFO L226 Difference]: Without dead ends: 3546 [2021-12-06 17:40:51,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-12-06 17:40:51,345 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 379 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:51,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 744 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:40:51,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3546 states. [2021-12-06 17:40:51,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3546 to 3226. [2021-12-06 17:40:51,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3226 states, 2749 states have (on average 1.353946889778101) internal successors, (3722), 2790 states have internal predecessors, (3722), 292 states have call successors, (292), 170 states have call predecessors, (292), 184 states have return successors, (401), 267 states have call predecessors, (401), 289 states have call successors, (401) [2021-12-06 17:40:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 3226 states and 4415 transitions. [2021-12-06 17:40:51,546 INFO L78 Accepts]: Start accepts. Automaton has 3226 states and 4415 transitions. Word has length 73 [2021-12-06 17:40:51,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:51,546 INFO L470 AbstractCegarLoop]: Abstraction has 3226 states and 4415 transitions. [2021-12-06 17:40:51,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 17:40:51,546 INFO L276 IsEmpty]: Start isEmpty. Operand 3226 states and 4415 transitions. [2021-12-06 17:40:51,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-06 17:40:51,548 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:51,548 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:51,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 17:40:51,548 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:51,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:51,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1839774287, now seen corresponding path program 1 times [2021-12-06 17:40:51,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:51,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038042533] [2021-12-06 17:40:51,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:51,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:51,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:40:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:51,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:40:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:51,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:40:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:51,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:40:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:51,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:40:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:51,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 17:40:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:51,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:51,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038042533] [2021-12-06 17:40:51,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038042533] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:51,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:40:51,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:40:51,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691497932] [2021-12-06 17:40:51,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:51,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:40:51,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:51,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:40:51,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:40:51,586 INFO L87 Difference]: Start difference. First operand 3226 states and 4415 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 17:40:51,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:51,833 INFO L93 Difference]: Finished difference Result 6801 states and 9339 transitions. [2021-12-06 17:40:51,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:40:51,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2021-12-06 17:40:51,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:51,851 INFO L225 Difference]: With dead ends: 6801 [2021-12-06 17:40:51,851 INFO L226 Difference]: Without dead ends: 3586 [2021-12-06 17:40:51,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:40:51,859 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 304 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:51,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 340 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:40:51,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3586 states. [2021-12-06 17:40:52,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3586 to 3221. [2021-12-06 17:40:52,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3221 states, 2747 states have (on average 1.3534765198398253) internal successors, (3718), 2787 states have internal predecessors, (3718), 289 states have call successors, (289), 170 states have call predecessors, (289), 184 states have return successors, (397), 264 states have call predecessors, (397), 286 states have call successors, (397) [2021-12-06 17:40:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3221 states to 3221 states and 4404 transitions. [2021-12-06 17:40:52,041 INFO L78 Accepts]: Start accepts. Automaton has 3221 states and 4404 transitions. Word has length 73 [2021-12-06 17:40:52,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:52,041 INFO L470 AbstractCegarLoop]: Abstraction has 3221 states and 4404 transitions. [2021-12-06 17:40:52,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 17:40:52,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3221 states and 4404 transitions. [2021-12-06 17:40:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-06 17:40:52,042 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:52,042 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:52,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 17:40:52,043 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:52,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:52,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1321482580, now seen corresponding path program 1 times [2021-12-06 17:40:52,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:52,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254539352] [2021-12-06 17:40:52,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:52,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:52,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:40:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:52,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:40:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:52,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:40:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:52,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:40:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:52,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:40:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:52,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 17:40:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:52,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:52,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254539352] [2021-12-06 17:40:52,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254539352] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:52,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:40:52,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:40:52,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770025057] [2021-12-06 17:40:52,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:52,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:40:52,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:52,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:40:52,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:40:52,090 INFO L87 Difference]: Start difference. First operand 3221 states and 4404 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 17:40:52,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:52,533 INFO L93 Difference]: Finished difference Result 9335 states and 12874 transitions. [2021-12-06 17:40:52,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 17:40:52,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 74 [2021-12-06 17:40:52,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:52,567 INFO L225 Difference]: With dead ends: 9335 [2021-12-06 17:40:52,567 INFO L226 Difference]: Without dead ends: 6125 [2021-12-06 17:40:52,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:40:52,577 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 375 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:52,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 519 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:40:52,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6125 states. [2021-12-06 17:40:52,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6125 to 5069. [2021-12-06 17:40:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5069 states, 4286 states have (on average 1.3201119925338312) internal successors, (5658), 4350 states have internal predecessors, (5658), 475 states have call successors, (475), 283 states have call predecessors, (475), 307 states have return successors, (665), 436 states have call predecessors, (665), 472 states have call successors, (665) [2021-12-06 17:40:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5069 states to 5069 states and 6798 transitions. [2021-12-06 17:40:52,865 INFO L78 Accepts]: Start accepts. Automaton has 5069 states and 6798 transitions. Word has length 74 [2021-12-06 17:40:52,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:52,865 INFO L470 AbstractCegarLoop]: Abstraction has 5069 states and 6798 transitions. [2021-12-06 17:40:52,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 17:40:52,866 INFO L276 IsEmpty]: Start isEmpty. Operand 5069 states and 6798 transitions. [2021-12-06 17:40:52,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-06 17:40:52,867 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:52,867 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:52,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 17:40:52,867 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:52,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:52,868 INFO L85 PathProgramCache]: Analyzing trace with hash -728024876, now seen corresponding path program 1 times [2021-12-06 17:40:52,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:52,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285643492] [2021-12-06 17:40:52,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:52,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:52,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:40:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:52,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:40:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:52,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:40:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:52,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:40:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:52,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:40:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:52,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 17:40:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:52,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:52,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285643492] [2021-12-06 17:40:52,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285643492] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:52,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:40:52,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:40:52,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965093546] [2021-12-06 17:40:52,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:52,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:40:52,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:52,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:40:52,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:40:52,932 INFO L87 Difference]: Start difference. First operand 5069 states and 6798 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 17:40:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:53,760 INFO L93 Difference]: Finished difference Result 15120 states and 20874 transitions. [2021-12-06 17:40:53,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-06 17:40:53,761 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 75 [2021-12-06 17:40:53,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:53,807 INFO L225 Difference]: With dead ends: 15120 [2021-12-06 17:40:53,807 INFO L226 Difference]: Without dead ends: 10237 [2021-12-06 17:40:53,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-06 17:40:53,819 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 946 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:53,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [977 Valid, 1234 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:40:53,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10237 states. [2021-12-06 17:40:54,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10237 to 7443. [2021-12-06 17:40:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7443 states, 6308 states have (on average 1.3202282815472417) internal successors, (8328), 6388 states have internal predecessors, (8328), 687 states have call successors, (687), 411 states have call predecessors, (687), 447 states have return successors, (971), 644 states have call predecessors, (971), 684 states have call successors, (971) [2021-12-06 17:40:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7443 states to 7443 states and 9986 transitions. [2021-12-06 17:40:54,294 INFO L78 Accepts]: Start accepts. Automaton has 7443 states and 9986 transitions. Word has length 75 [2021-12-06 17:40:54,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:54,294 INFO L470 AbstractCegarLoop]: Abstraction has 7443 states and 9986 transitions. [2021-12-06 17:40:54,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 17:40:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 7443 states and 9986 transitions. [2021-12-06 17:40:54,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-06 17:40:54,296 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:54,296 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:54,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 17:40:54,296 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:54,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:54,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1139883952, now seen corresponding path program 1 times [2021-12-06 17:40:54,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:54,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813419758] [2021-12-06 17:40:54,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:54,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:54,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:40:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:54,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:40:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:54,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:40:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:54,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:40:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:54,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:40:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:54,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 17:40:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-06 17:40:54,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:54,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813419758] [2021-12-06 17:40:54,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813419758] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:40:54,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093203307] [2021-12-06 17:40:54,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:54,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:40:54,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:40:54,338 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:40:54,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 17:40:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:54,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:40:54,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:40:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:54,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:40:54,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093203307] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:54,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:40:54,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-12-06 17:40:54,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080214307] [2021-12-06 17:40:54,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:54,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:40:54,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:54,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:40:54,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:40:54,444 INFO L87 Difference]: Start difference. First operand 7443 states and 9986 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 17:40:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:54,970 INFO L93 Difference]: Finished difference Result 19570 states and 26516 transitions. [2021-12-06 17:40:54,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:40:54,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 79 [2021-12-06 17:40:54,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:55,011 INFO L225 Difference]: With dead ends: 19570 [2021-12-06 17:40:55,011 INFO L226 Difference]: Without dead ends: 12139 [2021-12-06 17:40:55,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:40:55,029 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 128 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:55,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 478 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:40:55,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12139 states. [2021-12-06 17:40:55,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12139 to 11576. [2021-12-06 17:40:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11576 states, 9763 states have (on average 1.3097408583427226) internal successors, (12787), 9893 states have internal predecessors, (12787), 1097 states have call successors, (1097), 657 states have call predecessors, (1097), 715 states have return successors, (1717), 1027 states have call predecessors, (1717), 1094 states have call successors, (1717) [2021-12-06 17:40:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11576 states to 11576 states and 15601 transitions. [2021-12-06 17:40:55,632 INFO L78 Accepts]: Start accepts. Automaton has 11576 states and 15601 transitions. Word has length 79 [2021-12-06 17:40:55,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:55,632 INFO L470 AbstractCegarLoop]: Abstraction has 11576 states and 15601 transitions. [2021-12-06 17:40:55,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 17:40:55,632 INFO L276 IsEmpty]: Start isEmpty. Operand 11576 states and 15601 transitions. [2021-12-06 17:40:55,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-06 17:40:55,635 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:55,635 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:55,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 17:40:55,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:40:55,837 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:55,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:55,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1579582129, now seen corresponding path program 1 times [2021-12-06 17:40:55,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:55,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501195822] [2021-12-06 17:40:55,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:55,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:55,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:40:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:55,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:40:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:55,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:40:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:55,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:40:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:55,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:40:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:55,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 17:40:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:55,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 17:40:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:55,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 17:40:55,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:55,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501195822] [2021-12-06 17:40:55,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501195822] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:55,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:40:55,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:40:55,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961587268] [2021-12-06 17:40:55,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:55,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:40:55,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:55,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:40:55,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:40:55,922 INFO L87 Difference]: Start difference. First operand 11576 states and 15601 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:40:57,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:57,229 INFO L93 Difference]: Finished difference Result 29101 states and 39401 transitions. [2021-12-06 17:40:57,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 17:40:57,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 84 [2021-12-06 17:40:57,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:57,280 INFO L225 Difference]: With dead ends: 29101 [2021-12-06 17:40:57,280 INFO L226 Difference]: Without dead ends: 19000 [2021-12-06 17:40:57,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-06 17:40:57,305 INFO L933 BasicCegarLoop]: 478 mSDtfsCounter, 800 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:57,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [832 Valid, 1259 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:40:57,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19000 states. [2021-12-06 17:40:58,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19000 to 15958. [2021-12-06 17:40:58,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15958 states, 13549 states have (on average 1.318916525204812) internal successors, (17870), 13759 states have internal predecessors, (17870), 1425 states have call successors, (1425), 853 states have call predecessors, (1425), 983 states have return successors, (2443), 1347 states have call predecessors, (2443), 1422 states have call successors, (2443) [2021-12-06 17:40:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15958 states to 15958 states and 21738 transitions. [2021-12-06 17:40:58,178 INFO L78 Accepts]: Start accepts. Automaton has 15958 states and 21738 transitions. Word has length 84 [2021-12-06 17:40:58,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:58,178 INFO L470 AbstractCegarLoop]: Abstraction has 15958 states and 21738 transitions. [2021-12-06 17:40:58,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:40:58,179 INFO L276 IsEmpty]: Start isEmpty. Operand 15958 states and 21738 transitions. [2021-12-06 17:40:58,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-06 17:40:58,182 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:58,182 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:58,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 17:40:58,183 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:40:58,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:58,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1643055201, now seen corresponding path program 1 times [2021-12-06 17:40:58,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:58,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779535530] [2021-12-06 17:40:58,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:58,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:58,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:40:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:58,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:40:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:58,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:40:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:58,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:40:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:58,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:40:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:58,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 17:40:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:58,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 17:40:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 17:40:58,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:58,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779535530] [2021-12-06 17:40:58,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779535530] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:58,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:40:58,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:40:58,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712302999] [2021-12-06 17:40:58,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:58,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:40:58,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:58,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:40:58,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:40:58,264 INFO L87 Difference]: Start difference. First operand 15958 states and 21738 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:41:00,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:00,509 INFO L93 Difference]: Finished difference Result 48940 states and 68972 transitions. [2021-12-06 17:41:00,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-06 17:41:00,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 87 [2021-12-06 17:41:00,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:00,612 INFO L225 Difference]: With dead ends: 48940 [2021-12-06 17:41:00,612 INFO L226 Difference]: Without dead ends: 34457 [2021-12-06 17:41:00,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2021-12-06 17:41:00,642 INFO L933 BasicCegarLoop]: 740 mSDtfsCounter, 1080 mSDsluCounter, 2127 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 2867 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:00,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1124 Valid, 2867 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-06 17:41:00,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34457 states. [2021-12-06 17:41:01,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34457 to 23023. [2021-12-06 17:41:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23023 states, 19606 states have (on average 1.3243904927063144) internal successors, (25966), 19886 states have internal predecessors, (25966), 2016 states have call successors, (2016), 1207 states have call predecessors, (2016), 1400 states have return successors, (3536), 1931 states have call predecessors, (3536), 2013 states have call successors, (3536) [2021-12-06 17:41:01,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23023 states to 23023 states and 31518 transitions. [2021-12-06 17:41:01,987 INFO L78 Accepts]: Start accepts. Automaton has 23023 states and 31518 transitions. Word has length 87 [2021-12-06 17:41:01,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:01,987 INFO L470 AbstractCegarLoop]: Abstraction has 23023 states and 31518 transitions. [2021-12-06 17:41:01,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:41:01,987 INFO L276 IsEmpty]: Start isEmpty. Operand 23023 states and 31518 transitions. [2021-12-06 17:41:01,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-06 17:41:01,991 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:01,991 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:41:01,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 17:41:01,991 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:01,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:01,992 INFO L85 PathProgramCache]: Analyzing trace with hash -585804370, now seen corresponding path program 1 times [2021-12-06 17:41:01,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:01,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344555848] [2021-12-06 17:41:01,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:01,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:02,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:02,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:02,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:41:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:02,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:41:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:02,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:41:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:02,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 17:41:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:02,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 17:41:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:02,039 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 17:41:02,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:02,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344555848] [2021-12-06 17:41:02,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344555848] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:02,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:41:02,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:41:02,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328387710] [2021-12-06 17:41:02,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:02,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:41:02,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:02,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:41:02,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:41:02,040 INFO L87 Difference]: Start difference. First operand 23023 states and 31518 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 5 states have internal predecessors, (78), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 17:41:04,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:04,656 INFO L93 Difference]: Finished difference Result 70442 states and 97850 transitions. [2021-12-06 17:41:04,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-06 17:41:04,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 5 states have internal predecessors, (78), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 95 [2021-12-06 17:41:04,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:04,783 INFO L225 Difference]: With dead ends: 70442 [2021-12-06 17:41:04,784 INFO L226 Difference]: Without dead ends: 47435 [2021-12-06 17:41:04,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2021-12-06 17:41:04,830 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 1162 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:04,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1177 Valid, 1049 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:41:04,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47435 states. [2021-12-06 17:41:07,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47435 to 44532. [2021-12-06 17:41:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44532 states, 37825 states have (on average 1.2966556510244547) internal successors, (49046), 38360 states have internal predecessors, (49046), 3900 states have call successors, (3900), 2376 states have call predecessors, (3900), 2806 states have return successors, (7008), 3797 states have call predecessors, (7008), 3897 states have call successors, (7008) [2021-12-06 17:41:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44532 states to 44532 states and 59954 transitions. [2021-12-06 17:41:07,372 INFO L78 Accepts]: Start accepts. Automaton has 44532 states and 59954 transitions. Word has length 95 [2021-12-06 17:41:07,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:07,372 INFO L470 AbstractCegarLoop]: Abstraction has 44532 states and 59954 transitions. [2021-12-06 17:41:07,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 5 states have internal predecessors, (78), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 17:41:07,373 INFO L276 IsEmpty]: Start isEmpty. Operand 44532 states and 59954 transitions. [2021-12-06 17:41:07,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-12-06 17:41:07,377 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:07,377 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:41:07,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 17:41:07,377 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:07,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:07,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1094142346, now seen corresponding path program 1 times [2021-12-06 17:41:07,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:07,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264593038] [2021-12-06 17:41:07,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:07,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:07,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:07,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:07,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:41:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:07,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:41:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:07,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:41:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:07,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 17:41:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:07,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 17:41:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:07,431 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 17:41:07,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:07,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264593038] [2021-12-06 17:41:07,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264593038] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:07,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393133289] [2021-12-06 17:41:07,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:07,432 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:07,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:41:07,433 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:41:07,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 17:41:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:07,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 17:41:07,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:41:07,594 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:07,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:41:07,749 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 17:41:07,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393133289] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:07,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:41:07,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 7] total 15 [2021-12-06 17:41:07,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400806879] [2021-12-06 17:41:07,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:07,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:41:07,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:07,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:41:07,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-12-06 17:41:07,752 INFO L87 Difference]: Start difference. First operand 44532 states and 59954 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:41:09,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:09,924 INFO L93 Difference]: Finished difference Result 47192 states and 63262 transitions. [2021-12-06 17:41:09,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 17:41:09,924 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 96 [2021-12-06 17:41:09,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:10,025 INFO L225 Difference]: With dead ends: 47192 [2021-12-06 17:41:10,025 INFO L226 Difference]: Without dead ends: 47189 [2021-12-06 17:41:10,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 198 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2021-12-06 17:41:10,042 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 318 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:10,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 1088 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:41:10,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47189 states. [2021-12-06 17:41:12,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47189 to 45616. [2021-12-06 17:41:12,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45616 states, 38728 states have (on average 1.293792604833712) internal successors, (50106), 39281 states have internal predecessors, (50106), 4006 states have call successors, (4006), 2443 states have call predecessors, (4006), 2881 states have return successors, (7155), 3893 states have call predecessors, (7155), 4003 states have call successors, (7155) [2021-12-06 17:41:12,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45616 states to 45616 states and 61267 transitions. [2021-12-06 17:41:12,809 INFO L78 Accepts]: Start accepts. Automaton has 45616 states and 61267 transitions. Word has length 96 [2021-12-06 17:41:12,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:12,810 INFO L470 AbstractCegarLoop]: Abstraction has 45616 states and 61267 transitions. [2021-12-06 17:41:12,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:41:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 45616 states and 61267 transitions. [2021-12-06 17:41:12,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-06 17:41:12,814 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:12,815 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:41:12,835 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 17:41:13,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-06 17:41:13,016 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:13,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:13,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2018622111, now seen corresponding path program 1 times [2021-12-06 17:41:13,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:13,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819750771] [2021-12-06 17:41:13,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:13,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:13,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:13,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:13,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:41:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:13,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:41:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:13,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:41:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:13,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 17:41:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:13,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 17:41:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:13,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-06 17:41:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 17:41:13,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:13,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819750771] [2021-12-06 17:41:13,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819750771] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:13,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:41:13,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:41:13,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332007752] [2021-12-06 17:41:13,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:13,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:41:13,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:13,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:41:13,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:41:13,082 INFO L87 Difference]: Start difference. First operand 45616 states and 61267 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 17:41:15,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:15,803 INFO L93 Difference]: Finished difference Result 95017 states and 127534 transitions. [2021-12-06 17:41:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:41:15,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 97 [2021-12-06 17:41:15,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:15,913 INFO L225 Difference]: With dead ends: 95017 [2021-12-06 17:41:15,913 INFO L226 Difference]: Without dead ends: 49417 [2021-12-06 17:41:15,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-12-06 17:41:15,975 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 376 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:15,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 570 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:41:16,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49417 states. [2021-12-06 17:41:18,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49417 to 45504. [2021-12-06 17:41:18,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45504 states, 38504 states have (on average 1.2854768335757323) internal successors, (49496), 39169 states have internal predecessors, (49496), 4006 states have call successors, (4006), 2443 states have call predecessors, (4006), 2993 states have return successors, (6707), 3893 states have call predecessors, (6707), 4003 states have call successors, (6707) [2021-12-06 17:41:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45504 states to 45504 states and 60209 transitions. [2021-12-06 17:41:18,390 INFO L78 Accepts]: Start accepts. Automaton has 45504 states and 60209 transitions. Word has length 97 [2021-12-06 17:41:18,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:18,390 INFO L470 AbstractCegarLoop]: Abstraction has 45504 states and 60209 transitions. [2021-12-06 17:41:18,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 17:41:18,390 INFO L276 IsEmpty]: Start isEmpty. Operand 45504 states and 60209 transitions. [2021-12-06 17:41:18,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-06 17:41:18,394 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:18,395 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:41:18,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-06 17:41:18,395 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:18,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:18,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1281651487, now seen corresponding path program 1 times [2021-12-06 17:41:18,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:18,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20153220] [2021-12-06 17:41:18,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:18,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:18,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:18,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:18,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:41:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:18,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:41:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:18,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:41:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:18,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 17:41:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:18,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 17:41:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:18,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-06 17:41:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 17:41:18,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:18,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20153220] [2021-12-06 17:41:18,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20153220] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:18,430 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:41:18,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:41:18,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799105452] [2021-12-06 17:41:18,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:18,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:41:18,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:18,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:41:18,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:41:18,431 INFO L87 Difference]: Start difference. First operand 45504 states and 60209 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:41:21,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:21,121 INFO L93 Difference]: Finished difference Result 51692 states and 68590 transitions. [2021-12-06 17:41:21,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:41:21,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 97 [2021-12-06 17:41:21,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:21,245 INFO L225 Difference]: With dead ends: 51692 [2021-12-06 17:41:21,245 INFO L226 Difference]: Without dead ends: 49214 [2021-12-06 17:41:21,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:41:21,270 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 308 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:21,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 335 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:41:21,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49214 states. [2021-12-06 17:41:23,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49214 to 45341. [2021-12-06 17:41:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45341 states, 38371 states have (on average 1.2857366240129264) internal successors, (49335), 39034 states have internal predecessors, (49335), 3987 states have call successors, (3987), 2433 states have call predecessors, (3987), 2982 states have return successors, (6686), 3874 states have call predecessors, (6686), 3984 states have call successors, (6686) [2021-12-06 17:41:23,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45341 states to 45341 states and 60008 transitions. [2021-12-06 17:41:23,775 INFO L78 Accepts]: Start accepts. Automaton has 45341 states and 60008 transitions. Word has length 97 [2021-12-06 17:41:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:23,776 INFO L470 AbstractCegarLoop]: Abstraction has 45341 states and 60008 transitions. [2021-12-06 17:41:23,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:41:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 45341 states and 60008 transitions. [2021-12-06 17:41:23,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-06 17:41:23,780 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:23,780 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:41:23,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-06 17:41:23,780 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:23,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:23,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1766914234, now seen corresponding path program 1 times [2021-12-06 17:41:23,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:23,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789645118] [2021-12-06 17:41:23,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:23,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:23,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:23,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:23,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:41:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:23,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:41:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:23,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:41:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:23,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 17:41:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:23,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 17:41:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:23,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 17:41:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:23,827 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 17:41:23,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:23,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789645118] [2021-12-06 17:41:23,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789645118] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:23,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:41:23,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:41:23,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025709600] [2021-12-06 17:41:23,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:23,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:41:23,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:23,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:41:23,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:41:23,829 INFO L87 Difference]: Start difference. First operand 45341 states and 60008 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 17:41:26,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:26,687 INFO L93 Difference]: Finished difference Result 93536 states and 123840 transitions. [2021-12-06 17:41:26,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-06 17:41:26,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 98 [2021-12-06 17:41:26,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:26,798 INFO L225 Difference]: With dead ends: 93536 [2021-12-06 17:41:26,799 INFO L226 Difference]: Without dead ends: 48207 [2021-12-06 17:41:26,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2021-12-06 17:41:26,874 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 1252 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:26,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1267 Valid, 999 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:41:26,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48207 states. [2021-12-06 17:41:29,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48207 to 45479. [2021-12-06 17:41:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45479 states, 38509 states have (on average 1.2777792204419747) internal successors, (49206), 39172 states have internal predecessors, (49206), 3987 states have call successors, (3987), 2433 states have call predecessors, (3987), 2982 states have return successors, (6350), 3874 states have call predecessors, (6350), 3984 states have call successors, (6350) [2021-12-06 17:41:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45479 states to 45479 states and 59543 transitions. [2021-12-06 17:41:29,411 INFO L78 Accepts]: Start accepts. Automaton has 45479 states and 59543 transitions. Word has length 98 [2021-12-06 17:41:29,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:29,412 INFO L470 AbstractCegarLoop]: Abstraction has 45479 states and 59543 transitions. [2021-12-06 17:41:29,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 17:41:29,412 INFO L276 IsEmpty]: Start isEmpty. Operand 45479 states and 59543 transitions. [2021-12-06 17:41:29,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-12-06 17:41:29,419 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:29,420 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:41:29,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-06 17:41:29,420 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:29,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:29,420 INFO L85 PathProgramCache]: Analyzing trace with hash 274261474, now seen corresponding path program 1 times [2021-12-06 17:41:29,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:29,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654326177] [2021-12-06 17:41:29,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:29,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:29,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:29,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:29,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:41:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:29,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:41:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:29,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:41:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:29,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 17:41:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:29,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 17:41:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:29,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 17:41:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:29,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-06 17:41:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-06 17:41:29,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:29,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654326177] [2021-12-06 17:41:29,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654326177] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:29,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:41:29,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:41:29,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267855097] [2021-12-06 17:41:29,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:29,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:41:29,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:29,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:41:29,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:41:29,471 INFO L87 Difference]: Start difference. First operand 45479 states and 59543 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 17:41:33,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:33,610 INFO L93 Difference]: Finished difference Result 123351 states and 162423 transitions. [2021-12-06 17:41:33,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 17:41:33,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 120 [2021-12-06 17:41:33,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:33,780 INFO L225 Difference]: With dead ends: 123351 [2021-12-06 17:41:33,781 INFO L226 Difference]: Without dead ends: 78973 [2021-12-06 17:41:33,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:41:33,844 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 394 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:33,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [403 Valid, 503 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:41:33,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78973 states. [2021-12-06 17:41:37,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78973 to 72408. [2021-12-06 17:41:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72408 states, 61512 states have (on average 1.2818311874105865) internal successors, (78848), 62588 states have internal predecessors, (78848), 6164 states have call successors, (6164), 3832 states have call predecessors, (6164), 4731 states have return successors, (9893), 5988 states have call predecessors, (9893), 6161 states have call successors, (9893) [2021-12-06 17:41:37,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72408 states to 72408 states and 94905 transitions. [2021-12-06 17:41:37,951 INFO L78 Accepts]: Start accepts. Automaton has 72408 states and 94905 transitions. Word has length 120 [2021-12-06 17:41:37,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:37,952 INFO L470 AbstractCegarLoop]: Abstraction has 72408 states and 94905 transitions. [2021-12-06 17:41:37,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 17:41:37,952 INFO L276 IsEmpty]: Start isEmpty. Operand 72408 states and 94905 transitions. [2021-12-06 17:41:37,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-06 17:41:37,965 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:37,965 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:41:37,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-06 17:41:37,966 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:37,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:37,966 INFO L85 PathProgramCache]: Analyzing trace with hash -46894051, now seen corresponding path program 1 times [2021-12-06 17:41:37,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:37,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364308563] [2021-12-06 17:41:37,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:37,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:37,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:37,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:37,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:41:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:38,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:41:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:38,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:41:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:38,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-06 17:41:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:38,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 17:41:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:38,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 17:41:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:38,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-06 17:41:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:38,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-06 17:41:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 21 proven. 16 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-06 17:41:38,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:38,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364308563] [2021-12-06 17:41:38,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364308563] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:38,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423439211] [2021-12-06 17:41:38,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:38,033 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:38,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:41:38,034 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:41:38,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 17:41:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:38,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:41:38,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:41:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 17:41:38,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:41:38,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423439211] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:38,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:41:38,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2021-12-06 17:41:38,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381259293] [2021-12-06 17:41:38,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:38,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:41:38,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:38,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:41:38,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:41:38,208 INFO L87 Difference]: Start difference. First operand 72408 states and 94905 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 17:41:43,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:43,626 INFO L93 Difference]: Finished difference Result 160648 states and 209429 transitions. [2021-12-06 17:41:43,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:41:43,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 137 [2021-12-06 17:41:43,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:43,877 INFO L225 Difference]: With dead ends: 160648 [2021-12-06 17:41:43,877 INFO L226 Difference]: Without dead ends: 103970 [2021-12-06 17:41:43,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:41:43,983 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 80 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:43,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 357 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:41:44,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103970 states. [2021-12-06 17:41:49,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103970 to 103965. [2021-12-06 17:41:49,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103965 states, 87905 states have (on average 1.2687105397872704) internal successors, (111526), 89407 states have internal predecessors, (111526), 8954 states have call successors, (8954), 5826 states have call predecessors, (8954), 7105 states have return successors, (13362), 8732 states have call predecessors, (13362), 8951 states have call successors, (13362) [2021-12-06 17:41:49,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103965 states to 103965 states and 133842 transitions. [2021-12-06 17:41:49,891 INFO L78 Accepts]: Start accepts. Automaton has 103965 states and 133842 transitions. Word has length 137 [2021-12-06 17:41:49,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:49,892 INFO L470 AbstractCegarLoop]: Abstraction has 103965 states and 133842 transitions. [2021-12-06 17:41:49,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 17:41:49,892 INFO L276 IsEmpty]: Start isEmpty. Operand 103965 states and 133842 transitions. [2021-12-06 17:41:49,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-12-06 17:41:49,905 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:49,905 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:41:49,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-06 17:41:50,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-06 17:41:50,108 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:50,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:50,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1815710136, now seen corresponding path program 1 times [2021-12-06 17:41:50,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:50,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570507124] [2021-12-06 17:41:50,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:50,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:41:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:41:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:41:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-06 17:41:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-06 17:41:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-06 17:41:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-06 17:41:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 17:41:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-06 17:41:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-06 17:41:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-06 17:41:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,176 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-06 17:41:50,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:50,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570507124] [2021-12-06 17:41:50,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570507124] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:50,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466271906] [2021-12-06 17:41:50,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:50,176 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:50,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:41:50,177 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:41:50,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 17:41:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:41:50,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:41:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-06 17:41:50,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:41:50,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466271906] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:50,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:41:50,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2021-12-06 17:41:50,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657786988] [2021-12-06 17:41:50,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:50,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:41:50,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:50,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:41:50,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:41:50,349 INFO L87 Difference]: Start difference. First operand 103965 states and 133842 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-06 17:42:00,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:00,657 INFO L93 Difference]: Finished difference Result 298823 states and 390224 transitions. [2021-12-06 17:42:00,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:42:00,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 144 [2021-12-06 17:42:00,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:01,285 INFO L225 Difference]: With dead ends: 298823 [2021-12-06 17:42:01,285 INFO L226 Difference]: Without dead ends: 201274 [2021-12-06 17:42:01,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:42:01,446 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 104 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:01,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 355 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:42:01,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201274 states. [2021-12-06 17:42:12,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201274 to 199631. [2021-12-06 17:42:12,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199631 states, 168987 states have (on average 1.2640439797144158) internal successors, (213607), 171920 states have internal predecessors, (213607), 17005 states have call successors, (17005), 11135 states have call predecessors, (17005), 13638 states have return successors, (25238), 16576 states have call predecessors, (25238), 17002 states have call successors, (25238) [2021-12-06 17:42:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199631 states to 199631 states and 255850 transitions. [2021-12-06 17:42:12,955 INFO L78 Accepts]: Start accepts. Automaton has 199631 states and 255850 transitions. Word has length 144 [2021-12-06 17:42:12,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:12,955 INFO L470 AbstractCegarLoop]: Abstraction has 199631 states and 255850 transitions. [2021-12-06 17:42:12,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-06 17:42:12,956 INFO L276 IsEmpty]: Start isEmpty. Operand 199631 states and 255850 transitions. [2021-12-06 17:42:12,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-12-06 17:42:12,970 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:12,970 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:12,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 17:42:13,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:13,172 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:42:13,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:13,174 INFO L85 PathProgramCache]: Analyzing trace with hash -2019564232, now seen corresponding path program 1 times [2021-12-06 17:42:13,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:13,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302183104] [2021-12-06 17:42:13,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:13,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:42:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:42:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:42:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:42:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:42:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-06 17:42:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-06 17:42:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-06 17:42:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-06 17:42:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-06 17:42:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-06 17:42:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-06 17:42:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-06 17:42:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,237 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-06 17:42:13,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:13,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302183104] [2021-12-06 17:42:13,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302183104] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:42:13,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587427830] [2021-12-06 17:42:13,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:13,238 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:13,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:13,239 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:42:13,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 17:42:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:42:13,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:13,393 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-06 17:42:13,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:13,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587427830] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:13,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:42:13,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2021-12-06 17:42:13,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154326348] [2021-12-06 17:42:13,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:13,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:42:13,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:13,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:42:13,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:42:13,394 INFO L87 Difference]: Start difference. First operand 199631 states and 255850 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-06 17:42:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:23,264 INFO L93 Difference]: Finished difference Result 371874 states and 479298 transitions. [2021-12-06 17:42:23,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:42:23,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 145 [2021-12-06 17:42:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:23,715 INFO L225 Difference]: With dead ends: 371874 [2021-12-06 17:42:23,715 INFO L226 Difference]: Without dead ends: 178659 [2021-12-06 17:42:23,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:42:23,990 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 91 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:23,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 357 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:42:24,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178659 states. [2021-12-06 17:42:33,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178659 to 178654. [2021-12-06 17:42:33,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178654 states, 151357 states have (on average 1.2633508856544462) internal successors, (191217), 153940 states have internal predecessors, (191217), 15247 states have call successors, (15247), 9860 states have call predecessors, (15247), 12049 states have return successors, (23010), 14854 states have call predecessors, (23010), 15244 states have call successors, (23010) [2021-12-06 17:42:34,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178654 states to 178654 states and 229474 transitions. [2021-12-06 17:42:34,370 INFO L78 Accepts]: Start accepts. Automaton has 178654 states and 229474 transitions. Word has length 145 [2021-12-06 17:42:34,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:34,371 INFO L470 AbstractCegarLoop]: Abstraction has 178654 states and 229474 transitions. [2021-12-06 17:42:34,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-06 17:42:34,371 INFO L276 IsEmpty]: Start isEmpty. Operand 178654 states and 229474 transitions. [2021-12-06 17:42:34,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-06 17:42:34,388 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:34,389 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:34,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-06 17:42:34,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:34,591 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:42:34,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:34,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1223161892, now seen corresponding path program 1 times [2021-12-06 17:42:34,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:34,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043233579] [2021-12-06 17:42:34,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:34,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:34,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:42:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:34,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:42:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:34,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:42:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:34,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:42:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:34,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:42:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:34,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-06 17:42:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:34,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 17:42:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:34,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-06 17:42:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:34,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 17:42:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:34,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 17:42:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:34,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-06 17:42:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:34,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-06 17:42:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:34,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-06 17:42:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:34,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-06 17:42:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:34,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-06 17:42:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-12-06 17:42:34,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:34,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043233579] [2021-12-06 17:42:34,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043233579] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:42:34,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589258875] [2021-12-06 17:42:34,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:34,670 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:34,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:34,671 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:42:34,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 17:42:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:34,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:42:34,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-06 17:42:34,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:34,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589258875] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:34,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:42:34,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2021-12-06 17:42:34,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116704550] [2021-12-06 17:42:34,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:34,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:42:34,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:34,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:42:34,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:42:34,872 INFO L87 Difference]: Start difference. First operand 178654 states and 229474 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-06 17:42:43,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:43,125 INFO L93 Difference]: Finished difference Result 328834 states and 424510 transitions. [2021-12-06 17:42:43,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:42:43,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 162 [2021-12-06 17:42:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:43,508 INFO L225 Difference]: With dead ends: 328834 [2021-12-06 17:42:43,508 INFO L226 Difference]: Without dead ends: 150191 [2021-12-06 17:42:43,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:42:43,764 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 80 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:43,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 355 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:42:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150191 states. [2021-12-06 17:42:52,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150191 to 150187. [2021-12-06 17:42:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150187 states, 127408 states have (on average 1.2684839256561597) internal successors, (161615), 129546 states have internal predecessors, (161615), 12840 states have call successors, (12840), 8139 states have call predecessors, (12840), 9938 states have return successors, (19949), 12502 states have call predecessors, (19949), 12837 states have call successors, (19949) [2021-12-06 17:42:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150187 states to 150187 states and 194404 transitions. [2021-12-06 17:42:52,475 INFO L78 Accepts]: Start accepts. Automaton has 150187 states and 194404 transitions. Word has length 162 [2021-12-06 17:42:52,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:52,475 INFO L470 AbstractCegarLoop]: Abstraction has 150187 states and 194404 transitions. [2021-12-06 17:42:52,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-06 17:42:52,476 INFO L276 IsEmpty]: Start isEmpty. Operand 150187 states and 194404 transitions. [2021-12-06 17:42:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-12-06 17:42:52,493 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:52,493 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:52,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-06 17:42:52,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:52,694 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:42:52,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:52,695 INFO L85 PathProgramCache]: Analyzing trace with hash 393612564, now seen corresponding path program 1 times [2021-12-06 17:42:52,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:52,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818522052] [2021-12-06 17:42:52,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:52,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:52,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:42:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:52,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:42:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:52,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:42:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:52,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:42:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:52,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:42:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:52,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-06 17:42:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:52,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-06 17:42:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:52,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-06 17:42:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:52,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-06 17:42:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:52,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-06 17:42:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:52,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-06 17:42:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:52,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-06 17:42:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:52,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-06 17:42:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:52,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-12-06 17:42:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-12-06 17:42:52,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:52,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818522052] [2021-12-06 17:42:52,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818522052] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:42:52,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624445489] [2021-12-06 17:42:52,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:52,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:52,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:52,765 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:42:52,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 17:42:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:52,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:42:52,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:52,979 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-06 17:42:52,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:52,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624445489] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:52,980 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:42:52,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2021-12-06 17:42:52,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666382515] [2021-12-06 17:42:52,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:52,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:42:52,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:52,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:42:52,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:42:52,981 INFO L87 Difference]: Start difference. First operand 150187 states and 194404 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-06 17:43:03,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:03,259 INFO L93 Difference]: Finished difference Result 345590 states and 465680 transitions. [2021-12-06 17:43:03,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:43:03,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 173 [2021-12-06 17:43:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:03,823 INFO L225 Difference]: With dead ends: 345590 [2021-12-06 17:43:03,823 INFO L226 Difference]: Without dead ends: 201086 [2021-12-06 17:43:04,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:43:04,136 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 124 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:04,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 331 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:43:04,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201086 states. [2021-12-06 17:43:15,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201086 to 198269. [2021-12-06 17:43:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198269 states, 167492 states have (on average 1.253510615432379) internal successors, (209953), 170181 states have internal predecessors, (209953), 17449 states have call successors, (17449), 11026 states have call predecessors, (17449), 13327 states have return successors, (32044), 17062 states have call predecessors, (32044), 17446 states have call successors, (32044) [2021-12-06 17:43:16,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198269 states to 198269 states and 259446 transitions. [2021-12-06 17:43:16,022 INFO L78 Accepts]: Start accepts. Automaton has 198269 states and 259446 transitions. Word has length 173 [2021-12-06 17:43:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:16,022 INFO L470 AbstractCegarLoop]: Abstraction has 198269 states and 259446 transitions. [2021-12-06 17:43:16,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-06 17:43:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 198269 states and 259446 transitions. [2021-12-06 17:43:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-12-06 17:43:16,042 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:16,042 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:16,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 17:43:16,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-06 17:43:16,244 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:43:16,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:16,245 INFO L85 PathProgramCache]: Analyzing trace with hash 315309112, now seen corresponding path program 1 times [2021-12-06 17:43:16,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:16,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79600560] [2021-12-06 17:43:16,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:16,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:16,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:43:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:16,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:43:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:16,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:43:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:16,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:43:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:16,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:43:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:16,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-06 17:43:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:16,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 17:43:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:16,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-06 17:43:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:16,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 17:43:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:16,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 17:43:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:16,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-06 17:43:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:16,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-06 17:43:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:16,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-06 17:43:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:16,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 17:43:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:16,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-06 17:43:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:16,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-12-06 17:43:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-12-06 17:43:16,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:16,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79600560] [2021-12-06 17:43:16,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79600560] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:43:16,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547408857] [2021-12-06 17:43:16,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:16,343 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:43:16,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:43:16,343 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:43:16,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 17:43:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:16,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:43:16,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:16,574 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-06 17:43:16,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:43:16,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547408857] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:16,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:43:16,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2021-12-06 17:43:16,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291647252] [2021-12-06 17:43:16,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:16,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:43:16,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:16,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:43:16,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:43:16,576 INFO L87 Difference]: Start difference. First operand 198269 states and 259446 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-06 17:43:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:29,519 INFO L93 Difference]: Finished difference Result 440422 states and 578874 transitions. [2021-12-06 17:43:29,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:43:29,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 190 [2021-12-06 17:43:29,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:30,323 INFO L225 Difference]: With dead ends: 440422 [2021-12-06 17:43:30,323 INFO L226 Difference]: Without dead ends: 243243 [2021-12-06 17:43:30,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:43:30,647 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 80 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:30,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 487 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:43:30,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243243 states. [2021-12-06 17:43:44,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243243 to 240163. [2021-12-06 17:43:44,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240163 states, 202534 states have (on average 1.246561071227547) internal successors, (252471), 205591 states have internal predecessors, (252471), 21510 states have call successors, (21510), 13588 states have call predecessors, (21510), 16118 states have return successors, (42074), 20985 states have call predecessors, (42074), 21507 states have call successors, (42074) [2021-12-06 17:43:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240163 states to 240163 states and 316055 transitions. [2021-12-06 17:43:45,234 INFO L78 Accepts]: Start accepts. Automaton has 240163 states and 316055 transitions. Word has length 190 [2021-12-06 17:43:45,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:45,234 INFO L470 AbstractCegarLoop]: Abstraction has 240163 states and 316055 transitions. [2021-12-06 17:43:45,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-06 17:43:45,234 INFO L276 IsEmpty]: Start isEmpty. Operand 240163 states and 316055 transitions. [2021-12-06 17:43:45,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-12-06 17:43:45,263 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:45,263 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:45,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 17:43:45,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-06 17:43:45,465 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:43:45,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:45,466 INFO L85 PathProgramCache]: Analyzing trace with hash 910912784, now seen corresponding path program 1 times [2021-12-06 17:43:45,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:45,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050678573] [2021-12-06 17:43:45,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:45,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:45,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:43:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:45,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:43:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:45,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:43:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:45,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:43:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:45,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:43:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:45,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-06 17:43:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:45,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 17:43:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:45,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-06 17:43:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:45,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-06 17:43:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:45,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-06 17:43:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:45,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 17:43:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:45,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-06 17:43:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:45,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-06 17:43:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:45,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-06 17:43:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:45,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-12-06 17:43:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:45,559 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-12-06 17:43:45,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:45,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050678573] [2021-12-06 17:43:45,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050678573] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:43:45,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980471709] [2021-12-06 17:43:45,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:45,560 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:43:45,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:43:45,561 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:43:45,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 17:43:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:45,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:43:45,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-06 17:43:45,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:43:45,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980471709] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:45,777 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:43:45,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2021-12-06 17:43:45,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122747339] [2021-12-06 17:43:45,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:45,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:43:45,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:45,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:43:45,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:43:45,778 INFO L87 Difference]: Start difference. First operand 240163 states and 316055 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-06 17:43:53,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:53,999 INFO L93 Difference]: Finished difference Result 362283 states and 481952 transitions. [2021-12-06 17:43:54,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:43:54,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 189 [2021-12-06 17:43:54,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:54,462 INFO L225 Difference]: With dead ends: 362283 [2021-12-06 17:43:54,462 INFO L226 Difference]: Without dead ends: 134657 [2021-12-06 17:43:54,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:43:54,844 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 80 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:54,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 484 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:43:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134657 states. [2021-12-06 17:44:02,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134657 to 132619. [2021-12-06 17:44:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132619 states, 112082 states have (on average 1.23395371246052) internal successors, (138304), 113883 states have internal predecessors, (138304), 11664 states have call successors, (11664), 7344 states have call predecessors, (11664), 8872 states have return successors, (19647), 11393 states have call predecessors, (19647), 11661 states have call successors, (19647) [2021-12-06 17:44:02,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132619 states to 132619 states and 169615 transitions. [2021-12-06 17:44:02,679 INFO L78 Accepts]: Start accepts. Automaton has 132619 states and 169615 transitions. Word has length 189 [2021-12-06 17:44:02,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:02,680 INFO L470 AbstractCegarLoop]: Abstraction has 132619 states and 169615 transitions. [2021-12-06 17:44:02,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-06 17:44:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 132619 states and 169615 transitions. [2021-12-06 17:44:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-12-06 17:44:02,705 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:02,706 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:44:02,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-06 17:44:02,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-06 17:44:02,907 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:44:02,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:02,908 INFO L85 PathProgramCache]: Analyzing trace with hash 520443893, now seen corresponding path program 1 times [2021-12-06 17:44:02,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:44:02,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941386413] [2021-12-06 17:44:02,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:02,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:44:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:44:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:44:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:44:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:44:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:44:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-06 17:44:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 17:44:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-06 17:44:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 17:44:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 17:44:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-06 17:44:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-06 17:44:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-06 17:44:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 17:44:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-06 17:44:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-12-06 17:44:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-12-06 17:44:02,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:44:02,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941386413] [2021-12-06 17:44:02,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941386413] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:44:02,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585002753] [2021-12-06 17:44:02,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:02,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:44:02,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:44:02,983 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:44:02,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 17:44:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:03,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:44:03,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:03,159 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-06 17:44:03,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:44:03,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585002753] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:44:03,159 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:44:03,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2021-12-06 17:44:03,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578629632] [2021-12-06 17:44:03,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:44:03,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:44:03,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:44:03,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:44:03,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:44:03,160 INFO L87 Difference]: Start difference. First operand 132619 states and 169615 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-06 17:44:11,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:11,255 INFO L93 Difference]: Finished difference Result 245142 states and 317416 transitions. [2021-12-06 17:44:11,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:44:11,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 191 [2021-12-06 17:44:11,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:11,612 INFO L225 Difference]: With dead ends: 245142 [2021-12-06 17:44:11,612 INFO L226 Difference]: Without dead ends: 134575 [2021-12-06 17:44:11,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:44:11,825 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 134 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:44:11,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 483 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:44:11,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134575 states. [2021-12-06 17:44:19,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134575 to 133990. [2021-12-06 17:44:19,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133990 states, 113205 states have (on average 1.2157236871162935) internal successors, (137626), 115017 states have internal predecessors, (137626), 11814 states have call successors, (11814), 7440 states have call predecessors, (11814), 8970 states have return successors, (19889), 11534 states have call predecessors, (19889), 11811 states have call successors, (19889) [2021-12-06 17:44:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133990 states to 133990 states and 169329 transitions. [2021-12-06 17:44:20,377 INFO L78 Accepts]: Start accepts. Automaton has 133990 states and 169329 transitions. Word has length 191 [2021-12-06 17:44:20,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:20,378 INFO L470 AbstractCegarLoop]: Abstraction has 133990 states and 169329 transitions. [2021-12-06 17:44:20,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-06 17:44:20,378 INFO L276 IsEmpty]: Start isEmpty. Operand 133990 states and 169329 transitions. [2021-12-06 17:44:20,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-12-06 17:44:20,403 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:20,403 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:44:20,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-06 17:44:20,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-06 17:44:20,605 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:44:20,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:20,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1057100526, now seen corresponding path program 1 times [2021-12-06 17:44:20,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:44:20,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764456459] [2021-12-06 17:44:20,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:20,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:44:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:20,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:44:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:20,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:44:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:20,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:44:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:20,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:44:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:20,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:44:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:20,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 17:44:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:20,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 17:44:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:20,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 17:44:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:20,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-06 17:44:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:20,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-06 17:44:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:20,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-06 17:44:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:20,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-06 17:44:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:20,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-06 17:44:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:20,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-06 17:44:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:20,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-06 17:44:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:20,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-06 17:44:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:20,695 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2021-12-06 17:44:20,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:44:20,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764456459] [2021-12-06 17:44:20,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764456459] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:44:20,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173664396] [2021-12-06 17:44:20,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:20,695 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:44:20,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:44:20,696 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:44:20,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 17:44:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:20,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 17:44:20,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:20,883 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-06 17:44:20,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:44:20,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173664396] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:44:20,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:44:20,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2021-12-06 17:44:20,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490120612] [2021-12-06 17:44:20,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:44:20,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:44:20,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:44:20,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:44:20,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-06 17:44:20,885 INFO L87 Difference]: Start difference. First operand 133990 states and 169329 transitions. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-06 17:44:26,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:26,380 INFO L93 Difference]: Finished difference Result 226982 states and 285818 transitions. [2021-12-06 17:44:26,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:44:26,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 192 [2021-12-06 17:44:26,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:26,582 INFO L225 Difference]: With dead ends: 226982 [2021-12-06 17:44:26,582 INFO L226 Difference]: Without dead ends: 93005 [2021-12-06 17:44:26,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-06 17:44:26,764 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 60 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:44:26,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 829 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:44:26,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93005 states. [2021-12-06 17:44:31,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93005 to 89539. [2021-12-06 17:44:31,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89539 states, 79221 states have (on average 1.216445134497166) internal successors, (96368), 80003 states have internal predecessors, (96368), 5510 states have call successors, (5510), 3395 states have call predecessors, (5510), 4807 states have return successors, (9346), 6140 states have call predecessors, (9346), 5507 states have call successors, (9346) [2021-12-06 17:44:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89539 states to 89539 states and 111224 transitions. [2021-12-06 17:44:32,106 INFO L78 Accepts]: Start accepts. Automaton has 89539 states and 111224 transitions. Word has length 192 [2021-12-06 17:44:32,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:32,106 INFO L470 AbstractCegarLoop]: Abstraction has 89539 states and 111224 transitions. [2021-12-06 17:44:32,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-06 17:44:32,106 INFO L276 IsEmpty]: Start isEmpty. Operand 89539 states and 111224 transitions. [2021-12-06 17:44:32,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-12-06 17:44:32,118 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:32,118 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:44:32,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-06 17:44:32,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:44:32,320 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:44:32,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:32,321 INFO L85 PathProgramCache]: Analyzing trace with hash 481356149, now seen corresponding path program 1 times [2021-12-06 17:44:32,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:44:32,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829706513] [2021-12-06 17:44:32,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:32,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:44:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:32,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:44:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:32,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:44:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:32,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:44:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:32,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:44:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:32,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:44:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:32,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 17:44:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:32,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 17:44:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:32,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-06 17:44:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:32,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-06 17:44:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:32,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-06 17:44:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:32,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-06 17:44:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:32,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-06 17:44:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:32,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-06 17:44:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:32,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-06 17:44:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:32,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-06 17:44:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:32,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2021-12-06 17:44:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:32,395 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2021-12-06 17:44:32,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:44:32,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829706513] [2021-12-06 17:44:32,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829706513] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:44:32,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:44:32,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:44:32,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145548076] [2021-12-06 17:44:32,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:44:32,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:44:32,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:44:32,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:44:32,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:44:32,397 INFO L87 Difference]: Start difference. First operand 89539 states and 111224 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-06 17:44:37,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:37,795 INFO L93 Difference]: Finished difference Result 175158 states and 217770 transitions. [2021-12-06 17:44:37,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 17:44:37,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 199 [2021-12-06 17:44:37,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:37,983 INFO L225 Difference]: With dead ends: 175158 [2021-12-06 17:44:37,983 INFO L226 Difference]: Without dead ends: 93407 [2021-12-06 17:44:38,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:44:38,078 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 260 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:44:38,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 429 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:44:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93407 states. [2021-12-06 17:44:42,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93407 to 86265. [2021-12-06 17:44:43,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86265 states, 76422 states have (on average 1.218968359896365) internal successors, (93156), 77189 states have internal predecessors, (93156), 5239 states have call successors, (5239), 3213 states have call predecessors, (5239), 4603 states have return successors, (8972), 5862 states have call predecessors, (8972), 5236 states have call successors, (8972) [2021-12-06 17:44:43,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86265 states to 86265 states and 107367 transitions. [2021-12-06 17:44:43,213 INFO L78 Accepts]: Start accepts. Automaton has 86265 states and 107367 transitions. Word has length 199 [2021-12-06 17:44:43,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:43,214 INFO L470 AbstractCegarLoop]: Abstraction has 86265 states and 107367 transitions. [2021-12-06 17:44:43,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-06 17:44:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 86265 states and 107367 transitions. [2021-12-06 17:44:43,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-12-06 17:44:43,223 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:43,223 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:44:43,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-06 17:44:43,224 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:44:43,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:43,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1285676191, now seen corresponding path program 1 times [2021-12-06 17:44:43,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:44:43,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107679192] [2021-12-06 17:44:43,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:43,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:44:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:43,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:44:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:43,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:44:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:43,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:44:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:43,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:44:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:43,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:44:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:43,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 17:44:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:43,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 17:44:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:43,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-06 17:44:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:43,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-06 17:44:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:43,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-06 17:44:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:43,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-06 17:44:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:43,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-06 17:44:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:43,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-06 17:44:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:43,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-06 17:44:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:43,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-06 17:44:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:43,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-12-06 17:44:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-12-06 17:44:43,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:44:43,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107679192] [2021-12-06 17:44:43,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107679192] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:44:43,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529916226] [2021-12-06 17:44:43,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:43,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:44:43,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:44:43,282 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:44:43,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-06 17:44:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:43,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:44:43,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:43,469 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-06 17:44:43,469 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:44:43,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529916226] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:44:43,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:44:43,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-06 17:44:43,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695224145] [2021-12-06 17:44:43,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:44:43,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:44:43,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:44:43,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:44:43,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:44:43,470 INFO L87 Difference]: Start difference. First operand 86265 states and 107367 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-06 17:44:48,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:48,593 INFO L93 Difference]: Finished difference Result 171006 states and 215215 transitions. [2021-12-06 17:44:48,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:44:48,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 206 [2021-12-06 17:44:48,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:48,760 INFO L225 Difference]: With dead ends: 171006 [2021-12-06 17:44:48,760 INFO L226 Difference]: Without dead ends: 86742 [2021-12-06 17:44:48,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:44:48,855 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 116 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:44:48,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 479 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:44:48,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86742 states. [2021-12-06 17:44:54,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86742 to 86265. [2021-12-06 17:44:54,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86265 states, 76422 states have (on average 1.1987124126560416) internal successors, (91608), 77189 states have internal predecessors, (91608), 5239 states have call successors, (5239), 3213 states have call predecessors, (5239), 4603 states have return successors, (8972), 5862 states have call predecessors, (8972), 5236 states have call successors, (8972) [2021-12-06 17:44:54,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86265 states to 86265 states and 105819 transitions. [2021-12-06 17:44:54,340 INFO L78 Accepts]: Start accepts. Automaton has 86265 states and 105819 transitions. Word has length 206 [2021-12-06 17:44:54,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:54,341 INFO L470 AbstractCegarLoop]: Abstraction has 86265 states and 105819 transitions. [2021-12-06 17:44:54,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-06 17:44:54,341 INFO L276 IsEmpty]: Start isEmpty. Operand 86265 states and 105819 transitions. [2021-12-06 17:44:54,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-12-06 17:44:54,352 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:54,353 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:44:54,372 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-06 17:44:54,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-12-06 17:44:54,554 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:44:54,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:54,556 INFO L85 PathProgramCache]: Analyzing trace with hash 606944206, now seen corresponding path program 1 times [2021-12-06 17:44:54,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:44:54,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407388478] [2021-12-06 17:44:54,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:54,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:44:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:54,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:44:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:54,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:44:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:54,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:44:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:54,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:44:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:54,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:44:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:54,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 17:44:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:54,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 17:44:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:54,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-06 17:44:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:54,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-06 17:44:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:54,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-06 17:44:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:54,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-06 17:44:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:54,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-06 17:44:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:54,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-06 17:44:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:54,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 17:44:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:54,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-06 17:44:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:54,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-06 17:44:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-12-06 17:44:54,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:44:54,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407388478] [2021-12-06 17:44:54,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407388478] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:44:54,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839516512] [2021-12-06 17:44:54,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:54,676 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:44:54,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:44:54,677 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:44:54,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-06 17:44:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:54,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-06 17:44:54,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:54,942 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-06 17:44:54,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:44:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-12-06 17:44:55,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839516512] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:44:55,120 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:44:55,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2021-12-06 17:44:55,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860977566] [2021-12-06 17:44:55,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:44:55,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 17:44:55,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:44:55,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 17:44:55,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:44:55,122 INFO L87 Difference]: Start difference. First operand 86265 states and 105819 transitions. Second operand has 10 states, 10 states have (on average 22.9) internal successors, (229), 7 states have internal predecessors, (229), 4 states have call successors, (41), 7 states have call predecessors, (41), 3 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2021-12-06 17:45:03,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:45:03,519 INFO L93 Difference]: Finished difference Result 218947 states and 270594 transitions. [2021-12-06 17:45:03,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-06 17:45:03,519 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 22.9) internal successors, (229), 7 states have internal predecessors, (229), 4 states have call successors, (41), 7 states have call predecessors, (41), 3 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) Word has length 207 [2021-12-06 17:45:03,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:45:03,801 INFO L225 Difference]: With dead ends: 218947 [2021-12-06 17:45:03,802 INFO L226 Difference]: Without dead ends: 140569 [2021-12-06 17:45:03,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2021-12-06 17:45:03,892 INFO L933 BasicCegarLoop]: 566 mSDtfsCounter, 949 mSDsluCounter, 2269 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 2835 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 17:45:03,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [973 Valid, 2835 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 17:45:03,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140569 states. [2021-12-06 17:45:09,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140569 to 84942. [2021-12-06 17:45:09,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84942 states, 75259 states have (on average 1.196189160100453) internal successors, (90024), 75968 states have internal predecessors, (90024), 5156 states have call successors, (5156), 3159 states have call predecessors, (5156), 4526 states have return successors, (8838), 5814 states have call predecessors, (8838), 5153 states have call successors, (8838) [2021-12-06 17:45:09,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84942 states to 84942 states and 104018 transitions. [2021-12-06 17:45:09,664 INFO L78 Accepts]: Start accepts. Automaton has 84942 states and 104018 transitions. Word has length 207 [2021-12-06 17:45:09,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:45:09,665 INFO L470 AbstractCegarLoop]: Abstraction has 84942 states and 104018 transitions. [2021-12-06 17:45:09,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.9) internal successors, (229), 7 states have internal predecessors, (229), 4 states have call successors, (41), 7 states have call predecessors, (41), 3 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2021-12-06 17:45:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 84942 states and 104018 transitions. [2021-12-06 17:45:09,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-12-06 17:45:09,675 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:45:09,676 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:45:09,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-06 17:45:09,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:45:09,877 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:45:09,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:45:09,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1856947114, now seen corresponding path program 1 times [2021-12-06 17:45:09,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:45:09,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992474259] [2021-12-06 17:45:09,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:45:09,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:45:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:09,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:45:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:09,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:45:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:09,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:45:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:09,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:45:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:09,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:45:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:09,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-06 17:45:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:09,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 17:45:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:09,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 17:45:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:09,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 17:45:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:09,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-06 17:45:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:09,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-06 17:45:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:09,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-06 17:45:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:09,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-06 17:45:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:09,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-06 17:45:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:09,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-06 17:45:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:09,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2021-12-06 17:45:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:09,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 17:45:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-12-06 17:45:09,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:45:09,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992474259] [2021-12-06 17:45:09,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992474259] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:45:09,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:45:09,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:45:09,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625767019] [2021-12-06 17:45:09,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:45:09,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:45:09,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:45:09,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:45:09,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:45:09,944 INFO L87 Difference]: Start difference. First operand 84942 states and 104018 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 4 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-12-06 17:45:15,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:45:15,600 INFO L93 Difference]: Finished difference Result 146457 states and 179228 transitions. [2021-12-06 17:45:15,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 17:45:15,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 4 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 213 [2021-12-06 17:45:15,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:45:15,785 INFO L225 Difference]: With dead ends: 146457 [2021-12-06 17:45:15,785 INFO L226 Difference]: Without dead ends: 89972 [2021-12-06 17:45:15,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-12-06 17:45:15,999 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 640 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:45:15,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [663 Valid, 1071 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:45:16,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89972 states. [2021-12-06 17:45:21,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89972 to 83000. [2021-12-06 17:45:21,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83000 states, 73587 states have (on average 1.1952790574422112) internal successors, (87957), 74289 states have internal predecessors, (87957), 5004 states have call successors, (5004), 3059 states have call predecessors, (5004), 4408 states have return successors, (8643), 5651 states have call predecessors, (8643), 5001 states have call successors, (8643) [2021-12-06 17:45:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83000 states to 83000 states and 101604 transitions. [2021-12-06 17:45:21,212 INFO L78 Accepts]: Start accepts. Automaton has 83000 states and 101604 transitions. Word has length 213 [2021-12-06 17:45:21,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:45:21,213 INFO L470 AbstractCegarLoop]: Abstraction has 83000 states and 101604 transitions. [2021-12-06 17:45:21,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 4 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-12-06 17:45:21,213 INFO L276 IsEmpty]: Start isEmpty. Operand 83000 states and 101604 transitions. [2021-12-06 17:45:21,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2021-12-06 17:45:21,223 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:45:21,223 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:45:21,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-06 17:45:21,223 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:45:21,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:45:21,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1665637853, now seen corresponding path program 1 times [2021-12-06 17:45:21,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:45:21,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629262779] [2021-12-06 17:45:21,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:45:21,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:45:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:21,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:45:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:21,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:45:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:21,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 17:45:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:21,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 17:45:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:21,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 17:45:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:21,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-06 17:45:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:21,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 17:45:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:21,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-06 17:45:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:21,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-06 17:45:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:21,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-06 17:45:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:21,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-06 17:45:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:21,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-06 17:45:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:21,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-06 17:45:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:21,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 17:45:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:21,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-06 17:45:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:21,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-12-06 17:45:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:21,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2021-12-06 17:45:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2021-12-06 17:45:21,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:45:21,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629262779] [2021-12-06 17:45:21,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629262779] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:45:21,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:45:21,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:45:21,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954984216] [2021-12-06 17:45:21,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:45:21,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:45:21,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:45:21,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:45:21,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:45:21,275 INFO L87 Difference]: Start difference. First operand 83000 states and 101604 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-12-06 17:45:27,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:45:27,237 INFO L93 Difference]: Finished difference Result 175772 states and 215293 transitions. [2021-12-06 17:45:27,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 17:45:27,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 217 [2021-12-06 17:45:27,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:45:27,418 INFO L225 Difference]: With dead ends: 175772 [2021-12-06 17:45:27,418 INFO L226 Difference]: Without dead ends: 94405 [2021-12-06 17:45:27,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:45:27,505 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 389 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:45:27,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 502 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:45:27,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94405 states. [2021-12-06 17:45:32,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94405 to 85538. [2021-12-06 17:45:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85538 states, 75643 states have (on average 1.18904591303888) internal successors, (89943), 76428 states have internal predecessors, (89943), 5241 states have call successors, (5241), 3202 states have call predecessors, (5241), 4653 states have return successors, (9144), 5907 states have call predecessors, (9144), 5238 states have call successors, (9144) [2021-12-06 17:45:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85538 states to 85538 states and 104328 transitions. [2021-12-06 17:45:33,139 INFO L78 Accepts]: Start accepts. Automaton has 85538 states and 104328 transitions. Word has length 217 [2021-12-06 17:45:33,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:45:33,140 INFO L470 AbstractCegarLoop]: Abstraction has 85538 states and 104328 transitions. [2021-12-06 17:45:33,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-12-06 17:45:33,140 INFO L276 IsEmpty]: Start isEmpty. Operand 85538 states and 104328 transitions. [2021-12-06 17:45:33,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2021-12-06 17:45:33,150 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:45:33,151 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:45:33,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-06 17:45:33,151 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:45:33,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:45:33,151 INFO L85 PathProgramCache]: Analyzing trace with hash 986971407, now seen corresponding path program 1 times [2021-12-06 17:45:33,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:45:33,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269822155] [2021-12-06 17:45:33,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:45:33,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:45:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:45:33,165 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:45:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:45:33,226 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:45:33,226 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 17:45:33,227 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 17:45:33,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-06 17:45:33,230 INFO L732 BasicCegarLoop]: Path program 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] [2021-12-06 17:45:33,233 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 17:45:33,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:45:33 BoogieIcfgContainer [2021-12-06 17:45:33,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 17:45:33,353 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 17:45:33,353 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 17:45:33,353 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 17:45:33,353 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:40:47" (3/4) ... [2021-12-06 17:45:33,355 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 17:45:33,451 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 17:45:33,451 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 17:45:33,452 INFO L158 Benchmark]: Toolchain (without parser) took 286786.65ms. Allocated memory was 115.3MB in the beginning and 9.1GB in the end (delta: 8.9GB). Free memory was 78.8MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. [2021-12-06 17:45:33,452 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 115.3MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:45:33,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.70ms. Allocated memory is still 115.3MB. Free memory was 78.6MB in the beginning and 88.0MB in the end (delta: -9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 17:45:33,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.48ms. Allocated memory is still 115.3MB. Free memory was 88.0MB in the beginning and 85.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:45:33,452 INFO L158 Benchmark]: Boogie Preprocessor took 29.62ms. Allocated memory is still 115.3MB. Free memory was 85.9MB in the beginning and 84.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:45:33,452 INFO L158 Benchmark]: RCFGBuilder took 371.27ms. Allocated memory is still 115.3MB. Free memory was 84.3MB in the beginning and 66.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-06 17:45:33,453 INFO L158 Benchmark]: TraceAbstraction took 285983.60ms. Allocated memory was 115.3MB in the beginning and 9.1GB in the end (delta: 8.9GB). Free memory was 66.0MB in the beginning and 5.6GB in the end (delta: -5.6GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. [2021-12-06 17:45:33,453 INFO L158 Benchmark]: Witness Printer took 98.37ms. Allocated memory is still 9.1GB. Free memory was 5.6GB in the beginning and 5.6GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-12-06 17:45:33,454 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.15ms. Allocated memory is still 115.3MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.70ms. Allocated memory is still 115.3MB. Free memory was 78.6MB in the beginning and 88.0MB in the end (delta: -9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.48ms. Allocated memory is still 115.3MB. Free memory was 88.0MB in the beginning and 85.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.62ms. Allocated memory is still 115.3MB. Free memory was 85.9MB in the beginning and 84.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 371.27ms. Allocated memory is still 115.3MB. Free memory was 84.3MB in the beginning and 66.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 285983.60ms. Allocated memory was 115.3MB in the beginning and 9.1GB in the end (delta: 8.9GB). Free memory was 66.0MB in the beginning and 5.6GB in the end (delta: -5.6GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. * Witness Printer took 98.37ms. Allocated memory is still 9.1GB. Free memory was 5.6GB in the beginning and 5.6GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int max_loop ; [L26] int num ; [L27] int i ; [L28] int e ; [L29] int timer ; [L30] char data_0 ; [L31] char data_1 ; [L74] int P_1_pc; [L75] int P_1_st ; [L76] int P_1_i ; [L77] int P_1_ev ; [L132] int P_2_pc ; [L133] int P_2_st ; [L134] int P_2_i ; [L135] int P_2_ev ; [L200] int C_1_pc ; [L201] int C_1_st ; [L202] int C_1_i ; [L203] int C_1_ev ; [L204] int C_1_pr ; VAL [C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=0, num=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=0, P_2_pc=0, P_2_st=0, timer=0] [L603] int count ; [L604] int __retres2 ; [L608] num = 0 [L609] i = 0 [L610] max_loop = 2 [L612] timer = 0 [L613] P_1_pc = 0 [L614] P_2_pc = 0 [L615] C_1_pc = 0 [L617] count = 0 [L618] CALL init_model() [L595] P_1_i = 1 [L596] P_2_i = 1 [L597] C_1_i = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L618] RET init_model() [L619] CALL start_simulation() [L533] int kernel_st ; [L534] int tmp ; [L535] int tmp___0 ; [L539] kernel_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L540] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L541] CALL init_threads() [L304] COND TRUE (int )P_1_i == 1 [L305] P_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L309] COND TRUE (int )P_2_i == 1 [L310] P_2_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L314] COND TRUE (int )C_1_i == 1 [L315] C_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L541] RET init_threads() [L542] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L543] CALL activate_threads() VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L469] int tmp ; [L470] int tmp___0 ; [L471] int tmp___1 ; [L475] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L117] COND FALSE !((int )P_1_pc == 1) VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L127] __retres1 = 0 VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L129] return (__retres1); VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L475] RET, EXPR is_P_1_triggered() [L475] tmp = is_P_1_triggered() [L477] COND FALSE !(\read(tmp)) VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=0] [L483] CALL, EXPR is_P_2_triggered() [L182] int __retres1 ; VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L185] COND FALSE !((int )P_2_pc == 1) VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L195] __retres1 = 0 VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L197] return (__retres1); VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L483] RET, EXPR is_P_2_triggered() [L483] tmp___0 = is_P_2_triggered() [L485] COND FALSE !(\read(tmp___0)) VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=0, tmp___0=0] [L491] CALL, EXPR is_C_1_triggered() [L264] int __retres1 ; VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L267] COND FALSE !((int )C_1_pc == 1) VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L277] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L287] __retres1 = 0 VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L289] return (__retres1); VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L491] RET, EXPR is_C_1_triggered() [L491] tmp___1 = is_C_1_triggered() [L493] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=0, tmp___0=0, tmp___1=0] [L543] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L544] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L547] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L550] kernel_st = 1 [L551] CALL eval() [L349] int tmp ; [L350] int tmp___0 ; [L351] int tmp___1 ; [L352] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L356] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L359] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L324] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L327] COND TRUE (int )P_1_st == 0 [L328] __retres1 = 1 VAL [__retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L345] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L359] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, exists_runnable_thread()=1, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L359] tmp___2 = exists_runnable_thread() [L361] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp___2=1] [L366] COND TRUE (int )P_1_st == 0 [L368] tmp = __VERIFIER_nondet_int() [L370] COND TRUE \read(tmp) [L372] P_1_st = 1 [L373] CALL P_1() [L82] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L93] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L96] CALL write_data(num, 'A') VAL [\old(c)=65, \old(data_0)=0, \old(data_1)=0, \old(i___0)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L59] COND TRUE i___0 == 0 [L60] data_0 = c VAL [\old(c)=65, \old(data_0)=0, \old(data_1)=0, \old(i___0)=0, c=65, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, i___0=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L96] RET write_data(num, 'A') VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L373] RET P_1() [L381] COND TRUE (int )P_2_st == 0 [L383] tmp___0 = __VERIFIER_nondet_int() [L385] COND TRUE \read(tmp___0) [L387] P_2_st = 1 [L388] CALL P_2() [L140] COND TRUE (int )P_2_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L151] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L154] CALL write_data(num, 'B') VAL [\old(c)=66, \old(data_0)=65, \old(data_1)=0, \old(i___0)=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L59] COND FALSE !(i___0 == 0) VAL [\old(c)=66, \old(data_0)=65, \old(data_1)=0, \old(i___0)=1, c=66, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L62] COND TRUE i___0 == 1 [L63] data_1 = c VAL [\old(c)=66, \old(data_0)=65, \old(data_1)=0, \old(i___0)=1, c=66, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L154] RET write_data(num, 'B') VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L155] num += 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L157] COND FALSE !(\read(timer)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L167] P_2_pc = 1 [L168] P_2_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L388] RET P_2() [L396] COND TRUE (int )C_1_st == 0 [L398] tmp___1 = __VERIFIER_nondet_int() [L400] COND TRUE \read(tmp___1) [L402] C_1_st = 1 [L403] CALL C_1() [L206] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L209] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L224] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L226] COND FALSE !(num == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L237] num -= 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L238] COND FALSE !(! (num >= 0)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L246] CALL, EXPR read_data(num) [L33] char c ; [L34] char __retres3 ; VAL [\old(i___0)=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L37] COND FALSE !(i___0 == 0) VAL [\old(i___0)=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L41] COND TRUE i___0 == 1 [L42] __retres3 = data_1 VAL [\old(i___0)=1, __retres3=66, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L52] return (__retres3); VAL [\old(i___0)=1, \result=66, __retres3=66, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L246] RET, EXPR read_data(num) [L246] c = read_data(num) [L247] i += 1 [L248] C_1_pc = 2 [L249] C_1_st = 2 VAL [c=66, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L403] RET C_1() [L356] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=-1, tmp___0=-2, tmp___1=1, tmp___2=1] [L359] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L324] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L327] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L331] COND FALSE !((int )P_2_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L335] COND FALSE !((int )C_1_st == 0) [L343] __retres1 = 0 VAL [__retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L345] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L359] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, exists_runnable_thread()=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=-1, tmp___0=-2, tmp___1=1, tmp___2=1] [L359] tmp___2 = exists_runnable_thread() [L361] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=-1, tmp___0=-2, tmp___1=1, tmp___2=0] [L551] RET eval() [L554] kernel_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=2, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L555] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=2, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L558] kernel_st = 3 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L559] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L560] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L469] int tmp ; [L470] int tmp___0 ; [L471] int tmp___1 ; [L475] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L118] COND FALSE !((int )P_1_ev == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L127] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L475] RET, EXPR is_P_1_triggered() [L475] tmp = is_P_1_triggered() [L477] COND FALSE !(\read(tmp)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0] [L483] CALL, EXPR is_P_2_triggered() [L182] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L185] COND TRUE (int )P_2_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L186] COND FALSE !((int )P_2_ev == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L195] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L197] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L483] RET, EXPR is_P_2_triggered() [L483] tmp___0 = is_P_2_triggered() [L485] COND FALSE !(\read(tmp___0)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0, tmp___0=0] [L491] CALL, EXPR is_C_1_triggered() [L264] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L267] COND FALSE !((int )C_1_pc == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L277] COND TRUE (int )C_1_pc == 2 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L278] COND FALSE !((int )C_1_ev == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L287] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L289] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L491] RET, EXPR is_C_1_triggered() [L491] tmp___1 = is_C_1_triggered() [L493] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0, tmp___0=0, tmp___1=0] [L560] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L561] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L564] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L324] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L327] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L331] COND FALSE !((int )P_2_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L335] COND FALSE !((int )C_1_st == 0) [L343] __retres1 = 0 VAL [__retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L345] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L564] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, exists_runnable_thread()=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L564] tmp = exists_runnable_thread() [L566] COND TRUE tmp == 0 [L568] kernel_st = 4 [L569] CALL fire_time_events() [L438] C_1_ev = 1 [L439] P_1_ev = 1 [L440] P_2_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L569] RET fire_time_events() [L570] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L469] int tmp ; [L470] int tmp___0 ; [L471] int tmp___1 ; [L475] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L475] RET, EXPR is_P_1_triggered() [L475] tmp = is_P_1_triggered() [L477] COND TRUE \read(tmp) [L478] P_1_st = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1] [L483] CALL, EXPR is_P_2_triggered() [L182] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L185] COND TRUE (int )P_2_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L186] COND TRUE (int )P_2_ev == 1 [L187] __retres1 = 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L197] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L483] RET, EXPR is_P_2_triggered() [L483] tmp___0 = is_P_2_triggered() [L485] COND TRUE \read(tmp___0) [L486] P_2_st = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1, tmp___0=1] [L491] CALL, EXPR is_C_1_triggered() [L264] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L267] COND FALSE !((int )C_1_pc == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L277] COND TRUE (int )C_1_pc == 2 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L278] COND TRUE (int )C_1_ev == 1 [L279] __retres1 = 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L289] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L491] RET, EXPR is_C_1_triggered() [L491] tmp___1 = is_C_1_triggered() [L493] COND TRUE \read(tmp___1) [L494] C_1_st = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1, tmp___0=1, tmp___1=1] [L570] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=0] [L571] CALL reset_time_events() [L449] COND TRUE (int )P_1_ev == 1 [L450] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L454] COND TRUE (int )P_2_ev == 1 [L455] P_2_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L459] COND TRUE (int )C_1_ev == 1 [L460] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L571] RET reset_time_events() [L577] CALL, EXPR stop_simulation() [L514] int tmp ; [L515] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L519] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L324] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L327] COND TRUE (int )P_1_st == 0 [L328] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L345] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L519] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L519] tmp = exists_runnable_thread() [L521] COND TRUE \read(tmp) [L522] __retres2 = 0 VAL [__retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1] [L529] return (__retres2); VAL [\result=0, __retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1] [L577] RET, EXPR stop_simulation() [L577] tmp___0 = stop_simulation() [L579] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=0, tmp___0=0] [L547] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=0, tmp___0=0] [L550] kernel_st = 1 [L551] CALL eval() [L349] int tmp ; [L350] int tmp___0 ; [L351] int tmp___1 ; [L352] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L356] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L359] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L324] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L327] COND TRUE (int )P_1_st == 0 [L328] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L345] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L359] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L359] tmp___2 = exists_runnable_thread() [L361] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp___2=1] [L366] COND TRUE (int )P_1_st == 0 [L368] tmp = __VERIFIER_nondet_int() [L370] COND TRUE \read(tmp) [L372] P_1_st = 1 [L373] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L93] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L96] CALL write_data(num, 'A') VAL [\old(c)=65, \old(data_0)=65, \old(data_1)=66, \old(i___0)=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L59] COND FALSE !(i___0 == 0) VAL [\old(c)=65, \old(data_0)=65, \old(data_1)=66, \old(i___0)=1, c=65, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, i___0=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L62] COND TRUE i___0 == 1 [L63] data_1 = c VAL [\old(c)=65, \old(data_0)=65, \old(data_1)=66, \old(i___0)=1, c=65, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, i___0=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L96] RET write_data(num, 'A') VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L373] RET P_1() [L381] COND TRUE (int )P_2_st == 0 [L383] tmp___0 = __VERIFIER_nondet_int() [L385] COND TRUE \read(tmp___0) [L387] P_2_st = 1 [L388] CALL P_2() [L140] COND FALSE !((int )P_2_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L143] COND TRUE (int )P_2_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L151] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L154] CALL write_data(num, 'B') VAL [\old(c)=66, \old(data_0)=65, \old(data_1)=65, \old(i___0)=2, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L59] COND FALSE !(i___0 == 0) VAL [\old(c)=66, \old(data_0)=65, \old(data_1)=65, \old(i___0)=2, c=66, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L62] COND FALSE !(i___0 == 1) VAL [\old(c)=66, \old(data_0)=65, \old(data_1)=65, \old(i___0)=2, c=66, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L66] CALL error() VAL [\old(data_0)=65, \old(data_1)=65, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L19] reach_error() VAL [\old(data_0)=65, \old(data_1)=65, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 134 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 285.8s, OverallIterations: 36, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 143.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13701 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13372 mSDsluCounter, 28159 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18401 mSDsCounter, 1941 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9278 IncrementalHoareTripleChecker+Invalid, 11219 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1941 mSolverCounterUnsat, 9758 mSDtfsCounter, 9278 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3678 GetRequests, 3322 SyntacticMatches, 8 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240163occurred in iteration=27, InterpolantAutomatonStates: 316, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 132.9s AutomataMinimizationTime, 35 MinimizatonAttempts, 134648 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 6601 NumberOfCodeBlocks, 6601 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 6703 ConstructedInterpolants, 0 QuantifiedInterpolants, 12438 SizeOfPredicates, 8 NumberOfNonLiveVariables, 6639 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 52 InterpolantComputations, 34 PerfectInterpolantSequences, 3450/3659 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-06 17:45:33,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aa79b0e-160f-48d5-8b0f-6a428f196882/bin/uautomizer-DrprNOufMa/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