./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL --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 d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 04:23:35,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 04:23:35,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 04:23:35,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 04:23:35,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 04:23:35,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 04:23:35,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 04:23:35,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 04:23:35,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 04:23:35,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 04:23:35,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 04:23:35,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 04:23:35,898 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 04:23:35,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 04:23:35,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 04:23:35,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 04:23:35,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 04:23:35,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 04:23:35,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 04:23:35,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 04:23:35,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 04:23:35,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 04:23:35,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 04:23:35,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 04:23:35,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 04:23:35,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 04:23:35,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 04:23:35,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 04:23:35,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 04:23:35,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 04:23:35,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 04:23:35,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 04:23:35,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 04:23:35,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 04:23:35,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 04:23:35,934 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 04:23:35,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 04:23:35,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 04:23:35,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 04:23:35,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 04:23:35,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 04:23:35,940 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-19 04:23:35,966 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 04:23:35,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 04:23:35,967 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-19 04:23:35,967 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-19 04:23:35,968 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 04:23:35,968 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 04:23:35,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-19 04:23:35,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-19 04:23:35,970 INFO L138 SettingsManager]: * Use SBE=true [2021-11-19 04:23:35,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 04:23:35,970 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 04:23:35,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 04:23:35,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 04:23:35,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 04:23:35,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 04:23:35,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 04:23:35,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 04:23:35,972 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 04:23:35,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 04:23:35,973 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 04:23:35,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 04:23:35,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 04:23:35,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-19 04:23:35,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 04:23:35,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 04:23:35,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 04:23:35,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 04:23:35,975 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 04:23:35,976 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-19 04:23:35,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 04:23:35,976 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-19 04:23:35,977 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-19 04:23:35,977 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 04:23:35,977 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 04:23:35,978 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_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/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_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL 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 -> d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 [2021-11-19 04:23:36,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 04:23:36,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 04:23:36,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 04:23:36,315 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 04:23:36,316 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 04:23:36,318 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2021-11-19 04:23:36,403 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/data/ff31509ff/0678f3f5c5274e65af573b8a90e46c20/FLAG0fe50699b [2021-11-19 04:23:36,952 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 04:23:36,953 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2021-11-19 04:23:36,962 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/data/ff31509ff/0678f3f5c5274e65af573b8a90e46c20/FLAG0fe50699b [2021-11-19 04:23:37,266 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/data/ff31509ff/0678f3f5c5274e65af573b8a90e46c20 [2021-11-19 04:23:37,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 04:23:37,270 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 04:23:37,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 04:23:37,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 04:23:37,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 04:23:37,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:23:37" (1/1) ... [2021-11-19 04:23:37,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b4f9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:23:37, skipping insertion in model container [2021-11-19 04:23:37,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:23:37" (1/1) ... [2021-11-19 04:23:37,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 04:23:37,324 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 04:23:37,602 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_a0976450-6740-4db7-87e2-3d4637e4f7bb/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2021-11-19 04:23:37,605 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 04:23:37,619 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 04:23:37,719 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_a0976450-6740-4db7-87e2-3d4637e4f7bb/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2021-11-19 04:23:37,720 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 04:23:37,747 INFO L208 MainTranslator]: Completed translation [2021-11-19 04:23:37,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:23:37 WrapperNode [2021-11-19 04:23:37,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 04:23:37,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 04:23:37,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 04:23:37,749 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 04:23:37,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:23:37" (1/1) ... [2021-11-19 04:23:37,772 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:23:37" (1/1) ... [2021-11-19 04:23:37,825 INFO L137 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 413 [2021-11-19 04:23:37,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 04:23:37,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 04:23:37,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 04:23:37,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 04:23:37,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:23:37" (1/1) ... [2021-11-19 04:23:37,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:23:37" (1/1) ... [2021-11-19 04:23:37,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:23:37" (1/1) ... [2021-11-19 04:23:37,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:23:37" (1/1) ... [2021-11-19 04:23:37,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:23:37" (1/1) ... [2021-11-19 04:23:37,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:23:37" (1/1) ... [2021-11-19 04:23:37,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:23:37" (1/1) ... [2021-11-19 04:23:37,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 04:23:37,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 04:23:37,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 04:23:37,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 04:23:37,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:23:37" (1/1) ... [2021-11-19 04:23:37,912 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 04:23:37,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:23:37,939 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 04:23:37,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 04:23:38,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 04:23:38,002 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2021-11-19 04:23:38,002 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2021-11-19 04:23:38,002 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2021-11-19 04:23:38,002 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2021-11-19 04:23:38,003 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2021-11-19 04:23:38,004 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2021-11-19 04:23:38,004 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2021-11-19 04:23:38,005 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2021-11-19 04:23:38,005 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2021-11-19 04:23:38,005 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2021-11-19 04:23:38,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-19 04:23:38,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 04:23:38,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 04:23:38,175 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 04:23:38,177 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 04:23:38,784 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 04:23:38,798 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 04:23:38,798 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-19 04:23:38,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:23:38 BoogieIcfgContainer [2021-11-19 04:23:38,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 04:23:38,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 04:23:38,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 04:23:38,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 04:23:38,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:23:37" (1/3) ... [2021-11-19 04:23:38,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9d42d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:23:38, skipping insertion in model container [2021-11-19 04:23:38,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:23:37" (2/3) ... [2021-11-19 04:23:38,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9d42d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:23:38, skipping insertion in model container [2021-11-19 04:23:38,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:23:38" (3/3) ... [2021-11-19 04:23:38,809 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2021-11-19 04:23:38,814 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 04:23:38,815 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 04:23:38,867 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 04:23:38,874 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-11-19 04:23:38,875 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 04:23:38,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 184 states, 145 states have (on average 1.606896551724138) internal successors, (233), 149 states have internal predecessors, (233), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2021-11-19 04:23:38,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-19 04:23:38,935 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:38,941 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:23:38,942 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:38,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:38,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1605485676, now seen corresponding path program 1 times [2021-11-19 04:23:38,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:38,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406312884] [2021-11-19 04:23:38,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:38,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 04:23:39,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:39,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406312884] [2021-11-19 04:23:39,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406312884] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:39,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:23:39,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 04:23:39,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249823198] [2021-11-19 04:23:39,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:39,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:23:39,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:39,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:23:39,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:23:39,306 INFO L87 Difference]: Start difference. First operand has 184 states, 145 states have (on average 1.606896551724138) internal successors, (233), 149 states have internal predecessors, (233), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 04:23:39,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:39,516 INFO L93 Difference]: Finished difference Result 373 states and 637 transitions. [2021-11-19 04:23:39,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:23:39,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-19 04:23:39,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:39,548 INFO L225 Difference]: With dead ends: 373 [2021-11-19 04:23:39,548 INFO L226 Difference]: Without dead ends: 188 [2021-11-19 04:23:39,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-19 04:23:39,563 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 18 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:39,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 826 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 04:23:39,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-11-19 04:23:39,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2021-11-19 04:23:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 147 states have (on average 1.530612244897959) internal successors, (225), 150 states have internal predecessors, (225), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2021-11-19 04:23:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 289 transitions. [2021-11-19 04:23:39,665 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 289 transitions. Word has length 15 [2021-11-19 04:23:39,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:39,666 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 289 transitions. [2021-11-19 04:23:39,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 04:23:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2021-11-19 04:23:39,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-19 04:23:39,673 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:39,673 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:23:39,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 04:23:39,674 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:39,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:39,678 INFO L85 PathProgramCache]: Analyzing trace with hash -621436427, now seen corresponding path program 1 times [2021-11-19 04:23:39,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:39,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713257203] [2021-11-19 04:23:39,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:39,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 04:23:39,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:39,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713257203] [2021-11-19 04:23:39,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713257203] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:39,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:23:39,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 04:23:39,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986279792] [2021-11-19 04:23:39,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:39,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:23:39,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:39,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:23:39,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:23:39,785 INFO L87 Difference]: Start difference. First operand 186 states and 289 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 04:23:39,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:39,854 INFO L93 Difference]: Finished difference Result 385 states and 601 transitions. [2021-11-19 04:23:39,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:23:39,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-19 04:23:39,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:39,858 INFO L225 Difference]: With dead ends: 385 [2021-11-19 04:23:39,858 INFO L226 Difference]: Without dead ends: 202 [2021-11-19 04:23:39,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-19 04:23:39,863 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 25 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:39,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 835 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:39,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-11-19 04:23:39,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2021-11-19 04:23:39,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 158 states have (on average 1.5126582278481013) internal successors, (239), 161 states have internal predecessors, (239), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2021-11-19 04:23:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 305 transitions. [2021-11-19 04:23:39,901 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 305 transitions. Word has length 16 [2021-11-19 04:23:39,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:39,901 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 305 transitions. [2021-11-19 04:23:39,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 04:23:39,902 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 305 transitions. [2021-11-19 04:23:39,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-19 04:23:39,904 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:39,906 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] [2021-11-19 04:23:39,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-19 04:23:39,906 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:39,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:39,907 INFO L85 PathProgramCache]: Analyzing trace with hash -741910715, now seen corresponding path program 1 times [2021-11-19 04:23:39,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:39,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794340426] [2021-11-19 04:23:39,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:39,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:39,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:39,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 04:23:39,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:39,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794340426] [2021-11-19 04:23:39,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794340426] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:39,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:23:39,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 04:23:39,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855299197] [2021-11-19 04:23:39,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:39,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 04:23:39,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:39,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 04:23:39,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 04:23:39,997 INFO L87 Difference]: Start difference. First operand 199 states and 305 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 04:23:40,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:40,046 INFO L93 Difference]: Finished difference Result 417 states and 647 transitions. [2021-11-19 04:23:40,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 04:23:40,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-11-19 04:23:40,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:40,053 INFO L225 Difference]: With dead ends: 417 [2021-11-19 04:23:40,054 INFO L226 Difference]: Without dead ends: 228 [2021-11-19 04:23:40,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 04:23:40,064 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 22 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 564 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-11-19 04:23:40,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 564 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:40,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-11-19 04:23:40,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 201. [2021-11-19 04:23:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 160 states have (on average 1.50625) internal successors, (241), 163 states have internal predecessors, (241), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2021-11-19 04:23:40,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 307 transitions. [2021-11-19 04:23:40,096 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 307 transitions. Word has length 23 [2021-11-19 04:23:40,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:40,096 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 307 transitions. [2021-11-19 04:23:40,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 04:23:40,097 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 307 transitions. [2021-11-19 04:23:40,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-19 04:23:40,099 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:40,099 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] [2021-11-19 04:23:40,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-19 04:23:40,100 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:40,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:40,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1197019830, now seen corresponding path program 1 times [2021-11-19 04:23:40,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:40,101 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006249952] [2021-11-19 04:23:40,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:40,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:40,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:40,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 04:23:40,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:40,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006249952] [2021-11-19 04:23:40,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006249952] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:40,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:23:40,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 04:23:40,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787724817] [2021-11-19 04:23:40,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:40,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:23:40,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:40,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:23:40,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:23:40,170 INFO L87 Difference]: Start difference. First operand 201 states and 307 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 04:23:40,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:40,248 INFO L93 Difference]: Finished difference Result 457 states and 714 transitions. [2021-11-19 04:23:40,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:23:40,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2021-11-19 04:23:40,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:40,254 INFO L225 Difference]: With dead ends: 457 [2021-11-19 04:23:40,255 INFO L226 Difference]: Without dead ends: 307 [2021-11-19 04:23:40,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-11-19 04:23:40,268 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 132 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:40,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 870 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:40,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-11-19 04:23:40,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 201. [2021-11-19 04:23:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 160 states have (on average 1.48125) internal successors, (237), 163 states have internal predecessors, (237), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2021-11-19 04:23:40,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 303 transitions. [2021-11-19 04:23:40,299 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 303 transitions. Word has length 31 [2021-11-19 04:23:40,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:40,300 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 303 transitions. [2021-11-19 04:23:40,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 04:23:40,300 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 303 transitions. [2021-11-19 04:23:40,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-19 04:23:40,302 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:40,302 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] [2021-11-19 04:23:40,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-19 04:23:40,302 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:40,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:40,303 INFO L85 PathProgramCache]: Analyzing trace with hash -422396736, now seen corresponding path program 1 times [2021-11-19 04:23:40,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:40,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536074660] [2021-11-19 04:23:40,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:40,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:40,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:40,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 04:23:40,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:40,373 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536074660] [2021-11-19 04:23:40,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536074660] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:40,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:23:40,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 04:23:40,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915591437] [2021-11-19 04:23:40,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:40,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 04:23:40,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:40,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 04:23:40,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 04:23:40,375 INFO L87 Difference]: Start difference. First operand 201 states and 303 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 04:23:40,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:40,404 INFO L93 Difference]: Finished difference Result 392 states and 595 transitions. [2021-11-19 04:23:40,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:23:40,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-11-19 04:23:40,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:40,407 INFO L225 Difference]: With dead ends: 392 [2021-11-19 04:23:40,407 INFO L226 Difference]: Without dead ends: 203 [2021-11-19 04:23:40,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 04:23:40,409 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 0 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:40,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1104 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-11-19 04:23:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2021-11-19 04:23:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 160 states have (on average 1.475) internal successors, (236), 163 states have internal predecessors, (236), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2021-11-19 04:23:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 302 transitions. [2021-11-19 04:23:40,426 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 302 transitions. Word has length 32 [2021-11-19 04:23:40,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:40,426 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 302 transitions. [2021-11-19 04:23:40,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 04:23:40,427 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 302 transitions. [2021-11-19 04:23:40,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-19 04:23:40,428 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:40,429 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] [2021-11-19 04:23:40,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-19 04:23:40,429 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:40,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:40,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1664815819, now seen corresponding path program 1 times [2021-11-19 04:23:40,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:40,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750471911] [2021-11-19 04:23:40,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:40,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:40,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:40,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 04:23:40,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:40,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750471911] [2021-11-19 04:23:40,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750471911] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:23:40,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740729928] [2021-11-19 04:23:40,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:40,561 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:23:40,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:23:40,564 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:23:40,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-19 04:23:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:40,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-19 04:23:40,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:23:40,804 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 04:23:40,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 04:23:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 04:23:40,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740729928] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 04:23:40,904 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 04:23:40,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-11-19 04:23:40,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205217435] [2021-11-19 04:23:40,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 04:23:40,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 04:23:40,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:40,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 04:23:40,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-19 04:23:40,906 INFO L87 Difference]: Start difference. First operand 201 states and 302 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 04:23:40,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:40,956 INFO L93 Difference]: Finished difference Result 450 states and 691 transitions. [2021-11-19 04:23:40,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:23:40,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2021-11-19 04:23:40,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:40,959 INFO L225 Difference]: With dead ends: 450 [2021-11-19 04:23:40,959 INFO L226 Difference]: Without dead ends: 260 [2021-11-19 04:23:40,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-19 04:23:40,961 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 66 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:40,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 1084 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:40,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-11-19 04:23:40,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 254. [2021-11-19 04:23:40,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 203 states have (on average 1.4532019704433496) internal successors, (295), 206 states have internal predecessors, (295), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2021-11-19 04:23:40,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2021-11-19 04:23:40,981 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 35 [2021-11-19 04:23:40,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:40,982 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2021-11-19 04:23:40,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 04:23:40,982 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2021-11-19 04:23:40,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-19 04:23:40,985 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:40,985 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:23:41,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-19 04:23:41,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-19 04:23:41,209 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:41,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:41,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1225495307, now seen corresponding path program 2 times [2021-11-19 04:23:41,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:41,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604206308] [2021-11-19 04:23:41,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:41,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-19 04:23:41,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:41,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604206308] [2021-11-19 04:23:41,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604206308] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:41,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:23:41,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 04:23:41,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400642077] [2021-11-19 04:23:41,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:41,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:23:41,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:41,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:23:41,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:23:41,284 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 04:23:41,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:41,331 INFO L93 Difference]: Finished difference Result 518 states and 788 transitions. [2021-11-19 04:23:41,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:23:41,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2021-11-19 04:23:41,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:41,338 INFO L225 Difference]: With dead ends: 518 [2021-11-19 04:23:41,338 INFO L226 Difference]: Without dead ends: 293 [2021-11-19 04:23:41,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-11-19 04:23:41,339 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 24 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:41,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 827 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:41,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-11-19 04:23:41,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2021-11-19 04:23:41,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 235 states have (on average 1.4127659574468086) internal successors, (332), 238 states have internal predecessors, (332), 46 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2021-11-19 04:23:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 424 transitions. [2021-11-19 04:23:41,359 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 424 transitions. Word has length 57 [2021-11-19 04:23:41,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:41,360 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 424 transitions. [2021-11-19 04:23:41,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 04:23:41,360 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 424 transitions. [2021-11-19 04:23:41,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-19 04:23:41,366 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:41,367 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:23:41,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-19 04:23:41,367 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:41,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:41,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1867707356, now seen corresponding path program 1 times [2021-11-19 04:23:41,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:41,368 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812317696] [2021-11-19 04:23:41,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:41,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,491 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-19 04:23:41,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:41,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812317696] [2021-11-19 04:23:41,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812317696] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:41,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:23:41,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 04:23:41,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613433786] [2021-11-19 04:23:41,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:41,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:23:41,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:41,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:23:41,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:23:41,503 INFO L87 Difference]: Start difference. First operand 290 states and 424 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 04:23:41,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:41,560 INFO L93 Difference]: Finished difference Result 555 states and 835 transitions. [2021-11-19 04:23:41,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:23:41,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2021-11-19 04:23:41,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:41,564 INFO L225 Difference]: With dead ends: 555 [2021-11-19 04:23:41,564 INFO L226 Difference]: Without dead ends: 299 [2021-11-19 04:23:41,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-11-19 04:23:41,570 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 19 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:41,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 813 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:41,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-11-19 04:23:41,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2021-11-19 04:23:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 241 states have (on average 1.4107883817427387) internal successors, (340), 244 states have internal predecessors, (340), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2021-11-19 04:23:41,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 432 transitions. [2021-11-19 04:23:41,615 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 432 transitions. Word has length 57 [2021-11-19 04:23:41,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:41,617 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 432 transitions. [2021-11-19 04:23:41,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 04:23:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 432 transitions. [2021-11-19 04:23:41,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-19 04:23:41,621 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:41,622 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-19 04:23:41,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-19 04:23:41,622 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:41,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:41,623 INFO L85 PathProgramCache]: Analyzing trace with hash -917641064, now seen corresponding path program 1 times [2021-11-19 04:23:41,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:41,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479482857] [2021-11-19 04:23:41,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:41,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,764 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-19 04:23:41,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:41,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479482857] [2021-11-19 04:23:41,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479482857] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:41,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:23:41,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 04:23:41,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744507300] [2021-11-19 04:23:41,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:41,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 04:23:41,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:41,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 04:23:41,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 04:23:41,769 INFO L87 Difference]: Start difference. First operand 297 states and 432 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-19 04:23:41,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:41,809 INFO L93 Difference]: Finished difference Result 543 states and 803 transitions. [2021-11-19 04:23:41,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:23:41,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2021-11-19 04:23:41,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:41,815 INFO L225 Difference]: With dead ends: 543 [2021-11-19 04:23:41,815 INFO L226 Difference]: Without dead ends: 299 [2021-11-19 04:23:41,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 04:23:41,819 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 0 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:41,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1103 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-11-19 04:23:41,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2021-11-19 04:23:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 241 states have (on average 1.3983402489626555) internal successors, (337), 244 states have internal predecessors, (337), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2021-11-19 04:23:41,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 429 transitions. [2021-11-19 04:23:41,840 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 429 transitions. Word has length 75 [2021-11-19 04:23:41,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:41,840 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 429 transitions. [2021-11-19 04:23:41,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-19 04:23:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 429 transitions. [2021-11-19 04:23:41,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-19 04:23:41,843 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:41,844 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:23:41,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-19 04:23:41,844 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:41,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:41,845 INFO L85 PathProgramCache]: Analyzing trace with hash -276575053, now seen corresponding path program 1 times [2021-11-19 04:23:41,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:41,845 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376540220] [2021-11-19 04:23:41,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:41,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:23:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:23:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:41,977 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-11-19 04:23:41,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:41,978 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376540220] [2021-11-19 04:23:41,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376540220] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:41,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:23:41,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 04:23:41,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008009822] [2021-11-19 04:23:41,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:41,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:23:41,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:41,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:23:41,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:23:41,980 INFO L87 Difference]: Start difference. First operand 297 states and 429 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-19 04:23:42,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:42,027 INFO L93 Difference]: Finished difference Result 580 states and 859 transitions. [2021-11-19 04:23:42,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:23:42,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2021-11-19 04:23:42,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:42,031 INFO L225 Difference]: With dead ends: 580 [2021-11-19 04:23:42,031 INFO L226 Difference]: Without dead ends: 341 [2021-11-19 04:23:42,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-11-19 04:23:42,034 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 25 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:42,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 827 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:42,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-11-19 04:23:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 338. [2021-11-19 04:23:42,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 278 states have (on average 1.3633093525179856) internal successors, (379), 281 states have internal predecessors, (379), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2021-11-19 04:23:42,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 477 transitions. [2021-11-19 04:23:42,052 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 477 transitions. Word has length 104 [2021-11-19 04:23:42,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:42,053 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 477 transitions. [2021-11-19 04:23:42,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-19 04:23:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 477 transitions. [2021-11-19 04:23:42,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-19 04:23:42,055 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:42,055 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:23:42,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-19 04:23:42,055 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:42,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:42,056 INFO L85 PathProgramCache]: Analyzing trace with hash -92526865, now seen corresponding path program 1 times [2021-11-19 04:23:42,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:42,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787666405] [2021-11-19 04:23:42,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:42,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:23:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:23:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-11-19 04:23:42,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:42,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787666405] [2021-11-19 04:23:42,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787666405] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:42,151 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:23:42,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 04:23:42,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52894231] [2021-11-19 04:23:42,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:42,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:23:42,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:42,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:23:42,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:23:42,154 INFO L87 Difference]: Start difference. First operand 338 states and 477 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-19 04:23:42,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:42,201 INFO L93 Difference]: Finished difference Result 606 states and 879 transitions. [2021-11-19 04:23:42,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 04:23:42,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 105 [2021-11-19 04:23:42,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:42,205 INFO L225 Difference]: With dead ends: 606 [2021-11-19 04:23:42,206 INFO L226 Difference]: Without dead ends: 332 [2021-11-19 04:23:42,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-11-19 04:23:42,209 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 15 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:42,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 786 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:42,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-11-19 04:23:42,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2021-11-19 04:23:42,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 273 states have (on average 1.3443223443223444) internal successors, (367), 276 states have internal predecessors, (367), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2021-11-19 04:23:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 463 transitions. [2021-11-19 04:23:42,232 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 463 transitions. Word has length 105 [2021-11-19 04:23:42,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:42,232 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 463 transitions. [2021-11-19 04:23:42,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-19 04:23:42,233 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 463 transitions. [2021-11-19 04:23:42,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-19 04:23:42,234 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:42,235 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-19 04:23:42,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-19 04:23:42,235 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:42,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:42,236 INFO L85 PathProgramCache]: Analyzing trace with hash -440553643, now seen corresponding path program 1 times [2021-11-19 04:23:42,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:42,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254562754] [2021-11-19 04:23:42,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:42,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:23:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:23:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:23:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:23:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2021-11-19 04:23:42,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:42,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254562754] [2021-11-19 04:23:42,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254562754] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:42,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:23:42,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 04:23:42,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679062039] [2021-11-19 04:23:42,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:42,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 04:23:42,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:42,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 04:23:42,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 04:23:42,374 INFO L87 Difference]: Start difference. First operand 332 states and 463 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-19 04:23:42,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:42,401 INFO L93 Difference]: Finished difference Result 581 states and 828 transitions. [2021-11-19 04:23:42,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:23:42,402 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 124 [2021-11-19 04:23:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:42,405 INFO L225 Difference]: With dead ends: 581 [2021-11-19 04:23:42,405 INFO L226 Difference]: Without dead ends: 334 [2021-11-19 04:23:42,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 04:23:42,408 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:42,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1087 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-11-19 04:23:42,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2021-11-19 04:23:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 273 states have (on average 1.3333333333333333) internal successors, (364), 276 states have internal predecessors, (364), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2021-11-19 04:23:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 460 transitions. [2021-11-19 04:23:42,427 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 460 transitions. Word has length 124 [2021-11-19 04:23:42,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:42,428 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 460 transitions. [2021-11-19 04:23:42,428 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-19 04:23:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 460 transitions. [2021-11-19 04:23:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-19 04:23:42,433 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:42,434 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-19 04:23:42,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-19 04:23:42,434 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:42,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:42,435 INFO L85 PathProgramCache]: Analyzing trace with hash -37757066, now seen corresponding path program 1 times [2021-11-19 04:23:42,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:42,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241848029] [2021-11-19 04:23:42,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:42,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:23:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:23:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:23:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:23:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:23:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,578 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2021-11-19 04:23:42,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:42,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241848029] [2021-11-19 04:23:42,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241848029] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:42,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:23:42,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 04:23:42,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343654895] [2021-11-19 04:23:42,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:42,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:23:42,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:42,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:23:42,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:23:42,582 INFO L87 Difference]: Start difference. First operand 332 states and 460 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-19 04:23:42,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:42,645 INFO L93 Difference]: Finished difference Result 544 states and 788 transitions. [2021-11-19 04:23:42,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 04:23:42,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 157 [2021-11-19 04:23:42,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:42,649 INFO L225 Difference]: With dead ends: 544 [2021-11-19 04:23:42,649 INFO L226 Difference]: Without dead ends: 330 [2021-11-19 04:23:42,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-11-19 04:23:42,652 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 13 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:42,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 754 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:42,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-11-19 04:23:42,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2021-11-19 04:23:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 272 states have (on average 1.3308823529411764) internal successors, (362), 275 states have internal predecessors, (362), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2021-11-19 04:23:42,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 456 transitions. [2021-11-19 04:23:42,671 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 456 transitions. Word has length 157 [2021-11-19 04:23:42,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:42,672 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 456 transitions. [2021-11-19 04:23:42,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-19 04:23:42,673 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 456 transitions. [2021-11-19 04:23:42,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-11-19 04:23:42,675 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:42,676 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 04:23:42,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-19 04:23:42,676 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:42,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:42,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1460013805, now seen corresponding path program 1 times [2021-11-19 04:23:42,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:42,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085372527] [2021-11-19 04:23:42,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:42,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:23:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:23:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:23:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:23:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:23:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:23:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2021-11-19 04:23:42,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:42,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085372527] [2021-11-19 04:23:42,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085372527] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:42,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:23:42,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 04:23:42,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127795250] [2021-11-19 04:23:42,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:42,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:23:42,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:42,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:23:42,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:23:42,831 INFO L87 Difference]: Start difference. First operand 330 states and 456 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-19 04:23:42,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:42,885 INFO L93 Difference]: Finished difference Result 484 states and 684 transitions. [2021-11-19 04:23:42,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:23:42,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 172 [2021-11-19 04:23:42,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:42,889 INFO L225 Difference]: With dead ends: 484 [2021-11-19 04:23:42,889 INFO L226 Difference]: Without dead ends: 313 [2021-11-19 04:23:42,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-11-19 04:23:42,891 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 35 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:42,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 735 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:42,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-11-19 04:23:42,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2021-11-19 04:23:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 258 states have (on average 1.321705426356589) internal successors, (341), 261 states have internal predecessors, (341), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2021-11-19 04:23:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 429 transitions. [2021-11-19 04:23:42,908 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 429 transitions. Word has length 172 [2021-11-19 04:23:42,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:42,908 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 429 transitions. [2021-11-19 04:23:42,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-19 04:23:42,909 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 429 transitions. [2021-11-19 04:23:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-11-19 04:23:42,912 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:42,913 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 04:23:42,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-19 04:23:42,913 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:42,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:42,914 INFO L85 PathProgramCache]: Analyzing trace with hash 409048779, now seen corresponding path program 1 times [2021-11-19 04:23:42,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:42,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754114540] [2021-11-19 04:23:42,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:42,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:42,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:23:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:23:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:23:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:23:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:23:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:23:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,061 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2021-11-19 04:23:43,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:43,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754114540] [2021-11-19 04:23:43,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754114540] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:43,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:23:43,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 04:23:43,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711170687] [2021-11-19 04:23:43,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:43,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:23:43,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:43,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:23:43,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:23:43,067 INFO L87 Difference]: Start difference. First operand 313 states and 429 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-19 04:23:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:43,124 INFO L93 Difference]: Finished difference Result 467 states and 657 transitions. [2021-11-19 04:23:43,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:23:43,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 174 [2021-11-19 04:23:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:43,129 INFO L225 Difference]: With dead ends: 467 [2021-11-19 04:23:43,129 INFO L226 Difference]: Without dead ends: 294 [2021-11-19 04:23:43,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-11-19 04:23:43,133 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 30 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:43,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 739 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:43,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-11-19 04:23:43,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2021-11-19 04:23:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 242 states have (on average 1.3140495867768596) internal successors, (318), 245 states have internal predecessors, (318), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2021-11-19 04:23:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 400 transitions. [2021-11-19 04:23:43,151 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 400 transitions. Word has length 174 [2021-11-19 04:23:43,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:43,152 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 400 transitions. [2021-11-19 04:23:43,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-19 04:23:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 400 transitions. [2021-11-19 04:23:43,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-19 04:23:43,155 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:43,156 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 04:23:43,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-19 04:23:43,156 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:43,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:43,157 INFO L85 PathProgramCache]: Analyzing trace with hash 222848508, now seen corresponding path program 1 times [2021-11-19 04:23:43,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:43,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996604753] [2021-11-19 04:23:43,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:43,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:23:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:23:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:23:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:23:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:23:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:23:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:23:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,291 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2021-11-19 04:23:43,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:43,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996604753] [2021-11-19 04:23:43,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996604753] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:43,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:23:43,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 04:23:43,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659996711] [2021-11-19 04:23:43,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:43,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 04:23:43,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:43,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 04:23:43,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 04:23:43,294 INFO L87 Difference]: Start difference. First operand 294 states and 400 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-19 04:23:43,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:43,316 INFO L93 Difference]: Finished difference Result 447 states and 627 transitions. [2021-11-19 04:23:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:23:43,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 175 [2021-11-19 04:23:43,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:43,319 INFO L225 Difference]: With dead ends: 447 [2021-11-19 04:23:43,319 INFO L226 Difference]: Without dead ends: 294 [2021-11-19 04:23:43,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 04:23:43,321 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 0 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:43,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1065 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:43,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-11-19 04:23:43,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2021-11-19 04:23:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 242 states have (on average 1.2892561983471074) internal successors, (312), 245 states have internal predecessors, (312), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2021-11-19 04:23:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 394 transitions. [2021-11-19 04:23:43,337 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 394 transitions. Word has length 175 [2021-11-19 04:23:43,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:43,338 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 394 transitions. [2021-11-19 04:23:43,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-19 04:23:43,338 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 394 transitions. [2021-11-19 04:23:43,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-11-19 04:23:43,342 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:43,342 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-11-19 04:23:43,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-19 04:23:43,342 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:43,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:43,343 INFO L85 PathProgramCache]: Analyzing trace with hash 312728436, now seen corresponding path program 1 times [2021-11-19 04:23:43,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:43,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256009209] [2021-11-19 04:23:43,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:43,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:23:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:23:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:23:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:23:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:23:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:23:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,488 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-11-19 04:23:43,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:43,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256009209] [2021-11-19 04:23:43,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256009209] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:23:43,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168870161] [2021-11-19 04:23:43,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:43,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:23:43,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:23:43,493 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:23:43,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-19 04:23:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:43,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 04:23:43,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:23:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-11-19 04:23:44,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 04:23:44,447 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-11-19 04:23:44,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168870161] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-19 04:23:44,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-19 04:23:44,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2021-11-19 04:23:44,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128877923] [2021-11-19 04:23:44,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:44,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:23:44,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:44,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:23:44,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-19 04:23:44,450 INFO L87 Difference]: Start difference. First operand 294 states and 394 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-19 04:23:44,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:44,495 INFO L93 Difference]: Finished difference Result 468 states and 649 transitions. [2021-11-19 04:23:44,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 04:23:44,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 182 [2021-11-19 04:23:44,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:44,498 INFO L225 Difference]: With dead ends: 468 [2021-11-19 04:23:44,499 INFO L226 Difference]: Without dead ends: 273 [2021-11-19 04:23:44,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 388 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-11-19 04:23:44,500 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 35 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:44,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 505 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:44,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-11-19 04:23:44,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-11-19 04:23:44,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 224 states have (on average 1.28125) internal successors, (287), 227 states have internal predecessors, (287), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-11-19 04:23:44,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 363 transitions. [2021-11-19 04:23:44,516 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 363 transitions. Word has length 182 [2021-11-19 04:23:44,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:44,517 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 363 transitions. [2021-11-19 04:23:44,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-19 04:23:44,517 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 363 transitions. [2021-11-19 04:23:44,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-11-19 04:23:44,520 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:44,520 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-11-19 04:23:44,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-19 04:23:44,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-19 04:23:44,749 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:44,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:44,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1687421607, now seen corresponding path program 1 times [2021-11-19 04:23:44,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:44,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256258514] [2021-11-19 04:23:44,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:44,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:44,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:44,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:44,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:44,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:44,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:44,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:44,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:23:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:44,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:23:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:44,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:23:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:44,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:23:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:44,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:44,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:23:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:44,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:23:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:44,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:23:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:44,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:44,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:23:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:44,904 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2021-11-19 04:23:44,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:44,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256258514] [2021-11-19 04:23:44,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256258514] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:44,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:23:44,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 04:23:44,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158027357] [2021-11-19 04:23:44,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:44,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:23:44,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:44,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:23:44,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:23:44,907 INFO L87 Difference]: Start difference. First operand 273 states and 363 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-19 04:23:44,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:44,936 INFO L93 Difference]: Finished difference Result 425 states and 591 transitions. [2021-11-19 04:23:44,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:23:44,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 206 [2021-11-19 04:23:44,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:44,940 INFO L225 Difference]: With dead ends: 425 [2021-11-19 04:23:44,940 INFO L226 Difference]: Without dead ends: 279 [2021-11-19 04:23:44,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-11-19 04:23:44,942 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 6 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:44,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 779 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:44,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-11-19 04:23:44,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2021-11-19 04:23:44,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 227 states have (on average 1.277533039647577) internal successors, (290), 230 states have internal predecessors, (290), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-11-19 04:23:44,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 366 transitions. [2021-11-19 04:23:44,957 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 366 transitions. Word has length 206 [2021-11-19 04:23:44,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:44,958 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 366 transitions. [2021-11-19 04:23:44,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-19 04:23:44,958 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 366 transitions. [2021-11-19 04:23:44,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-11-19 04:23:44,961 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:44,961 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-19 04:23:44,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-19 04:23:44,962 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:44,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:44,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1286095815, now seen corresponding path program 1 times [2021-11-19 04:23:44,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:44,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499759586] [2021-11-19 04:23:44,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:44,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:45,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:45,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:45,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:45,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:45,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:45,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:45,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:23:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:45,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:23:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:45,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:23:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:45,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:23:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:45,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:45,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:23:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:45,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:23:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:45,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:23:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:45,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:45,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:23:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:45,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:23:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:45,102 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2021-11-19 04:23:45,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:45,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499759586] [2021-11-19 04:23:45,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499759586] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:23:45,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309756213] [2021-11-19 04:23:45,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:45,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:23:45,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:23:45,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:23:45,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-19 04:23:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:45,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 04:23:45,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:23:45,730 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2021-11-19 04:23:45,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-19 04:23:45,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309756213] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:45,731 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-19 04:23:45,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-11-19 04:23:45,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460462308] [2021-11-19 04:23:45,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:45,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:23:45,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:45,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:23:45,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 04:23:45,734 INFO L87 Difference]: Start difference. First operand 277 states and 366 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2021-11-19 04:23:45,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:45,765 INFO L93 Difference]: Finished difference Result 434 states and 598 transitions. [2021-11-19 04:23:45,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:23:45,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 215 [2021-11-19 04:23:45,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:45,768 INFO L225 Difference]: With dead ends: 434 [2021-11-19 04:23:45,769 INFO L226 Difference]: Without dead ends: 284 [2021-11-19 04:23:45,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-19 04:23:45,770 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 7 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:45,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 784 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:45,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-11-19 04:23:45,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2021-11-19 04:23:45,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 231 states have (on average 1.2727272727272727) internal successors, (294), 234 states have internal predecessors, (294), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-11-19 04:23:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 370 transitions. [2021-11-19 04:23:45,785 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 370 transitions. Word has length 215 [2021-11-19 04:23:45,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:45,787 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 370 transitions. [2021-11-19 04:23:45,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2021-11-19 04:23:45,788 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 370 transitions. [2021-11-19 04:23:45,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-11-19 04:23:45,791 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:45,791 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 04:23:45,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-19 04:23:46,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:23:46,017 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:46,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:46,018 INFO L85 PathProgramCache]: Analyzing trace with hash -690820591, now seen corresponding path program 1 times [2021-11-19 04:23:46,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:46,018 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144358225] [2021-11-19 04:23:46,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:46,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:46,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:46,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:46,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:46,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:46,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:46,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:46,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:23:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:46,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:23:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:46,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:23:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:46,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:23:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:46,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:46,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:23:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:46,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:23:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:46,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:23:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:46,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:46,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:23:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:46,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:23:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:46,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-19 04:23:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2021-11-19 04:23:46,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:46,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144358225] [2021-11-19 04:23:46,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144358225] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:23:46,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38972931] [2021-11-19 04:23:46,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:46,185 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:23:46,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:23:46,186 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:23:46,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-19 04:23:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:46,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 04:23:46,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:23:46,742 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2021-11-19 04:23:46,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-19 04:23:46,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38972931] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:46,743 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-19 04:23:46,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-11-19 04:23:46,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774908061] [2021-11-19 04:23:46,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:46,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:23:46,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:46,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:23:46,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 04:23:46,749 INFO L87 Difference]: Start difference. First operand 282 states and 370 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-19 04:23:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:46,783 INFO L93 Difference]: Finished difference Result 436 states and 596 transitions. [2021-11-19 04:23:46,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 04:23:46,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 225 [2021-11-19 04:23:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:46,787 INFO L225 Difference]: With dead ends: 436 [2021-11-19 04:23:46,787 INFO L226 Difference]: Without dead ends: 281 [2021-11-19 04:23:46,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-19 04:23:46,789 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 7 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:46,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 770 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:46,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-11-19 04:23:46,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2021-11-19 04:23:46,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 231 states have (on average 1.2597402597402598) internal successors, (291), 233 states have internal predecessors, (291), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2021-11-19 04:23:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 365 transitions. [2021-11-19 04:23:46,809 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 365 transitions. Word has length 225 [2021-11-19 04:23:46,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:46,810 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 365 transitions. [2021-11-19 04:23:46,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-19 04:23:46,810 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 365 transitions. [2021-11-19 04:23:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-11-19 04:23:46,814 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:46,814 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-19 04:23:46,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-19 04:23:47,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:23:47,037 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:47,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:47,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1815976528, now seen corresponding path program 1 times [2021-11-19 04:23:47,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:47,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328462312] [2021-11-19 04:23:47,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:47,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:23:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:23:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:23:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:23:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:23:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:23:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:23:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:23:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:23:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-19 04:23:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-19 04:23:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,187 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2021-11-19 04:23:47,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:47,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328462312] [2021-11-19 04:23:47,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328462312] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:47,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:23:47,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 04:23:47,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322276858] [2021-11-19 04:23:47,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:47,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:23:47,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:47,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:23:47,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:23:47,192 INFO L87 Difference]: Start difference. First operand 281 states and 365 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-19 04:23:47,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:47,418 INFO L93 Difference]: Finished difference Result 478 states and 656 transitions. [2021-11-19 04:23:47,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 04:23:47,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 234 [2021-11-19 04:23:47,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:47,422 INFO L225 Difference]: With dead ends: 478 [2021-11-19 04:23:47,422 INFO L226 Difference]: Without dead ends: 324 [2021-11-19 04:23:47,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:23:47,424 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 185 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:47,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 643 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-19 04:23:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-11-19 04:23:47,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 280. [2021-11-19 04:23:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 231 states have (on average 1.2554112554112553) internal successors, (290), 232 states have internal predecessors, (290), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2021-11-19 04:23:47,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 362 transitions. [2021-11-19 04:23:47,444 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 362 transitions. Word has length 234 [2021-11-19 04:23:47,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:47,445 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 362 transitions. [2021-11-19 04:23:47,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-19 04:23:47,446 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 362 transitions. [2021-11-19 04:23:47,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-11-19 04:23:47,451 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:47,451 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-19 04:23:47,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-19 04:23:47,452 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:47,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:47,452 INFO L85 PathProgramCache]: Analyzing trace with hash 869606888, now seen corresponding path program 1 times [2021-11-19 04:23:47,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:47,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039745596] [2021-11-19 04:23:47,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:47,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:23:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:23:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:23:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:23:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:23:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:23:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:23:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:23:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:23:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-19 04:23:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-19 04:23:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2021-11-19 04:23:47,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:47,682 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039745596] [2021-11-19 04:23:47,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039745596] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:47,683 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:23:47,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 04:23:47,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915284626] [2021-11-19 04:23:47,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:47,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 04:23:47,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:47,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 04:23:47,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 04:23:47,685 INFO L87 Difference]: Start difference. First operand 280 states and 362 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-19 04:23:48,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:48,154 INFO L93 Difference]: Finished difference Result 657 states and 878 transitions. [2021-11-19 04:23:48,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-19 04:23:48,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 237 [2021-11-19 04:23:48,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:48,161 INFO L225 Difference]: With dead ends: 657 [2021-11-19 04:23:48,161 INFO L226 Difference]: Without dead ends: 504 [2021-11-19 04:23:48,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-19 04:23:48,164 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 419 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:48,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [440 Valid, 851 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-19 04:23:48,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2021-11-19 04:23:48,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 441. [2021-11-19 04:23:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 362 states have (on average 1.3011049723756907) internal successors, (471), 364 states have internal predecessors, (471), 54 states have call successors, (54), 24 states have call predecessors, (54), 24 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2021-11-19 04:23:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 579 transitions. [2021-11-19 04:23:48,196 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 579 transitions. Word has length 237 [2021-11-19 04:23:48,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:48,196 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 579 transitions. [2021-11-19 04:23:48,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-19 04:23:48,197 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 579 transitions. [2021-11-19 04:23:48,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2021-11-19 04:23:48,201 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:48,202 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-19 04:23:48,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-19 04:23:48,202 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:48,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1758726155, now seen corresponding path program 1 times [2021-11-19 04:23:48,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:48,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800583245] [2021-11-19 04:23:48,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:48,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:23:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:23:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:23:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:23:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:23:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:23:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:23:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:23:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:23:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-19 04:23:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-19 04:23:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2021-11-19 04:23:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-11-19 04:23:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-11-19 04:23:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,399 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2021-11-19 04:23:48,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:48,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800583245] [2021-11-19 04:23:48,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800583245] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:48,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:23:48,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 04:23:48,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275113908] [2021-11-19 04:23:48,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:48,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:23:48,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:48,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:23:48,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:23:48,402 INFO L87 Difference]: Start difference. First operand 441 states and 579 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-11-19 04:23:48,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:48,791 INFO L93 Difference]: Finished difference Result 932 states and 1277 transitions. [2021-11-19 04:23:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:23:48,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 264 [2021-11-19 04:23:48,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:48,798 INFO L225 Difference]: With dead ends: 932 [2021-11-19 04:23:48,798 INFO L226 Difference]: Without dead ends: 695 [2021-11-19 04:23:48,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-11-19 04:23:48,804 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 217 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:48,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 617 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-19 04:23:48,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2021-11-19 04:23:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 533. [2021-11-19 04:23:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 444 states have (on average 1.3108108108108107) internal successors, (582), 447 states have internal predecessors, (582), 59 states have call successors, (59), 29 states have call predecessors, (59), 29 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2021-11-19 04:23:48,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 700 transitions. [2021-11-19 04:23:48,856 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 700 transitions. Word has length 264 [2021-11-19 04:23:48,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:48,857 INFO L470 AbstractCegarLoop]: Abstraction has 533 states and 700 transitions. [2021-11-19 04:23:48,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-11-19 04:23:48,858 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 700 transitions. [2021-11-19 04:23:48,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2021-11-19 04:23:48,862 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:48,863 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-19 04:23:48,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-19 04:23:48,863 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:48,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:48,866 INFO L85 PathProgramCache]: Analyzing trace with hash -378112666, now seen corresponding path program 1 times [2021-11-19 04:23:48,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:48,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840772484] [2021-11-19 04:23:48,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:48,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:48,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:23:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:23:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:23:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:23:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:23:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:23:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:23:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:23:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:23:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-19 04:23:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-19 04:23:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2021-11-19 04:23:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2021-11-19 04:23:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2021-11-19 04:23:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,070 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2021-11-19 04:23:49,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:49,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840772484] [2021-11-19 04:23:49,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840772484] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:49,071 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:23:49,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 04:23:49,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461344880] [2021-11-19 04:23:49,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:49,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:23:49,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:49,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:23:49,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:23:49,073 INFO L87 Difference]: Start difference. First operand 533 states and 700 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-11-19 04:23:49,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:49,422 INFO L93 Difference]: Finished difference Result 1127 states and 1536 transitions. [2021-11-19 04:23:49,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:23:49,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 265 [2021-11-19 04:23:49,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:49,430 INFO L225 Difference]: With dead ends: 1127 [2021-11-19 04:23:49,430 INFO L226 Difference]: Without dead ends: 833 [2021-11-19 04:23:49,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-11-19 04:23:49,433 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 220 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:49,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 651 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-19 04:23:49,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2021-11-19 04:23:49,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 655. [2021-11-19 04:23:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 554 states have (on average 1.3212996389891696) internal successors, (732), 559 states have internal predecessors, (732), 65 states have call successors, (65), 35 states have call predecessors, (65), 35 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2021-11-19 04:23:49,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 862 transitions. [2021-11-19 04:23:49,501 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 862 transitions. Word has length 265 [2021-11-19 04:23:49,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:49,502 INFO L470 AbstractCegarLoop]: Abstraction has 655 states and 862 transitions. [2021-11-19 04:23:49,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-11-19 04:23:49,503 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 862 transitions. [2021-11-19 04:23:49,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2021-11-19 04:23:49,506 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:49,506 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-19 04:23:49,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-19 04:23:49,507 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:49,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:49,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1594763960, now seen corresponding path program 1 times [2021-11-19 04:23:49,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:49,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163060256] [2021-11-19 04:23:49,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:49,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:23:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:23:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:23:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:23:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:23:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:23:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:23:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:23:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:23:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-19 04:23:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-19 04:23:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-19 04:23:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-11-19 04:23:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2021-11-19 04:23:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2021-11-19 04:23:49,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:49,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163060256] [2021-11-19 04:23:49,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163060256] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:23:49,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967780616] [2021-11-19 04:23:49,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:49,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:23:49,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:23:49,709 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:23:49,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-19 04:23:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:49,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-19 04:23:49,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:23:50,257 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2021-11-19 04:23:50,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-19 04:23:50,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967780616] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:50,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-19 04:23:50,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2021-11-19 04:23:50,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56117061] [2021-11-19 04:23:50,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:50,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:23:50,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:50,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:23:50,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-19 04:23:50,261 INFO L87 Difference]: Start difference. First operand 655 states and 862 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-19 04:23:50,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:50,388 INFO L93 Difference]: Finished difference Result 1045 states and 1410 transitions. [2021-11-19 04:23:50,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:23:50,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 266 [2021-11-19 04:23:50,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:50,394 INFO L225 Difference]: With dead ends: 1045 [2021-11-19 04:23:50,394 INFO L226 Difference]: Without dead ends: 655 [2021-11-19 04:23:50,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-19 04:23:50,396 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 51 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:50,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 687 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 04:23:50,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2021-11-19 04:23:50,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2021-11-19 04:23:50,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 554 states have (on average 1.3104693140794224) internal successors, (726), 559 states have internal predecessors, (726), 65 states have call successors, (65), 35 states have call predecessors, (65), 35 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2021-11-19 04:23:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 856 transitions. [2021-11-19 04:23:50,456 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 856 transitions. Word has length 266 [2021-11-19 04:23:50,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:50,458 INFO L470 AbstractCegarLoop]: Abstraction has 655 states and 856 transitions. [2021-11-19 04:23:50,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-19 04:23:50,460 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 856 transitions. [2021-11-19 04:23:50,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2021-11-19 04:23:50,463 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:50,464 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-19 04:23:50,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-19 04:23:50,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:23:50,689 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:50,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:50,689 INFO L85 PathProgramCache]: Analyzing trace with hash 723082873, now seen corresponding path program 1 times [2021-11-19 04:23:50,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:50,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71020283] [2021-11-19 04:23:50,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:50,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:23:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:23:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:23:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:23:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:23:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:23:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:23:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:23:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:23:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-19 04:23:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-19 04:23:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-19 04:23:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-19 04:23:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-11-19 04:23:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2021-11-19 04:23:50,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:50,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71020283] [2021-11-19 04:23:50,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71020283] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:23:50,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452968366] [2021-11-19 04:23:50,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:50,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:23:50,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:23:50,905 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:23:50,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-19 04:23:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:51,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-19 04:23:51,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:23:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2021-11-19 04:23:51,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-19 04:23:51,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452968366] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:51,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-19 04:23:51,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2021-11-19 04:23:51,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896803725] [2021-11-19 04:23:51,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:51,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:23:51,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:51,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:23:51,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-19 04:23:51,560 INFO L87 Difference]: Start difference. First operand 655 states and 856 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-19 04:23:51,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:51,666 INFO L93 Difference]: Finished difference Result 1045 states and 1396 transitions. [2021-11-19 04:23:51,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:23:51,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 267 [2021-11-19 04:23:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:51,672 INFO L225 Difference]: With dead ends: 1045 [2021-11-19 04:23:51,672 INFO L226 Difference]: Without dead ends: 667 [2021-11-19 04:23:51,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-19 04:23:51,674 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 15 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:51,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 710 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2021-11-19 04:23:51,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2021-11-19 04:23:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 564 states have (on average 1.3120567375886525) internal successors, (740), 569 states have internal predecessors, (740), 65 states have call successors, (65), 37 states have call predecessors, (65), 37 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2021-11-19 04:23:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 870 transitions. [2021-11-19 04:23:51,738 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 870 transitions. Word has length 267 [2021-11-19 04:23:51,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:51,739 INFO L470 AbstractCegarLoop]: Abstraction has 667 states and 870 transitions. [2021-11-19 04:23:51,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-19 04:23:51,739 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 870 transitions. [2021-11-19 04:23:51,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-11-19 04:23:51,742 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:51,742 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-19 04:23:51,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-19 04:23:51,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-19 04:23:51,969 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:51,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:51,969 INFO L85 PathProgramCache]: Analyzing trace with hash -185468270, now seen corresponding path program 1 times [2021-11-19 04:23:51,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:51,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091933984] [2021-11-19 04:23:51,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:51,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:23:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:23:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:23:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:23:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:23:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:23:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:23:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:23:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:23:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-19 04:23:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-19 04:23:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-19 04:23:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-19 04:23:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-19 04:23:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,223 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2021-11-19 04:23:52,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:52,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091933984] [2021-11-19 04:23:52,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091933984] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:23:52,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476972010] [2021-11-19 04:23:52,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:52,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:23:52,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:23:52,226 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:23:52,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-19 04:23:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:52,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-19 04:23:52,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:23:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2021-11-19 04:23:52,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-19 04:23:52,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476972010] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:52,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-19 04:23:52,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 14 [2021-11-19 04:23:52,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668462082] [2021-11-19 04:23:52,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:52,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-19 04:23:52,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:52,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-19 04:23:52,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-11-19 04:23:52,881 INFO L87 Difference]: Start difference. First operand 667 states and 870 transitions. Second operand has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2021-11-19 04:23:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:53,115 INFO L93 Difference]: Finished difference Result 1441 states and 2083 transitions. [2021-11-19 04:23:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-19 04:23:53,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 268 [2021-11-19 04:23:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:53,125 INFO L225 Difference]: With dead ends: 1441 [2021-11-19 04:23:53,126 INFO L226 Difference]: Without dead ends: 1439 [2021-11-19 04:23:53,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2021-11-19 04:23:53,128 INFO L933 BasicCegarLoop]: 507 mSDtfsCounter, 553 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 2807 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:53,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [588 Valid, 2807 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 04:23:53,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2021-11-19 04:23:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 673. [2021-11-19 04:23:53,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 568 states have (on average 1.3098591549295775) internal successors, (744), 574 states have internal predecessors, (744), 66 states have call successors, (66), 38 states have call predecessors, (66), 38 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2021-11-19 04:23:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 876 transitions. [2021-11-19 04:23:53,204 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 876 transitions. Word has length 268 [2021-11-19 04:23:53,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:53,205 INFO L470 AbstractCegarLoop]: Abstraction has 673 states and 876 transitions. [2021-11-19 04:23:53,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2021-11-19 04:23:53,206 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 876 transitions. [2021-11-19 04:23:53,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2021-11-19 04:23:53,209 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:53,209 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 04:23:53,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-19 04:23:53,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-19 04:23:53,433 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:53,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:53,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1915412215, now seen corresponding path program 1 times [2021-11-19 04:23:53,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:53,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846737011] [2021-11-19 04:23:53,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:53,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:23:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:23:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:23:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:23:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:23:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:23:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:23:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:23:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:23:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-19 04:23:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-19 04:23:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-19 04:23:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-19 04:23:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-19 04:23:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-11-19 04:23:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2021-11-19 04:23:53,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:53,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846737011] [2021-11-19 04:23:53,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846737011] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:23:53,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099350829] [2021-11-19 04:23:53,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:53,680 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:23:53,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:23:53,685 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:23:53,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-19 04:23:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:53,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-19 04:23:53,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:23:54,471 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 251 proven. 33 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2021-11-19 04:23:54,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 04:23:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2021-11-19 04:23:55,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099350829] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 04:23:55,201 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 04:23:55,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2021-11-19 04:23:55,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140181050] [2021-11-19 04:23:55,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 04:23:55,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-19 04:23:55,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:55,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-19 04:23:55,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-11-19 04:23:55,204 INFO L87 Difference]: Start difference. First operand 673 states and 876 transitions. Second operand has 19 states, 19 states have (on average 7.894736842105263) internal successors, (150), 14 states have internal predecessors, (150), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2021-11-19 04:23:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:57,088 INFO L93 Difference]: Finished difference Result 1913 states and 2671 transitions. [2021-11-19 04:23:57,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-19 04:23:57,089 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.894736842105263) internal successors, (150), 14 states have internal predecessors, (150), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) Word has length 276 [2021-11-19 04:23:57,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:57,100 INFO L225 Difference]: With dead ends: 1913 [2021-11-19 04:23:57,100 INFO L226 Difference]: Without dead ends: 1517 [2021-11-19 04:23:57,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2021-11-19 04:23:57,103 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 685 mSDsluCounter, 3272 mSDsCounter, 0 mSdLazyCounter, 1766 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 3654 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:57,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [733 Valid, 3654 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1766 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-19 04:23:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2021-11-19 04:23:57,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 940. [2021-11-19 04:23:57,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 795 states have (on average 1.3018867924528301) internal successors, (1035), 802 states have internal predecessors, (1035), 90 states have call successors, (90), 51 states have call predecessors, (90), 54 states have return successors, (95), 90 states have call predecessors, (95), 90 states have call successors, (95) [2021-11-19 04:23:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1220 transitions. [2021-11-19 04:23:57,170 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1220 transitions. Word has length 276 [2021-11-19 04:23:57,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:57,171 INFO L470 AbstractCegarLoop]: Abstraction has 940 states and 1220 transitions. [2021-11-19 04:23:57,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.894736842105263) internal successors, (150), 14 states have internal predecessors, (150), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2021-11-19 04:23:57,172 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1220 transitions. [2021-11-19 04:23:57,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2021-11-19 04:23:57,175 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:57,175 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 04:23:57,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-19 04:23:57,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-19 04:23:57,401 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:57,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:57,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1417941064, now seen corresponding path program 1 times [2021-11-19 04:23:57,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:57,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253669269] [2021-11-19 04:23:57,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:57,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:23:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:23:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:23:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:23:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:23:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:23:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:23:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:23:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:23:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-19 04:23:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-19 04:23:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-19 04:23:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-19 04:23:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-19 04:23:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-11-19 04:23:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,569 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2021-11-19 04:23:57,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:57,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253669269] [2021-11-19 04:23:57,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253669269] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:23:57,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900362365] [2021-11-19 04:23:57,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:57,570 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:23:57,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:23:57,573 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:23:57,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-19 04:23:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:57,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 04:23:57,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:23:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2021-11-19 04:23:58,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-19 04:23:58,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900362365] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:58,209 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-19 04:23:58,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-11-19 04:23:58,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080896185] [2021-11-19 04:23:58,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:58,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:23:58,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:58,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:23:58,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 04:23:58,211 INFO L87 Difference]: Start difference. First operand 940 states and 1220 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-19 04:23:58,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:58,298 INFO L93 Difference]: Finished difference Result 1743 states and 2304 transitions. [2021-11-19 04:23:58,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:23:58,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 276 [2021-11-19 04:23:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:58,306 INFO L225 Difference]: With dead ends: 1743 [2021-11-19 04:23:58,306 INFO L226 Difference]: Without dead ends: 924 [2021-11-19 04:23:58,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-19 04:23:58,309 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 11 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:58,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 710 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2021-11-19 04:23:58,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 924. [2021-11-19 04:23:58,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 784 states have (on average 1.2895408163265305) internal successors, (1011), 791 states have internal predecessors, (1011), 86 states have call successors, (86), 51 states have call predecessors, (86), 53 states have return successors, (90), 85 states have call predecessors, (90), 86 states have call successors, (90) [2021-11-19 04:23:58,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1187 transitions. [2021-11-19 04:23:58,364 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1187 transitions. Word has length 276 [2021-11-19 04:23:58,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:58,365 INFO L470 AbstractCegarLoop]: Abstraction has 924 states and 1187 transitions. [2021-11-19 04:23:58,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-19 04:23:58,365 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1187 transitions. [2021-11-19 04:23:58,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-11-19 04:23:58,368 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:58,369 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 04:23:58,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-19 04:23:58,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-19 04:23:58,587 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:58,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:58,587 INFO L85 PathProgramCache]: Analyzing trace with hash -818721709, now seen corresponding path program 1 times [2021-11-19 04:23:58,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:58,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861007205] [2021-11-19 04:23:58,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:58,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:23:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:23:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:23:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:23:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:23:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:23:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:23:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:23:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:23:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:23:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:23:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:23:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:23:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-19 04:23:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-19 04:23:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-11-19 04:23:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2021-11-19 04:23:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2021-11-19 04:23:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-11-19 04:23:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-11-19 04:23:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-11-19 04:23:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-11-19 04:23:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2021-11-19 04:23:58,768 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:23:58,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861007205] [2021-11-19 04:23:58,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861007205] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:23:58,769 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485683080] [2021-11-19 04:23:58,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:58,769 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:23:58,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:23:58,770 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:23:58,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-19 04:23:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:58,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 04:23:58,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:23:59,447 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2021-11-19 04:23:59,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-19 04:23:59,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485683080] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:23:59,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-19 04:23:59,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-11-19 04:23:59,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761619496] [2021-11-19 04:23:59,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:23:59,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:23:59,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:23:59,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:23:59,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 04:23:59,453 INFO L87 Difference]: Start difference. First operand 924 states and 1187 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-19 04:23:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:23:59,544 INFO L93 Difference]: Finished difference Result 1576 states and 2065 transitions. [2021-11-19 04:23:59,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:23:59,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 279 [2021-11-19 04:23:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:23:59,550 INFO L225 Difference]: With dead ends: 1576 [2021-11-19 04:23:59,550 INFO L226 Difference]: Without dead ends: 764 [2021-11-19 04:23:59,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-19 04:23:59,553 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 8 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:23:59,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 713 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:23:59,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2021-11-19 04:23:59,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2021-11-19 04:23:59,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 642 states have (on average 1.2850467289719627) internal successors, (825), 649 states have internal predecessors, (825), 77 states have call successors, (77), 44 states have call predecessors, (77), 44 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) [2021-11-19 04:23:59,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 979 transitions. [2021-11-19 04:23:59,600 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 979 transitions. Word has length 279 [2021-11-19 04:23:59,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:23:59,601 INFO L470 AbstractCegarLoop]: Abstraction has 764 states and 979 transitions. [2021-11-19 04:23:59,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-19 04:23:59,601 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 979 transitions. [2021-11-19 04:23:59,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2021-11-19 04:23:59,604 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:23:59,604 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-19 04:23:59,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-19 04:23:59,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:23:59,825 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:23:59,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:23:59,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2031857474, now seen corresponding path program 1 times [2021-11-19 04:23:59,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:23:59,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728379747] [2021-11-19 04:23:59,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:23:59,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:23:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:59,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:23:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:23:59,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:24:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:24:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:24:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:24:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:24:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:24:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:24:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:24:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:24:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:24:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:24:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:24:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:24:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:24:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-19 04:24:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-19 04:24:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-19 04:24:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-19 04:24:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-19 04:24:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-11-19 04:24:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2021-11-19 04:24:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-11-19 04:24:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,122 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2021-11-19 04:24:00,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:24:00,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728379747] [2021-11-19 04:24:00,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728379747] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:24:00,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304018872] [2021-11-19 04:24:00,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:24:00,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:24:00,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:24:00,125 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:24:00,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-19 04:24:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:00,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-19 04:24:00,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:24:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2021-11-19 04:24:00,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-19 04:24:00,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304018872] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:24:00,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-19 04:24:00,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2021-11-19 04:24:00,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130767637] [2021-11-19 04:24:00,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:24:00,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-19 04:24:00,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:24:00,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-19 04:24:00,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2021-11-19 04:24:00,929 INFO L87 Difference]: Start difference. First operand 764 states and 979 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 9 states have internal predecessors, (110), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2021-11-19 04:24:01,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:24:01,805 INFO L93 Difference]: Finished difference Result 2072 states and 2753 transitions. [2021-11-19 04:24:01,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-19 04:24:01,806 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 9 states have internal predecessors, (110), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 291 [2021-11-19 04:24:01,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:24:01,819 INFO L225 Difference]: With dead ends: 2072 [2021-11-19 04:24:01,820 INFO L226 Difference]: Without dead ends: 1672 [2021-11-19 04:24:01,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=1094, Unknown=0, NotChecked=0, Total=1260 [2021-11-19 04:24:01,823 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 1216 mSDsluCounter, 2853 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 3254 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-19 04:24:01,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1220 Valid, 3254 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-19 04:24:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2021-11-19 04:24:01,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 919. [2021-11-19 04:24:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 766 states have (on average 1.2845953002610966) internal successors, (984), 774 states have internal predecessors, (984), 98 states have call successors, (98), 54 states have call predecessors, (98), 54 states have return successors, (98), 94 states have call predecessors, (98), 98 states have call successors, (98) [2021-11-19 04:24:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1180 transitions. [2021-11-19 04:24:01,891 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1180 transitions. Word has length 291 [2021-11-19 04:24:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:24:01,892 INFO L470 AbstractCegarLoop]: Abstraction has 919 states and 1180 transitions. [2021-11-19 04:24:01,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 9 states have internal predecessors, (110), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2021-11-19 04:24:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1180 transitions. [2021-11-19 04:24:01,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2021-11-19 04:24:01,895 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:24:01,895 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-19 04:24:01,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-19 04:24:02,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:24:02,114 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:24:02,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:24:02,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1472400859, now seen corresponding path program 1 times [2021-11-19 04:24:02,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:24:02,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450638321] [2021-11-19 04:24:02,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:24:02,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:24:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:24:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:24:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:24:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:24:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:24:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:24:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:24:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:24:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:24:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:24:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:24:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:24:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:24:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:24:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:24:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-19 04:24:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-19 04:24:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-19 04:24:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-19 04:24:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-11-19 04:24:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-11-19 04:24:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2021-11-19 04:24:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-19 04:24:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:02,291 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2021-11-19 04:24:02,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:24:02,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450638321] [2021-11-19 04:24:02,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450638321] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:24:02,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:24:02,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-19 04:24:02,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398481643] [2021-11-19 04:24:02,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:24:02,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-19 04:24:02,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:24:02,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-19 04:24:02,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-19 04:24:02,295 INFO L87 Difference]: Start difference. First operand 919 states and 1180 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2021-11-19 04:24:02,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:24:02,824 INFO L93 Difference]: Finished difference Result 2496 states and 3489 transitions. [2021-11-19 04:24:02,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-19 04:24:02,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 297 [2021-11-19 04:24:02,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:24:02,839 INFO L225 Difference]: With dead ends: 2496 [2021-11-19 04:24:02,839 INFO L226 Difference]: Without dead ends: 1923 [2021-11-19 04:24:02,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-19 04:24:02,842 INFO L933 BasicCegarLoop]: 548 mSDtfsCounter, 494 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-19 04:24:02,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 2138 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-19 04:24:02,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2021-11-19 04:24:02,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 974. [2021-11-19 04:24:02,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 809 states have (on average 1.2954264524103831) internal successors, (1048), 817 states have internal predecessors, (1048), 110 states have call successors, (110), 54 states have call predecessors, (110), 54 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2021-11-19 04:24:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1268 transitions. [2021-11-19 04:24:02,928 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1268 transitions. Word has length 297 [2021-11-19 04:24:02,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:24:02,929 INFO L470 AbstractCegarLoop]: Abstraction has 974 states and 1268 transitions. [2021-11-19 04:24:02,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2021-11-19 04:24:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1268 transitions. [2021-11-19 04:24:02,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2021-11-19 04:24:02,933 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:24:02,933 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-19 04:24:02,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-19 04:24:02,933 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:24:02,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:24:02,934 INFO L85 PathProgramCache]: Analyzing trace with hash -358014121, now seen corresponding path program 1 times [2021-11-19 04:24:02,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:24:02,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558992897] [2021-11-19 04:24:02,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:24:02,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:24:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:24:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:24:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:24:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:24:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:24:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:24:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:24:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:24:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:24:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:24:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:24:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:24:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:24:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:24:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:24:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-19 04:24:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-19 04:24:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-19 04:24:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-19 04:24:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-11-19 04:24:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-11-19 04:24:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2021-11-19 04:24:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-19 04:24:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,150 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2021-11-19 04:24:03,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:24:03,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558992897] [2021-11-19 04:24:03,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558992897] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:24:03,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446261872] [2021-11-19 04:24:03,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:24:03,151 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:24:03,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:24:03,152 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:24:03,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-19 04:24:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:03,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-19 04:24:03,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:24:04,135 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2021-11-19 04:24:04,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-19 04:24:04,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446261872] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:24:04,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-19 04:24:04,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 12 [2021-11-19 04:24:04,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399897146] [2021-11-19 04:24:04,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:24:04,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-19 04:24:04,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:24:04,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-19 04:24:04,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-11-19 04:24:04,138 INFO L87 Difference]: Start difference. First operand 974 states and 1268 transitions. Second operand has 10 states, 10 states have (on average 11.8) internal successors, (118), 9 states have internal predecessors, (118), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2021-11-19 04:24:05,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:24:05,353 INFO L93 Difference]: Finished difference Result 2479 states and 3355 transitions. [2021-11-19 04:24:05,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-19 04:24:05,354 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 9 states have internal predecessors, (118), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 297 [2021-11-19 04:24:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:24:05,366 INFO L225 Difference]: With dead ends: 2479 [2021-11-19 04:24:05,366 INFO L226 Difference]: Without dead ends: 1852 [2021-11-19 04:24:05,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 343 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2021-11-19 04:24:05,370 INFO L933 BasicCegarLoop]: 519 mSDtfsCounter, 1368 mSDsluCounter, 2977 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 3496 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-19 04:24:05,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1382 Valid, 3496 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-19 04:24:05,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2021-11-19 04:24:05,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 964. [2021-11-19 04:24:05,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 802 states have (on average 1.286783042394015) internal successors, (1032), 810 states have internal predecessors, (1032), 107 states have call successors, (107), 54 states have call predecessors, (107), 54 states have return successors, (107), 103 states have call predecessors, (107), 107 states have call successors, (107) [2021-11-19 04:24:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1246 transitions. [2021-11-19 04:24:05,465 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1246 transitions. Word has length 297 [2021-11-19 04:24:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:24:05,466 INFO L470 AbstractCegarLoop]: Abstraction has 964 states and 1246 transitions. [2021-11-19 04:24:05,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 9 states have internal predecessors, (118), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2021-11-19 04:24:05,466 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1246 transitions. [2021-11-19 04:24:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2021-11-19 04:24:05,469 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:24:05,469 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-19 04:24:05,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-19 04:24:05,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:24:05,693 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:24:05,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:24:05,693 INFO L85 PathProgramCache]: Analyzing trace with hash 529040727, now seen corresponding path program 1 times [2021-11-19 04:24:05,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:24:05,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496875553] [2021-11-19 04:24:05,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:24:05,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:24:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:24:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:24:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:24:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:24:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:24:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:24:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:24:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:24:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:24:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:24:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:24:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:24:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:24:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:24:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:24:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-19 04:24:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-19 04:24:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-19 04:24:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-19 04:24:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-11-19 04:24:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-11-19 04:24:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2021-11-19 04:24:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-19 04:24:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2021-11-19 04:24:05,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:24:05,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496875553] [2021-11-19 04:24:05,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496875553] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:24:05,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602033480] [2021-11-19 04:24:05,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:24:05,927 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:24:05,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:24:05,928 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:24:05,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-19 04:24:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:06,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-19 04:24:06,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:24:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2021-11-19 04:24:06,679 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-19 04:24:06,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602033480] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:24:06,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-19 04:24:06,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2021-11-19 04:24:06,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104770003] [2021-11-19 04:24:06,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:24:06,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-19 04:24:06,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:24:06,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-19 04:24:06,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2021-11-19 04:24:06,682 INFO L87 Difference]: Start difference. First operand 964 states and 1246 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2021-11-19 04:24:07,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:24:07,930 INFO L93 Difference]: Finished difference Result 3176 states and 4307 transitions. [2021-11-19 04:24:07,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-19 04:24:07,931 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 297 [2021-11-19 04:24:07,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:24:07,948 INFO L225 Difference]: With dead ends: 3176 [2021-11-19 04:24:07,948 INFO L226 Difference]: Without dead ends: 2562 [2021-11-19 04:24:07,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2021-11-19 04:24:07,952 INFO L933 BasicCegarLoop]: 555 mSDtfsCounter, 1316 mSDsluCounter, 3435 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 3990 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-19 04:24:07,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1329 Valid, 3990 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-19 04:24:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2021-11-19 04:24:08,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 1345. [2021-11-19 04:24:08,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1107 states have (on average 1.2836495031616983) internal successors, (1421), 1119 states have internal predecessors, (1421), 163 states have call successors, (163), 74 states have call predecessors, (163), 74 states have return successors, (163), 155 states have call predecessors, (163), 163 states have call successors, (163) [2021-11-19 04:24:08,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1747 transitions. [2021-11-19 04:24:08,116 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1747 transitions. Word has length 297 [2021-11-19 04:24:08,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:24:08,117 INFO L470 AbstractCegarLoop]: Abstraction has 1345 states and 1747 transitions. [2021-11-19 04:24:08,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2021-11-19 04:24:08,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1747 transitions. [2021-11-19 04:24:08,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2021-11-19 04:24:08,121 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:24:08,121 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1] [2021-11-19 04:24:08,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-19 04:24:08,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-11-19 04:24:08,334 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:24:08,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:24:08,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1597737013, now seen corresponding path program 1 times [2021-11-19 04:24:08,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:24:08,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567135836] [2021-11-19 04:24:08,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:24:08,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:24:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:24:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:24:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:24:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:24:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:24:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:24:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:24:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:24:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:24:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:24:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:24:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:24:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:24:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:24:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:24:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-19 04:24:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-19 04:24:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-19 04:24:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-19 04:24:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-19 04:24:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-11-19 04:24:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-11-19 04:24:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2021-11-19 04:24:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2021-11-19 04:24:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2021-11-19 04:24:08,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:24:08,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567135836] [2021-11-19 04:24:08,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567135836] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:24:08,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:24:08,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 04:24:08,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098062867] [2021-11-19 04:24:08,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:24:08,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 04:24:08,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:24:08,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 04:24:08,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 04:24:08,512 INFO L87 Difference]: Start difference. First operand 1345 states and 1747 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-19 04:24:09,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:24:09,108 INFO L93 Difference]: Finished difference Result 2402 states and 3143 transitions. [2021-11-19 04:24:09,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-19 04:24:09,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 311 [2021-11-19 04:24:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:24:09,119 INFO L225 Difference]: With dead ends: 2402 [2021-11-19 04:24:09,119 INFO L226 Difference]: Without dead ends: 1424 [2021-11-19 04:24:09,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-19 04:24:09,123 INFO L933 BasicCegarLoop]: 384 mSDtfsCounter, 500 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-19 04:24:09,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [520 Valid, 1000 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-19 04:24:09,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2021-11-19 04:24:09,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1151. [2021-11-19 04:24:09,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 956 states have (on average 1.2646443514644352) internal successors, (1209), 962 states have internal predecessors, (1209), 134 states have call successors, (134), 60 states have call predecessors, (134), 60 states have return successors, (134), 128 states have call predecessors, (134), 134 states have call successors, (134) [2021-11-19 04:24:09,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1477 transitions. [2021-11-19 04:24:09,247 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1477 transitions. Word has length 311 [2021-11-19 04:24:09,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:24:09,248 INFO L470 AbstractCegarLoop]: Abstraction has 1151 states and 1477 transitions. [2021-11-19 04:24:09,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-19 04:24:09,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1477 transitions. [2021-11-19 04:24:09,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2021-11-19 04:24:09,253 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:24:09,254 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 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] [2021-11-19 04:24:09,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-19 04:24:09,254 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:24:09,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:24:09,255 INFO L85 PathProgramCache]: Analyzing trace with hash 522126260, now seen corresponding path program 1 times [2021-11-19 04:24:09,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:24:09,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630005106] [2021-11-19 04:24:09,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:24:09,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:24:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:24:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:24:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:24:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:24:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:24:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:24:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:24:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:24:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:24:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:24:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:24:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:24:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:24:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:24:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:24:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-19 04:24:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-19 04:24:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-19 04:24:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-19 04:24:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-19 04:24:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-11-19 04:24:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-11-19 04:24:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-19 04:24:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-11-19 04:24:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-11-19 04:24:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-11-19 04:24:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2021-11-19 04:24:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-11-19 04:24:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,649 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2021-11-19 04:24:09,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:24:09,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630005106] [2021-11-19 04:24:09,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630005106] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:24:09,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969362651] [2021-11-19 04:24:09,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:24:09,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:24:09,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:24:09,657 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:24:09,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-19 04:24:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:09,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-19 04:24:09,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:24:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 151 proven. 33 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2021-11-19 04:24:10,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 04:24:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 49 proven. 2 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [2021-11-19 04:24:11,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969362651] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 04:24:11,473 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 04:24:11,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 9] total 29 [2021-11-19 04:24:11,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502811220] [2021-11-19 04:24:11,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 04:24:11,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-19 04:24:11,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:24:11,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-19 04:24:11,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2021-11-19 04:24:11,476 INFO L87 Difference]: Start difference. First operand 1151 states and 1477 transitions. Second operand has 29 states, 29 states have (on average 7.413793103448276) internal successors, (215), 24 states have internal predecessors, (215), 7 states have call successors, (45), 6 states have call predecessors, (45), 10 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) [2021-11-19 04:24:34,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:24:34,052 INFO L93 Difference]: Finished difference Result 12771 states and 18354 transitions. [2021-11-19 04:24:34,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 316 states. [2021-11-19 04:24:34,052 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.413793103448276) internal successors, (215), 24 states have internal predecessors, (215), 7 states have call successors, (45), 6 states have call predecessors, (45), 10 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) Word has length 350 [2021-11-19 04:24:34,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:24:34,115 INFO L225 Difference]: With dead ends: 12771 [2021-11-19 04:24:34,115 INFO L226 Difference]: Without dead ends: 11987 [2021-11-19 04:24:34,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1229 GetRequests, 889 SyntacticMatches, 1 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47948 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=7954, Invalid=107986, Unknown=0, NotChecked=0, Total=115940 [2021-11-19 04:24:34,146 INFO L933 BasicCegarLoop]: 986 mSDtfsCounter, 5253 mSDsluCounter, 15277 mSDsCounter, 0 mSdLazyCounter, 23047 mSolverCounterSat, 4331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5279 SdHoareTripleChecker+Valid, 16263 SdHoareTripleChecker+Invalid, 27378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4331 IncrementalHoareTripleChecker+Valid, 23047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2021-11-19 04:24:34,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5279 Valid, 16263 Invalid, 27378 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4331 Valid, 23047 Invalid, 0 Unknown, 0 Unchecked, 13.1s Time] [2021-11-19 04:24:34,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11987 states. [2021-11-19 04:24:34,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11987 to 2956. [2021-11-19 04:24:34,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2956 states, 2408 states have (on average 1.2786544850498338) internal successors, (3079), 2434 states have internal predecessors, (3079), 362 states have call successors, (362), 165 states have call predecessors, (362), 185 states have return successors, (388), 356 states have call predecessors, (388), 362 states have call successors, (388) [2021-11-19 04:24:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 3829 transitions. [2021-11-19 04:24:34,707 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 3829 transitions. Word has length 350 [2021-11-19 04:24:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:24:34,708 INFO L470 AbstractCegarLoop]: Abstraction has 2956 states and 3829 transitions. [2021-11-19 04:24:34,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.413793103448276) internal successors, (215), 24 states have internal predecessors, (215), 7 states have call successors, (45), 6 states have call predecessors, (45), 10 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) [2021-11-19 04:24:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 3829 transitions. [2021-11-19 04:24:34,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2021-11-19 04:24:34,718 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:24:34,718 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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] [2021-11-19 04:24:34,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-19 04:24:34,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-11-19 04:24:34,945 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:24:34,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:24:34,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2072375083, now seen corresponding path program 1 times [2021-11-19 04:24:34,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:24:34,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120455731] [2021-11-19 04:24:34,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:24:34,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:24:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:24:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:24:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:24:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:24:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:24:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:24:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:24:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:24:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:24:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:24:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:24:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:24:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:24:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:24:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:24:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-19 04:24:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-19 04:24:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-19 04:24:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-19 04:24:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-19 04:24:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-11-19 04:24:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-11-19 04:24:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-19 04:24:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-11-19 04:24:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-11-19 04:24:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-11-19 04:24:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2021-11-19 04:24:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-11-19 04:24:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2021-11-19 04:24:35,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:24:35,173 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120455731] [2021-11-19 04:24:35,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120455731] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:24:35,173 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:24:35,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-19 04:24:35,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955625953] [2021-11-19 04:24:35,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:24:35,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 04:24:35,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:24:35,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 04:24:35,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-19 04:24:35,178 INFO L87 Difference]: Start difference. First operand 2956 states and 3829 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2021-11-19 04:24:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:24:35,860 INFO L93 Difference]: Finished difference Result 5518 states and 7188 transitions. [2021-11-19 04:24:35,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-19 04:24:35,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 350 [2021-11-19 04:24:35,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:24:35,873 INFO L225 Difference]: With dead ends: 5518 [2021-11-19 04:24:35,873 INFO L226 Difference]: Without dead ends: 2956 [2021-11-19 04:24:35,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-19 04:24:35,880 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 377 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-19 04:24:35,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 467 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-19 04:24:35,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2021-11-19 04:24:36,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2956. [2021-11-19 04:24:36,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2956 states, 2408 states have (on average 1.2774086378737541) internal successors, (3076), 2434 states have internal predecessors, (3076), 362 states have call successors, (362), 165 states have call predecessors, (362), 185 states have return successors, (388), 356 states have call predecessors, (388), 362 states have call successors, (388) [2021-11-19 04:24:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 3826 transitions. [2021-11-19 04:24:36,190 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 3826 transitions. Word has length 350 [2021-11-19 04:24:36,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:24:36,191 INFO L470 AbstractCegarLoop]: Abstraction has 2956 states and 3826 transitions. [2021-11-19 04:24:36,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2021-11-19 04:24:36,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 3826 transitions. [2021-11-19 04:24:36,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2021-11-19 04:24:36,201 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:24:36,201 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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-11-19 04:24:36,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-19 04:24:36,201 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:24:36,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:24:36,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1816454027, now seen corresponding path program 1 times [2021-11-19 04:24:36,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:24:36,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680623974] [2021-11-19 04:24:36,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:24:36,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:24:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:24:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:24:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:24:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:24:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:24:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:24:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:24:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:24:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:24:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:24:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:24:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:24:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:24:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:24:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:24:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-19 04:24:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-19 04:24:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-19 04:24:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-19 04:24:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-19 04:24:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-11-19 04:24:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-11-19 04:24:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-19 04:24:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-11-19 04:24:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-11-19 04:24:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-11-19 04:24:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2021-11-19 04:24:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-11-19 04:24:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:36,379 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2021-11-19 04:24:36,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:24:36,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680623974] [2021-11-19 04:24:36,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680623974] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:24:36,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:24:36,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 04:24:36,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934754928] [2021-11-19 04:24:36,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:24:36,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:24:36,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:24:36,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:24:36,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:24:36,383 INFO L87 Difference]: Start difference. First operand 2956 states and 3826 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-19 04:24:37,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:24:37,077 INFO L93 Difference]: Finished difference Result 7976 states and 10384 transitions. [2021-11-19 04:24:37,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:24:37,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 350 [2021-11-19 04:24:37,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:24:37,098 INFO L225 Difference]: With dead ends: 7976 [2021-11-19 04:24:37,099 INFO L226 Difference]: Without dead ends: 5394 [2021-11-19 04:24:37,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 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-11-19 04:24:37,107 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 215 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 04:24:37,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 666 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-19 04:24:37,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5394 states. [2021-11-19 04:24:37,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5394 to 3346. [2021-11-19 04:24:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3346 states, 2798 states have (on average 1.2773409578270194) internal successors, (3574), 2824 states have internal predecessors, (3574), 362 states have call successors, (362), 165 states have call predecessors, (362), 185 states have return successors, (388), 356 states have call predecessors, (388), 362 states have call successors, (388) [2021-11-19 04:24:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3346 states to 3346 states and 4324 transitions. [2021-11-19 04:24:37,620 INFO L78 Accepts]: Start accepts. Automaton has 3346 states and 4324 transitions. Word has length 350 [2021-11-19 04:24:37,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:24:37,621 INFO L470 AbstractCegarLoop]: Abstraction has 3346 states and 4324 transitions. [2021-11-19 04:24:37,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-19 04:24:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 4324 transitions. [2021-11-19 04:24:37,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2021-11-19 04:24:37,634 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:24:37,635 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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-11-19 04:24:37,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-19 04:24:37,635 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:24:37,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:24:37,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1483810889, now seen corresponding path program 1 times [2021-11-19 04:24:37,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:24:37,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467967585] [2021-11-19 04:24:37,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:24:37,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:24:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:24:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:24:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:24:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:24:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:24:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:24:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:24:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:24:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:24:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:24:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:24:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:24:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:24:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:24:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:24:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-19 04:24:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-19 04:24:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-19 04:24:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-19 04:24:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-19 04:24:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-11-19 04:24:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-11-19 04:24:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-19 04:24:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-11-19 04:24:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-11-19 04:24:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-11-19 04:24:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2021-11-19 04:24:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-11-19 04:24:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:37,819 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2021-11-19 04:24:37,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:24:37,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467967585] [2021-11-19 04:24:37,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467967585] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:24:37,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:24:37,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 04:24:37,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872237505] [2021-11-19 04:24:37,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:24:37,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 04:24:37,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:24:37,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 04:24:37,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 04:24:37,822 INFO L87 Difference]: Start difference. First operand 3346 states and 4324 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2021-11-19 04:24:38,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:24:38,412 INFO L93 Difference]: Finished difference Result 6737 states and 8695 transitions. [2021-11-19 04:24:38,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 04:24:38,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 350 [2021-11-19 04:24:38,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:24:38,426 INFO L225 Difference]: With dead ends: 6737 [2021-11-19 04:24:38,426 INFO L226 Difference]: Without dead ends: 3266 [2021-11-19 04:24:38,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-19 04:24:38,435 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 107 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 04:24:38,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 730 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-19 04:24:38,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2021-11-19 04:24:38,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2021-11-19 04:24:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 2738 states have (on average 1.2509130752373996) internal successors, (3425), 2764 states have internal predecessors, (3425), 362 states have call successors, (362), 165 states have call predecessors, (362), 165 states have return successors, (362), 336 states have call predecessors, (362), 362 states have call successors, (362) [2021-11-19 04:24:38,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4149 transitions. [2021-11-19 04:24:38,895 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4149 transitions. Word has length 350 [2021-11-19 04:24:38,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:24:38,896 INFO L470 AbstractCegarLoop]: Abstraction has 3266 states and 4149 transitions. [2021-11-19 04:24:38,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2021-11-19 04:24:38,896 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4149 transitions. [2021-11-19 04:24:38,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2021-11-19 04:24:38,907 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:24:38,907 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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] [2021-11-19 04:24:38,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-19 04:24:38,908 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:24:38,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:24:38,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1962062639, now seen corresponding path program 1 times [2021-11-19 04:24:38,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:24:38,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519898689] [2021-11-19 04:24:38,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:24:38,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:24:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:24:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:24:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:24:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:24:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:24:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:24:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:24:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:24:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:24:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:24:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:24:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:24:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:24:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:24:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:24:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-19 04:24:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-19 04:24:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-19 04:24:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-19 04:24:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-19 04:24:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-11-19 04:24:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-11-19 04:24:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-19 04:24:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-11-19 04:24:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-11-19 04:24:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-11-19 04:24:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2021-11-19 04:24:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-11-19 04:24:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2021-11-19 04:24:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:39,119 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 910 trivial. 0 not checked. [2021-11-19 04:24:39,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:24:39,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519898689] [2021-11-19 04:24:39,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519898689] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:24:39,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:24:39,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 04:24:39,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256523361] [2021-11-19 04:24:39,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:24:39,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:24:39,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:24:39,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:24:39,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:24:39,122 INFO L87 Difference]: Start difference. First operand 3266 states and 4149 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-19 04:24:39,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:24:39,624 INFO L93 Difference]: Finished difference Result 6124 states and 7812 transitions. [2021-11-19 04:24:39,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 04:24:39,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 360 [2021-11-19 04:24:39,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:24:39,636 INFO L225 Difference]: With dead ends: 6124 [2021-11-19 04:24:39,636 INFO L226 Difference]: Without dead ends: 3171 [2021-11-19 04:24:39,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:24:39,644 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 54 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 04:24:39,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 569 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-19 04:24:39,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2021-11-19 04:24:39,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 3171. [2021-11-19 04:24:39,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3171 states, 2643 states have (on average 1.2368520620507) internal successors, (3269), 2669 states have internal predecessors, (3269), 362 states have call successors, (362), 165 states have call predecessors, (362), 165 states have return successors, (362), 336 states have call predecessors, (362), 362 states have call successors, (362) [2021-11-19 04:24:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 3993 transitions. [2021-11-19 04:24:39,986 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 3993 transitions. Word has length 360 [2021-11-19 04:24:39,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:24:39,987 INFO L470 AbstractCegarLoop]: Abstraction has 3171 states and 3993 transitions. [2021-11-19 04:24:39,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-19 04:24:39,987 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 3993 transitions. [2021-11-19 04:24:39,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2021-11-19 04:24:39,998 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:24:39,999 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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] [2021-11-19 04:24:39,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-19 04:24:39,999 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:24:40,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:24:40,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1339907605, now seen corresponding path program 1 times [2021-11-19 04:24:40,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:24:40,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151393964] [2021-11-19 04:24:40,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:24:40,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:24:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:24:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:24:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:24:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:24:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:24:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:24:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:24:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:24:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:24:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:24:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:24:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:24:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:24:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:24:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:24:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:24:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-11-19 04:24:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-11-19 04:24:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-11-19 04:24:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-11-19 04:24:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-11-19 04:24:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-11-19 04:24:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-11-19 04:24:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-11-19 04:24:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-11-19 04:24:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2021-11-19 04:24:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2021-11-19 04:24:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2021-11-19 04:24:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2021-11-19 04:24:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2021-11-19 04:24:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,361 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2021-11-19 04:24:40,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:24:40,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151393964] [2021-11-19 04:24:40,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151393964] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:24:40,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739938560] [2021-11-19 04:24:40,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:24:40,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:24:40,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:24:40,363 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:24:40,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-19 04:24:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:24:40,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-19 04:24:40,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:24:41,594 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 277 proven. 80 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2021-11-19 04:24:41,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 04:24:42,654 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 34 proven. 78 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2021-11-19 04:24:42,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739938560] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 04:24:42,655 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 04:24:42,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 33 [2021-11-19 04:24:42,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187613373] [2021-11-19 04:24:42,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 04:24:42,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-19 04:24:42,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:24:42,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-19 04:24:42,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2021-11-19 04:24:42,658 INFO L87 Difference]: Start difference. First operand 3171 states and 3993 transitions. Second operand has 33 states, 33 states have (on average 8.424242424242424) internal successors, (278), 28 states have internal predecessors, (278), 8 states have call successors, (55), 9 states have call predecessors, (55), 14 states have return successors, (55), 12 states have call predecessors, (55), 8 states have call successors, (55) [2021-11-19 04:25:30,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:25:30,831 INFO L93 Difference]: Finished difference Result 37278 states and 50296 transitions. [2021-11-19 04:25:30,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 677 states. [2021-11-19 04:25:30,832 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.424242424242424) internal successors, (278), 28 states have internal predecessors, (278), 8 states have call successors, (55), 9 states have call predecessors, (55), 14 states have return successors, (55), 12 states have call predecessors, (55), 8 states have call successors, (55) Word has length 361 [2021-11-19 04:25:30,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:25:30,954 INFO L225 Difference]: With dead ends: 37278 [2021-11-19 04:25:30,954 INFO L226 Difference]: Without dead ends: 34508 [2021-11-19 04:25:31,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1488 GetRequests, 782 SyntacticMatches, 1 SemanticMatches, 705 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226139 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=34812, Invalid=464330, Unknown=0, NotChecked=0, Total=499142 [2021-11-19 04:25:31,177 INFO L933 BasicCegarLoop]: 2465 mSDtfsCounter, 5000 mSDsluCounter, 39308 mSDsCounter, 0 mSdLazyCounter, 40684 mSolverCounterSat, 7153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5000 SdHoareTripleChecker+Valid, 41773 SdHoareTripleChecker+Invalid, 47837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 7153 IncrementalHoareTripleChecker+Valid, 40684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.8s IncrementalHoareTripleChecker+Time [2021-11-19 04:25:31,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5000 Valid, 41773 Invalid, 47837 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [7153 Valid, 40684 Invalid, 0 Unknown, 0 Unchecked, 21.8s Time] [2021-11-19 04:25:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34508 states. [2021-11-19 04:25:32,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34508 to 4836. [2021-11-19 04:25:32,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4836 states, 3870 states have (on average 1.2193798449612403) internal successors, (4719), 3918 states have internal predecessors, (4719), 681 states have call successors, (681), 284 states have call predecessors, (681), 284 states have return successors, (681), 633 states have call predecessors, (681), 681 states have call successors, (681) [2021-11-19 04:25:32,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4836 states to 4836 states and 6081 transitions. [2021-11-19 04:25:32,081 INFO L78 Accepts]: Start accepts. Automaton has 4836 states and 6081 transitions. Word has length 361 [2021-11-19 04:25:32,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:25:32,082 INFO L470 AbstractCegarLoop]: Abstraction has 4836 states and 6081 transitions. [2021-11-19 04:25:32,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.424242424242424) internal successors, (278), 28 states have internal predecessors, (278), 8 states have call successors, (55), 9 states have call predecessors, (55), 14 states have return successors, (55), 12 states have call predecessors, (55), 8 states have call successors, (55) [2021-11-19 04:25:32,083 INFO L276 IsEmpty]: Start isEmpty. Operand 4836 states and 6081 transitions. [2021-11-19 04:25:32,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2021-11-19 04:25:32,100 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:25:32,101 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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-11-19 04:25:32,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-19 04:25:32,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2021-11-19 04:25:32,329 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:25:32,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:25:32,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1214808755, now seen corresponding path program 1 times [2021-11-19 04:25:32,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:25:32,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493794985] [2021-11-19 04:25:32,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:25:32,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:25:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:25:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:25:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:25:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:25:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:25:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:25:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:25:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:25:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:25:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:25:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:25:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:25:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:25:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:25:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:25:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:25:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:25:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-11-19 04:25:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-11-19 04:25:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-11-19 04:25:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-11-19 04:25:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-11-19 04:25:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-11-19 04:25:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-11-19 04:25:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-11-19 04:25:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-11-19 04:25:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2021-11-19 04:25:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2021-11-19 04:25:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-11-19 04:25:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2021-11-19 04:25:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2021-11-19 04:25:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:32,609 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2021-11-19 04:25:32,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:25:32,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493794985] [2021-11-19 04:25:32,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493794985] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:25:32,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:25:32,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-19 04:25:32,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036798456] [2021-11-19 04:25:32,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:25:32,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 04:25:32,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:25:32,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 04:25:32,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-19 04:25:32,613 INFO L87 Difference]: Start difference. First operand 4836 states and 6081 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 4 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2021-11-19 04:25:34,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:25:34,048 INFO L93 Difference]: Finished difference Result 9218 states and 11633 transitions. [2021-11-19 04:25:34,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-19 04:25:34,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 4 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 361 [2021-11-19 04:25:34,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:25:34,069 INFO L225 Difference]: With dead ends: 9218 [2021-11-19 04:25:34,069 INFO L226 Difference]: Without dead ends: 4840 [2021-11-19 04:25:34,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-19 04:25:34,082 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 366 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-19 04:25:34,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 516 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-19 04:25:34,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4840 states. [2021-11-19 04:25:34,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4840 to 4828. [2021-11-19 04:25:34,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4828 states, 3862 states have (on average 1.2187985499741067) internal successors, (4707), 3910 states have internal predecessors, (4707), 681 states have call successors, (681), 284 states have call predecessors, (681), 284 states have return successors, (681), 633 states have call predecessors, (681), 681 states have call successors, (681) [2021-11-19 04:25:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4828 states to 4828 states and 6069 transitions. [2021-11-19 04:25:34,798 INFO L78 Accepts]: Start accepts. Automaton has 4828 states and 6069 transitions. Word has length 361 [2021-11-19 04:25:34,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:25:34,799 INFO L470 AbstractCegarLoop]: Abstraction has 4828 states and 6069 transitions. [2021-11-19 04:25:34,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 4 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2021-11-19 04:25:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 4828 states and 6069 transitions. [2021-11-19 04:25:34,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2021-11-19 04:25:34,815 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:25:34,815 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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-11-19 04:25:34,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-19 04:25:34,816 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:25:34,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:25:34,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1734178564, now seen corresponding path program 1 times [2021-11-19 04:25:34,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:25:34,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618188231] [2021-11-19 04:25:34,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:25:34,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:25:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:25:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:25:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:25:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:25:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:25:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:25:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:25:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:25:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:25:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:25:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:25:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:25:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:25:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:25:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:25:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:25:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:25:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-19 04:25:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-19 04:25:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-11-19 04:25:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-11-19 04:25:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-11-19 04:25:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-11-19 04:25:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-11-19 04:25:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-11-19 04:25:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-11-19 04:25:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2021-11-19 04:25:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2021-11-19 04:25:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2021-11-19 04:25:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2021-11-19 04:25:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2021-11-19 04:25:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,326 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2021-11-19 04:25:35,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:25:35,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618188231] [2021-11-19 04:25:35,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618188231] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:25:35,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939021971] [2021-11-19 04:25:35,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:25:35,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:25:35,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:25:35,329 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:25:35,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-19 04:25:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:25:35,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-19 04:25:35,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:25:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 286 proven. 92 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2021-11-19 04:25:36,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 04:25:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 44 proven. 199 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2021-11-19 04:25:38,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939021971] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 04:25:38,108 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 04:25:38,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 18] total 41 [2021-11-19 04:25:38,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307638685] [2021-11-19 04:25:38,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 04:25:38,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-11-19 04:25:38,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:25:38,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-19 04:25:38,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1533, Unknown=0, NotChecked=0, Total=1640 [2021-11-19 04:25:38,113 INFO L87 Difference]: Start difference. First operand 4828 states and 6069 transitions. Second operand has 41 states, 40 states have (on average 7.7) internal successors, (308), 35 states have internal predecessors, (308), 12 states have call successors, (64), 10 states have call predecessors, (64), 12 states have return successors, (63), 13 states have call predecessors, (63), 11 states have call successors, (63) [2021-11-19 04:26:15,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:26:15,082 INFO L93 Difference]: Finished difference Result 51053 states and 69541 transitions. [2021-11-19 04:26:15,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 371 states. [2021-11-19 04:26:15,083 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 7.7) internal successors, (308), 35 states have internal predecessors, (308), 12 states have call successors, (64), 10 states have call predecessors, (64), 12 states have return successors, (63), 13 states have call predecessors, (63), 11 states have call successors, (63) Word has length 361 [2021-11-19 04:26:15,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:26:15,219 INFO L225 Difference]: With dead ends: 51053 [2021-11-19 04:26:15,219 INFO L226 Difference]: Without dead ends: 46743 [2021-11-19 04:26:15,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1179 GetRequests, 772 SyntacticMatches, 0 SemanticMatches, 407 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69568 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=12708, Invalid=154164, Unknown=0, NotChecked=0, Total=166872 [2021-11-19 04:26:15,252 INFO L933 BasicCegarLoop]: 1221 mSDtfsCounter, 4616 mSDsluCounter, 23620 mSDsCounter, 0 mSdLazyCounter, 25369 mSolverCounterSat, 2904 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4628 SdHoareTripleChecker+Valid, 24841 SdHoareTripleChecker+Invalid, 28273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2904 IncrementalHoareTripleChecker+Valid, 25369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2021-11-19 04:26:15,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4628 Valid, 24841 Invalid, 28273 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2904 Valid, 25369 Invalid, 0 Unknown, 0 Unchecked, 13.4s Time] [2021-11-19 04:26:15,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46743 states. [2021-11-19 04:26:16,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46743 to 6590. [2021-11-19 04:26:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6590 states, 5400 states have (on average 1.2092592592592593) internal successors, (6530), 5455 states have internal predecessors, (6530), 805 states have call successors, (805), 382 states have call predecessors, (805), 384 states have return successors, (809), 752 states have call predecessors, (809), 805 states have call successors, (809) [2021-11-19 04:26:16,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6590 states to 6590 states and 8144 transitions. [2021-11-19 04:26:16,748 INFO L78 Accepts]: Start accepts. Automaton has 6590 states and 8144 transitions. Word has length 361 [2021-11-19 04:26:16,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:26:16,748 INFO L470 AbstractCegarLoop]: Abstraction has 6590 states and 8144 transitions. [2021-11-19 04:26:16,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 7.7) internal successors, (308), 35 states have internal predecessors, (308), 12 states have call successors, (64), 10 states have call predecessors, (64), 12 states have return successors, (63), 13 states have call predecessors, (63), 11 states have call successors, (63) [2021-11-19 04:26:16,749 INFO L276 IsEmpty]: Start isEmpty. Operand 6590 states and 8144 transitions. [2021-11-19 04:26:16,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2021-11-19 04:26:16,770 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:26:16,771 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 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-11-19 04:26:16,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-11-19 04:26:16,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:26:16,985 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:26:16,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:26:16,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1157638044, now seen corresponding path program 1 times [2021-11-19 04:26:16,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:26:16,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848040459] [2021-11-19 04:26:16,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:26:16,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:26:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:26:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:26:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-19 04:26:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-19 04:26:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-19 04:26:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:26:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:26:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:26:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-19 04:26:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:26:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:26:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:26:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-19 04:26:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:26:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:26:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:26:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-11-19 04:26:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-11-19 04:26:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2021-11-19 04:26:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2021-11-19 04:26:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-11-19 04:26:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-11-19 04:26:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-11-19 04:26:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-11-19 04:26:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2021-11-19 04:26:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2021-11-19 04:26:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2021-11-19 04:26:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2021-11-19 04:26:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2021-11-19 04:26:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2021-11-19 04:26:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2021-11-19 04:26:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 9 proven. 136 refuted. 0 times theorem prover too weak. 798 trivial. 0 not checked. [2021-11-19 04:26:17,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:26:17,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848040459] [2021-11-19 04:26:17,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848040459] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:26:17,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016293672] [2021-11-19 04:26:17,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:26:17,175 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:26:17,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:26:17,176 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:26:17,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-19 04:26:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:17,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 04:26:17,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:26:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2021-11-19 04:26:18,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-19 04:26:18,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016293672] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:26:18,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-19 04:26:18,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2021-11-19 04:26:18,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253215299] [2021-11-19 04:26:18,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:26:18,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 04:26:18,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:26:18,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 04:26:18,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-19 04:26:18,323 INFO L87 Difference]: Start difference. First operand 6590 states and 8144 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-11-19 04:26:19,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:26:19,648 INFO L93 Difference]: Finished difference Result 12444 states and 15440 transitions. [2021-11-19 04:26:19,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:26:19,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 364 [2021-11-19 04:26:19,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:26:19,677 INFO L225 Difference]: With dead ends: 12444 [2021-11-19 04:26:19,677 INFO L226 Difference]: Without dead ends: 6653 [2021-11-19 04:26:19,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-19 04:26:19,694 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 303 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 04:26:19,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 428 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-19 04:26:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6653 states. [2021-11-19 04:26:20,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6653 to 6632. [2021-11-19 04:26:20,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6632 states, 5442 states have (on average 1.2050716648291069) internal successors, (6558), 5497 states have internal predecessors, (6558), 805 states have call successors, (805), 382 states have call predecessors, (805), 384 states have return successors, (809), 752 states have call predecessors, (809), 805 states have call successors, (809) [2021-11-19 04:26:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6632 states to 6632 states and 8172 transitions. [2021-11-19 04:26:20,920 INFO L78 Accepts]: Start accepts. Automaton has 6632 states and 8172 transitions. Word has length 364 [2021-11-19 04:26:20,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:26:20,922 INFO L470 AbstractCegarLoop]: Abstraction has 6632 states and 8172 transitions. [2021-11-19 04:26:20,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-11-19 04:26:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 6632 states and 8172 transitions. [2021-11-19 04:26:20,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2021-11-19 04:26:20,946 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:26:20,946 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 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] [2021-11-19 04:26:20,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-19 04:26:21,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:26:21,161 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:26:21,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:26:21,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1253418756, now seen corresponding path program 1 times [2021-11-19 04:26:21,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:26:21,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141317404] [2021-11-19 04:26:21,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:26:21,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:26:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:26:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:26:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-19 04:26:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-19 04:26:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-19 04:26:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:26:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:26:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:26:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-19 04:26:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:26:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:26:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:26:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-19 04:26:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:26:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:26:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:26:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-11-19 04:26:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2021-11-19 04:26:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2021-11-19 04:26:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-11-19 04:26:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-11-19 04:26:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-11-19 04:26:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-11-19 04:26:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-11-19 04:26:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-11-19 04:26:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2021-11-19 04:26:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-11-19 04:26:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2021-11-19 04:26:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-11-19 04:26:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-11-19 04:26:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2021-11-19 04:26:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 9 proven. 136 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2021-11-19 04:26:21,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:26:21,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141317404] [2021-11-19 04:26:21,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141317404] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:26:21,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297721873] [2021-11-19 04:26:21,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:26:21,373 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:26:21,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:26:21,374 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:26:21,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-19 04:26:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:21,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 04:26:21,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:26:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2021-11-19 04:26:22,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-19 04:26:22,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297721873] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:26:22,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-19 04:26:22,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-11-19 04:26:22,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163737753] [2021-11-19 04:26:22,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:26:22,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:26:22,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:26:22,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:26:22,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 04:26:22,294 INFO L87 Difference]: Start difference. First operand 6632 states and 8172 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-19 04:26:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:26:23,143 INFO L93 Difference]: Finished difference Result 12716 states and 15709 transitions. [2021-11-19 04:26:23,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 04:26:23,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 365 [2021-11-19 04:26:23,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:26:23,163 INFO L225 Difference]: With dead ends: 12716 [2021-11-19 04:26:23,164 INFO L226 Difference]: Without dead ends: 6085 [2021-11-19 04:26:23,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-19 04:26:23,177 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 28 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:26:23,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 673 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 04:26:23,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6085 states. [2021-11-19 04:26:24,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6085 to 6085. [2021-11-19 04:26:24,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6085 states, 4978 states have (on average 1.2089192446765769) internal successors, (6018), 5028 states have internal predecessors, (6018), 756 states have call successors, (756), 350 states have call predecessors, (756), 350 states have return successors, (756), 706 states have call predecessors, (756), 756 states have call successors, (756) [2021-11-19 04:26:24,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6085 states to 6085 states and 7530 transitions. [2021-11-19 04:26:24,280 INFO L78 Accepts]: Start accepts. Automaton has 6085 states and 7530 transitions. Word has length 365 [2021-11-19 04:26:24,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:26:24,281 INFO L470 AbstractCegarLoop]: Abstraction has 6085 states and 7530 transitions. [2021-11-19 04:26:24,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-19 04:26:24,281 INFO L276 IsEmpty]: Start isEmpty. Operand 6085 states and 7530 transitions. [2021-11-19 04:26:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2021-11-19 04:26:24,301 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:26:24,301 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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] [2021-11-19 04:26:24,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-11-19 04:26:24,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-11-19 04:26:24,502 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:26:24,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:26:24,503 INFO L85 PathProgramCache]: Analyzing trace with hash -867693373, now seen corresponding path program 1 times [2021-11-19 04:26:24,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:26:24,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347401618] [2021-11-19 04:26:24,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:26:24,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:26:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:26:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:26:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:26:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:26:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:26:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:26:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:26:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:26:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:26:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:26:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:26:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:26:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:26:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:26:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:26:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:26:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:26:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-11-19 04:26:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-11-19 04:26:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-11-19 04:26:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-11-19 04:26:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-11-19 04:26:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-11-19 04:26:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-11-19 04:26:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-11-19 04:26:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-11-19 04:26:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-11-19 04:26:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2021-11-19 04:26:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2021-11-19 04:26:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2021-11-19 04:26:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2021-11-19 04:26:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2021-11-19 04:26:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2021-11-19 04:26:24,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:26:24,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347401618] [2021-11-19 04:26:24,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347401618] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:26:24,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821435482] [2021-11-19 04:26:24,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:26:24,924 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:26:24,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:26:24,926 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:26:24,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-19 04:26:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:26:25,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 1331 conjuncts, 64 conjunts are in the unsatisfiable core [2021-11-19 04:26:25,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:26:27,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 482 proven. 210 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2021-11-19 04:26:27,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 04:26:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 112 proven. 194 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2021-11-19 04:26:29,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821435482] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 04:26:29,526 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 04:26:29,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26, 21] total 55 [2021-11-19 04:26:29,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976406116] [2021-11-19 04:26:29,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 04:26:29,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-11-19 04:26:29,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:26:29,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-11-19 04:26:29,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2761, Unknown=0, NotChecked=0, Total=2970 [2021-11-19 04:26:29,531 INFO L87 Difference]: Start difference. First operand 6085 states and 7530 transitions. Second operand has 55 states, 55 states have (on average 7.218181818181818) internal successors, (397), 47 states have internal predecessors, (397), 17 states have call successors, (68), 13 states have call predecessors, (68), 19 states have return successors, (71), 22 states have call predecessors, (71), 17 states have call successors, (71) [2021-11-19 04:27:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:27:18,119 INFO L93 Difference]: Finished difference Result 49444 states and 67208 transitions. [2021-11-19 04:27:18,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 371 states. [2021-11-19 04:27:18,121 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 7.218181818181818) internal successors, (397), 47 states have internal predecessors, (397), 17 states have call successors, (68), 13 states have call predecessors, (68), 19 states have return successors, (71), 22 states have call predecessors, (71), 17 states have call successors, (71) Word has length 372 [2021-11-19 04:27:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:27:18,196 INFO L225 Difference]: With dead ends: 49444 [2021-11-19 04:27:18,196 INFO L226 Difference]: Without dead ends: 43970 [2021-11-19 04:27:18,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1208 GetRequests, 788 SyntacticMatches, 0 SemanticMatches, 420 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70208 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=10011, Invalid=167651, Unknown=0, NotChecked=0, Total=177662 [2021-11-19 04:27:18,227 INFO L933 BasicCegarLoop]: 2196 mSDtfsCounter, 3988 mSDsluCounter, 52968 mSDsCounter, 0 mSdLazyCounter, 44628 mSolverCounterSat, 3508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4016 SdHoareTripleChecker+Valid, 55164 SdHoareTripleChecker+Invalid, 48136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 3508 IncrementalHoareTripleChecker+Valid, 44628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2021-11-19 04:27:18,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4016 Valid, 55164 Invalid, 48136 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [3508 Valid, 44628 Invalid, 0 Unknown, 0 Unchecked, 25.2s Time] [2021-11-19 04:27:18,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43970 states. [2021-11-19 04:27:19,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43970 to 6103. [2021-11-19 04:27:19,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6103 states, 4995 states have (on average 1.2084084084084084) internal successors, (6036), 5045 states have internal predecessors, (6036), 756 states have call successors, (756), 351 states have call predecessors, (756), 351 states have return successors, (756), 706 states have call predecessors, (756), 756 states have call successors, (756) [2021-11-19 04:27:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6103 states to 6103 states and 7548 transitions. [2021-11-19 04:27:19,703 INFO L78 Accepts]: Start accepts. Automaton has 6103 states and 7548 transitions. Word has length 372 [2021-11-19 04:27:19,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:27:19,704 INFO L470 AbstractCegarLoop]: Abstraction has 6103 states and 7548 transitions. [2021-11-19 04:27:19,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 7.218181818181818) internal successors, (397), 47 states have internal predecessors, (397), 17 states have call successors, (68), 13 states have call predecessors, (68), 19 states have return successors, (71), 22 states have call predecessors, (71), 17 states have call successors, (71) [2021-11-19 04:27:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand 6103 states and 7548 transitions. [2021-11-19 04:27:19,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2021-11-19 04:27:19,715 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:27:19,716 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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-11-19 04:27:19,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-19 04:27:19,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-11-19 04:27:19,941 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:27:19,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:27:19,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1702339438, now seen corresponding path program 1 times [2021-11-19 04:27:19,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:27:19,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030830166] [2021-11-19 04:27:19,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:27:19,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:27:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:27:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:27:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:27:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:27:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:27:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:27:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:27:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:27:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:27:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:27:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:27:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:27:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:27:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:27:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:27:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:27:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:27:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-11-19 04:27:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-11-19 04:27:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-11-19 04:27:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-11-19 04:27:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-11-19 04:27:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-11-19 04:27:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-11-19 04:27:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-11-19 04:27:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-11-19 04:27:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-11-19 04:27:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-11-19 04:27:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-11-19 04:27:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-11-19 04:27:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-11-19 04:27:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2021-11-19 04:27:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-11-19 04:27:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:20,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2021-11-19 04:27:20,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:27:20,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030830166] [2021-11-19 04:27:20,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030830166] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:27:20,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:27:20,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-19 04:27:20,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64917157] [2021-11-19 04:27:20,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:27:20,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 04:27:20,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:27:20,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 04:27:20,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-19 04:27:20,169 INFO L87 Difference]: Start difference. First operand 6103 states and 7548 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 5 states have internal predecessors, (117), 4 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2021-11-19 04:27:21,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:27:21,297 INFO L93 Difference]: Finished difference Result 11684 states and 14501 transitions. [2021-11-19 04:27:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-19 04:27:21,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 5 states have internal predecessors, (117), 4 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 383 [2021-11-19 04:27:21,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:27:21,310 INFO L225 Difference]: With dead ends: 11684 [2021-11-19 04:27:21,310 INFO L226 Difference]: Without dead ends: 6109 [2021-11-19 04:27:21,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-19 04:27:21,318 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 359 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-19 04:27:21,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 513 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-19 04:27:21,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6109 states. [2021-11-19 04:27:22,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6109 to 6091. [2021-11-19 04:27:22,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6091 states, 4983 states have (on average 1.2077062010836845) internal successors, (6018), 5033 states have internal predecessors, (6018), 756 states have call successors, (756), 351 states have call predecessors, (756), 351 states have return successors, (756), 706 states have call predecessors, (756), 756 states have call successors, (756) [2021-11-19 04:27:22,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6091 states to 6091 states and 7530 transitions. [2021-11-19 04:27:22,306 INFO L78 Accepts]: Start accepts. Automaton has 6091 states and 7530 transitions. Word has length 383 [2021-11-19 04:27:22,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:27:22,307 INFO L470 AbstractCegarLoop]: Abstraction has 6091 states and 7530 transitions. [2021-11-19 04:27:22,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 5 states have internal predecessors, (117), 4 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2021-11-19 04:27:22,307 INFO L276 IsEmpty]: Start isEmpty. Operand 6091 states and 7530 transitions. [2021-11-19 04:27:22,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2021-11-19 04:27:22,313 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:27:22,314 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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] [2021-11-19 04:27:22,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-19 04:27:22,314 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:27:22,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:27:22,315 INFO L85 PathProgramCache]: Analyzing trace with hash 20866322, now seen corresponding path program 1 times [2021-11-19 04:27:22,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:27:22,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007447227] [2021-11-19 04:27:22,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:27:22,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:27:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:27:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:27:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:27:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:27:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:27:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:27:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:27:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:27:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:27:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:27:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:27:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:27:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:27:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:27:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:27:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:27:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:27:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-11-19 04:27:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-11-19 04:27:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-11-19 04:27:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-11-19 04:27:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-11-19 04:27:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-11-19 04:27:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-11-19 04:27:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-11-19 04:27:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-11-19 04:27:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-11-19 04:27:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-11-19 04:27:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-11-19 04:27:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-11-19 04:27:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-11-19 04:27:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2021-11-19 04:27:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-11-19 04:27:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:22,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2021-11-19 04:27:22,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:27:22,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007447227] [2021-11-19 04:27:22,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007447227] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:27:22,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:27:22,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 04:27:22,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465999214] [2021-11-19 04:27:22,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:27:22,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:27:22,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:27:22,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:27:22,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:27:22,490 INFO L87 Difference]: Start difference. First operand 6091 states and 7530 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-19 04:27:23,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:27:23,311 INFO L93 Difference]: Finished difference Result 8872 states and 10981 transitions. [2021-11-19 04:27:23,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 04:27:23,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 383 [2021-11-19 04:27:23,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:27:23,320 INFO L225 Difference]: With dead ends: 8872 [2021-11-19 04:27:23,320 INFO L226 Difference]: Without dead ends: 3302 [2021-11-19 04:27:23,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:27:23,329 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 51 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 04:27:23,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 563 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 04:27:23,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2021-11-19 04:27:23,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 3302. [2021-11-19 04:27:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3302 states, 2711 states have (on average 1.1940243452600516) internal successors, (3237), 2738 states have internal predecessors, (3237), 401 states have call successors, (401), 189 states have call predecessors, (401), 189 states have return successors, (401), 374 states have call predecessors, (401), 401 states have call successors, (401) [2021-11-19 04:27:23,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 4039 transitions. [2021-11-19 04:27:23,785 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 4039 transitions. Word has length 383 [2021-11-19 04:27:23,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:27:23,785 INFO L470 AbstractCegarLoop]: Abstraction has 3302 states and 4039 transitions. [2021-11-19 04:27:23,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-19 04:27:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 4039 transitions. [2021-11-19 04:27:23,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2021-11-19 04:27:23,789 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:27:23,789 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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] [2021-11-19 04:27:23,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-19 04:27:23,789 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:27:23,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:27:23,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1998056988, now seen corresponding path program 1 times [2021-11-19 04:27:23,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:27:23,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843308407] [2021-11-19 04:27:23,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:27:23,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:27:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:23,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:27:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:23,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:27:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:23,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:27:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:23,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:27:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:23,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:27:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:23,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:27:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:23,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:27:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:27:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:27:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:27:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:27:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:27:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:27:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:27:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:27:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:27:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:27:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-19 04:27:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-19 04:27:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-11-19 04:27:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-11-19 04:27:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-11-19 04:27:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-11-19 04:27:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-11-19 04:27:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-11-19 04:27:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-11-19 04:27:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-11-19 04:27:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-11-19 04:27:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-11-19 04:27:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-11-19 04:27:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2021-11-19 04:27:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2021-11-19 04:27:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2021-11-19 04:27:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 52 proven. 51 refuted. 0 times theorem prover too weak. 962 trivial. 0 not checked. [2021-11-19 04:27:24,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:27:24,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843308407] [2021-11-19 04:27:24,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843308407] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:27:24,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285593586] [2021-11-19 04:27:24,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:27:24,166 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:27:24,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:27:24,167 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:27:24,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-19 04:27:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:24,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-19 04:27:24,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:27:25,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 542 proven. 221 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-11-19 04:27:25,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 04:27:27,399 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-11-19 04:27:27,399 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-19 04:27:27,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-11-19 04:27:27,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167643124] [2021-11-19 04:27:27,399 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-19 04:27:27,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-19 04:27:27,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:27:27,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-19 04:27:27,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2366, Unknown=0, NotChecked=0, Total=2550 [2021-11-19 04:27:27,400 INFO L87 Difference]: Start difference. First operand 3302 states and 4039 transitions. Second operand has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 12 states have internal predecessors, (154), 5 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 6 states have call predecessors, (25), 4 states have call successors, (25) [2021-11-19 04:27:32,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:27:32,286 INFO L93 Difference]: Finished difference Result 15059 states and 18818 transitions. [2021-11-19 04:27:32,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-19 04:27:32,287 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 12 states have internal predecessors, (154), 5 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 6 states have call predecessors, (25), 4 states have call successors, (25) Word has length 383 [2021-11-19 04:27:32,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:27:32,307 INFO L225 Difference]: With dead ends: 15059 [2021-11-19 04:27:32,308 INFO L226 Difference]: Without dead ends: 12281 [2021-11-19 04:27:32,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 717 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=652, Invalid=7180, Unknown=0, NotChecked=0, Total=7832 [2021-11-19 04:27:32,314 INFO L933 BasicCegarLoop]: 449 mSDtfsCounter, 1239 mSDsluCounter, 3429 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 3878 SdHoareTripleChecker+Invalid, 2736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-19 04:27:32,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1274 Valid, 3878 Invalid, 2736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-19 04:27:32,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12281 states. [2021-11-19 04:27:33,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12281 to 4730. [2021-11-19 04:27:33,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4730 states, 3820 states have (on average 1.193717277486911) internal successors, (4560), 3864 states have internal predecessors, (4560), 623 states have call successors, (623), 286 states have call predecessors, (623), 286 states have return successors, (623), 579 states have call predecessors, (623), 623 states have call successors, (623) [2021-11-19 04:27:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4730 states to 4730 states and 5806 transitions. [2021-11-19 04:27:33,035 INFO L78 Accepts]: Start accepts. Automaton has 4730 states and 5806 transitions. Word has length 383 [2021-11-19 04:27:33,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:27:33,035 INFO L470 AbstractCegarLoop]: Abstraction has 4730 states and 5806 transitions. [2021-11-19 04:27:33,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 12 states have internal predecessors, (154), 5 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 6 states have call predecessors, (25), 4 states have call successors, (25) [2021-11-19 04:27:33,035 INFO L276 IsEmpty]: Start isEmpty. Operand 4730 states and 5806 transitions. [2021-11-19 04:27:33,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2021-11-19 04:27:33,041 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:27:33,042 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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] [2021-11-19 04:27:33,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-19 04:27:33,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:27:33,242 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:27:33,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:27:33,243 INFO L85 PathProgramCache]: Analyzing trace with hash -103486524, now seen corresponding path program 1 times [2021-11-19 04:27:33,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:27:33,243 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068710469] [2021-11-19 04:27:33,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:27:33,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:27:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:27:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:27:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:27:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:27:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:27:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:27:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:27:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:27:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:27:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:27:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:27:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:27:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:27:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:27:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:27:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:27:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:27:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-19 04:27:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-19 04:27:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-11-19 04:27:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-11-19 04:27:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-11-19 04:27:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-11-19 04:27:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-11-19 04:27:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-11-19 04:27:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-11-19 04:27:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-11-19 04:27:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-11-19 04:27:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-11-19 04:27:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-11-19 04:27:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-11-19 04:27:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2021-11-19 04:27:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-11-19 04:27:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 36 proven. 66 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2021-11-19 04:27:33,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:27:33,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068710469] [2021-11-19 04:27:33,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068710469] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:27:33,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533428869] [2021-11-19 04:27:33,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:27:33,596 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:27:33,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:27:33,601 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:27:33,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-19 04:27:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:33,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-19 04:27:33,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:27:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 545 proven. 221 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-11-19 04:27:35,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 04:27:36,563 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-11-19 04:27:36,563 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-19 04:27:36,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-11-19 04:27:36,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677823921] [2021-11-19 04:27:36,564 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-19 04:27:36,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-19 04:27:36,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:27:36,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-19 04:27:36,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2345, Unknown=0, NotChecked=0, Total=2550 [2021-11-19 04:27:36,565 INFO L87 Difference]: Start difference. First operand 4730 states and 5806 transitions. Second operand has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 12 states have internal predecessors, (151), 5 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 7 states have call predecessors, (25), 5 states have call successors, (25) [2021-11-19 04:27:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:27:39,656 INFO L93 Difference]: Finished difference Result 9021 states and 11127 transitions. [2021-11-19 04:27:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-19 04:27:39,656 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 12 states have internal predecessors, (151), 5 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 7 states have call predecessors, (25), 5 states have call successors, (25) Word has length 383 [2021-11-19 04:27:39,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:27:39,665 INFO L225 Difference]: With dead ends: 9021 [2021-11-19 04:27:39,665 INFO L226 Difference]: Without dead ends: 4878 [2021-11-19 04:27:39,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 698 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1543 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=798, Invalid=6512, Unknown=0, NotChecked=0, Total=7310 [2021-11-19 04:27:39,671 INFO L933 BasicCegarLoop]: 640 mSDtfsCounter, 825 mSDsluCounter, 4294 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 4934 SdHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 2181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-19 04:27:39,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [855 Valid, 4934 Invalid, 2414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 2181 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-19 04:27:39,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2021-11-19 04:27:40,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 3651. [2021-11-19 04:27:40,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3651 states, 2981 states have (on average 1.1912110030191212) internal successors, (3551), 3013 states have internal predecessors, (3551), 443 states have call successors, (443), 226 states have call predecessors, (443), 226 states have return successors, (443), 411 states have call predecessors, (443), 443 states have call successors, (443) [2021-11-19 04:27:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 4437 transitions. [2021-11-19 04:27:40,251 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 4437 transitions. Word has length 383 [2021-11-19 04:27:40,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:27:40,252 INFO L470 AbstractCegarLoop]: Abstraction has 3651 states and 4437 transitions. [2021-11-19 04:27:40,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 12 states have internal predecessors, (151), 5 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 7 states have call predecessors, (25), 5 states have call successors, (25) [2021-11-19 04:27:40,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 4437 transitions. [2021-11-19 04:27:40,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2021-11-19 04:27:40,257 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:27:40,257 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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] [2021-11-19 04:27:40,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-19 04:27:40,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-11-19 04:27:40,458 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:27:40,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:27:40,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1809377308, now seen corresponding path program 1 times [2021-11-19 04:27:40,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:27:40,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720051905] [2021-11-19 04:27:40,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:27:40,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:27:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:27:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:27:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:27:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:27:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:27:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:27:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:27:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:27:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:27:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:27:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:27:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:27:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:27:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:27:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:27:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:27:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:27:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-19 04:27:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-11-19 04:27:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-11-19 04:27:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-11-19 04:27:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-11-19 04:27:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-11-19 04:27:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-11-19 04:27:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-11-19 04:27:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-11-19 04:27:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-11-19 04:27:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-11-19 04:27:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-11-19 04:27:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-11-19 04:27:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2021-11-19 04:27:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2021-11-19 04:27:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2021-11-19 04:27:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:40,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2021-11-19 04:27:40,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:27:40,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720051905] [2021-11-19 04:27:40,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720051905] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:27:40,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082375935] [2021-11-19 04:27:40,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:27:40,852 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:27:40,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:27:40,857 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:27:40,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-19 04:27:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:41,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-19 04:27:41,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:27:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 542 proven. 221 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-11-19 04:27:42,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 04:27:44,074 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-11-19 04:27:44,074 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-19 04:27:44,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-11-19 04:27:44,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438030765] [2021-11-19 04:27:44,074 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-19 04:27:44,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-19 04:27:44,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:27:44,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-19 04:27:44,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2569, Unknown=0, NotChecked=0, Total=2756 [2021-11-19 04:27:44,075 INFO L87 Difference]: Start difference. First operand 3651 states and 4437 transitions. Second operand has 17 states, 17 states have (on average 8.294117647058824) internal successors, (141), 15 states have internal predecessors, (141), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 8 states have call predecessors, (25), 7 states have call successors, (25) [2021-11-19 04:27:52,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:27:52,428 INFO L93 Difference]: Finished difference Result 16024 states and 20339 transitions. [2021-11-19 04:27:52,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-11-19 04:27:52,429 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.294117647058824) internal successors, (141), 15 states have internal predecessors, (141), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 8 states have call predecessors, (25), 7 states have call successors, (25) Word has length 383 [2021-11-19 04:27:52,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:27:52,455 INFO L225 Difference]: With dead ends: 16024 [2021-11-19 04:27:52,456 INFO L226 Difference]: Without dead ends: 12960 [2021-11-19 04:27:52,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 703 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3767 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1591, Invalid=14921, Unknown=0, NotChecked=0, Total=16512 [2021-11-19 04:27:52,464 INFO L933 BasicCegarLoop]: 930 mSDtfsCounter, 1371 mSDsluCounter, 5894 mSDsCounter, 0 mSdLazyCounter, 6061 mSolverCounterSat, 649 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1386 SdHoareTripleChecker+Valid, 6824 SdHoareTripleChecker+Invalid, 6710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 649 IncrementalHoareTripleChecker+Valid, 6061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-19 04:27:52,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1386 Valid, 6824 Invalid, 6710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [649 Valid, 6061 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-11-19 04:27:52,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12960 states. [2021-11-19 04:27:53,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12960 to 3651. [2021-11-19 04:27:53,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3651 states, 2981 states have (on average 1.1912110030191212) internal successors, (3551), 3013 states have internal predecessors, (3551), 443 states have call successors, (443), 226 states have call predecessors, (443), 226 states have return successors, (443), 411 states have call predecessors, (443), 443 states have call successors, (443) [2021-11-19 04:27:53,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 4437 transitions. [2021-11-19 04:27:53,146 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 4437 transitions. Word has length 383 [2021-11-19 04:27:53,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:27:53,147 INFO L470 AbstractCegarLoop]: Abstraction has 3651 states and 4437 transitions. [2021-11-19 04:27:53,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.294117647058824) internal successors, (141), 15 states have internal predecessors, (141), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 8 states have call predecessors, (25), 7 states have call successors, (25) [2021-11-19 04:27:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 4437 transitions. [2021-11-19 04:27:53,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2021-11-19 04:27:53,152 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:27:53,152 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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-11-19 04:27:53,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-19 04:27:53,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:27:53,365 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:27:53,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:27:53,365 INFO L85 PathProgramCache]: Analyzing trace with hash 872240243, now seen corresponding path program 1 times [2021-11-19 04:27:53,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:27:53,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616800160] [2021-11-19 04:27:53,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:27:53,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:27:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:27:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:27:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:27:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:27:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:27:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:27:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:27:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:27:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:27:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:27:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:27:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:27:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:27:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:27:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:27:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:27:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:27:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-19 04:27:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-11-19 04:27:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-11-19 04:27:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-11-19 04:27:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-11-19 04:27:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-11-19 04:27:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-11-19 04:27:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-11-19 04:27:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2021-11-19 04:27:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2021-11-19 04:27:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-11-19 04:27:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-11-19 04:27:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-11-19 04:27:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-11-19 04:27:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2021-11-19 04:27:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-11-19 04:27:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2021-11-19 04:27:53,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:27:53,758 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616800160] [2021-11-19 04:27:53,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616800160] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:27:53,758 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231919046] [2021-11-19 04:27:53,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:27:53,759 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:27:53,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:27:53,761 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:27:53,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-19 04:27:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:27:53,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-19 04:27:53,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:27:55,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 542 proven. 221 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-11-19 04:27:55,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 04:27:56,861 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-11-19 04:27:56,862 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-19 04:27:56,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-11-19 04:27:56,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524599409] [2021-11-19 04:27:56,862 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-19 04:27:56,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-19 04:27:56,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:27:56,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-19 04:27:56,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2569, Unknown=0, NotChecked=0, Total=2756 [2021-11-19 04:27:56,864 INFO L87 Difference]: Start difference. First operand 3651 states and 4437 transitions. Second operand has 17 states, 17 states have (on average 8.352941176470589) internal successors, (142), 15 states have internal predecessors, (142), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 8 states have call predecessors, (25), 7 states have call successors, (25) [2021-11-19 04:28:05,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:28:05,951 INFO L93 Difference]: Finished difference Result 15966 states and 20281 transitions. [2021-11-19 04:28:05,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-11-19 04:28:05,951 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.352941176470589) internal successors, (142), 15 states have internal predecessors, (142), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 8 states have call predecessors, (25), 7 states have call successors, (25) Word has length 384 [2021-11-19 04:28:05,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:28:05,969 INFO L225 Difference]: With dead ends: 15966 [2021-11-19 04:28:05,970 INFO L226 Difference]: Without dead ends: 12902 [2021-11-19 04:28:05,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 832 GetRequests, 705 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3766 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1591, Invalid=14921, Unknown=0, NotChecked=0, Total=16512 [2021-11-19 04:28:05,975 INFO L933 BasicCegarLoop]: 930 mSDtfsCounter, 1370 mSDsluCounter, 5894 mSDsCounter, 0 mSdLazyCounter, 6061 mSolverCounterSat, 698 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 6824 SdHoareTripleChecker+Invalid, 6759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 698 IncrementalHoareTripleChecker+Valid, 6061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-11-19 04:28:05,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1385 Valid, 6824 Invalid, 6759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [698 Valid, 6061 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-11-19 04:28:05,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12902 states. [2021-11-19 04:28:06,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12902 to 3641. [2021-11-19 04:28:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3641 states, 2971 states have (on average 1.1918545944126557) internal successors, (3541), 3003 states have internal predecessors, (3541), 443 states have call successors, (443), 226 states have call predecessors, (443), 226 states have return successors, (443), 411 states have call predecessors, (443), 443 states have call successors, (443) [2021-11-19 04:28:06,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 4427 transitions. [2021-11-19 04:28:06,667 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 4427 transitions. Word has length 384 [2021-11-19 04:28:06,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:28:06,668 INFO L470 AbstractCegarLoop]: Abstraction has 3641 states and 4427 transitions. [2021-11-19 04:28:06,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.352941176470589) internal successors, (142), 15 states have internal predecessors, (142), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 8 states have call predecessors, (25), 7 states have call successors, (25) [2021-11-19 04:28:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 4427 transitions. [2021-11-19 04:28:06,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2021-11-19 04:28:06,675 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:28:06,676 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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-11-19 04:28:06,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-19 04:28:06,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:28:06,889 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:28:06,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:28:06,889 INFO L85 PathProgramCache]: Analyzing trace with hash 962300533, now seen corresponding path program 1 times [2021-11-19 04:28:06,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:28:06,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055657173] [2021-11-19 04:28:06,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:28:06,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:28:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:06,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:28:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:06,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:28:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:06,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:28:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:06,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:28:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:06,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:28:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:06,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:28:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:06,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:28:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:06,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:28:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:06,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:28:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:06,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:28:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:06,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:28:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:06,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:28:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:06,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:28:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:06,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:28:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:06,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:28:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:06,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:28:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:07,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:28:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:07,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-19 04:28:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:07,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-11-19 04:28:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:07,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-11-19 04:28:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:07,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-11-19 04:28:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:07,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-11-19 04:28:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:07,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-11-19 04:28:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:07,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-11-19 04:28:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:07,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-11-19 04:28:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:07,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2021-11-19 04:28:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:07,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2021-11-19 04:28:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:07,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-11-19 04:28:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:07,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-11-19 04:28:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:07,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-11-19 04:28:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:07,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-11-19 04:28:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:07,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2021-11-19 04:28:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:07,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-11-19 04:28:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [2021-11-19 04:28:07,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:28:07,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055657173] [2021-11-19 04:28:07,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055657173] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:28:07,056 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:28:07,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 04:28:07,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731815776] [2021-11-19 04:28:07,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:28:07,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:28:07,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:28:07,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:28:07,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:28:07,058 INFO L87 Difference]: Start difference. First operand 3641 states and 4427 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-19 04:28:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:28:07,669 INFO L93 Difference]: Finished difference Result 5769 states and 7045 transitions. [2021-11-19 04:28:07,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 04:28:07,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 384 [2021-11-19 04:28:07,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:28:07,674 INFO L225 Difference]: With dead ends: 5769 [2021-11-19 04:28:07,674 INFO L226 Difference]: Without dead ends: 2454 [2021-11-19 04:28:07,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:28:07,679 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 51 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 04:28:07,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 551 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 04:28:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2021-11-19 04:28:08,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2454. [2021-11-19 04:28:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2454 states, 1994 states have (on average 1.1840521564694082) internal successors, (2361), 2015 states have internal predecessors, (2361), 307 states have call successors, (307), 152 states have call predecessors, (307), 152 states have return successors, (307), 286 states have call predecessors, (307), 307 states have call successors, (307) [2021-11-19 04:28:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2454 states to 2454 states and 2975 transitions. [2021-11-19 04:28:08,159 INFO L78 Accepts]: Start accepts. Automaton has 2454 states and 2975 transitions. Word has length 384 [2021-11-19 04:28:08,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:28:08,159 INFO L470 AbstractCegarLoop]: Abstraction has 2454 states and 2975 transitions. [2021-11-19 04:28:08,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-19 04:28:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 2975 transitions. [2021-11-19 04:28:08,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2021-11-19 04:28:08,165 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:28:08,166 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 10, 9, 8, 8, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 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-11-19 04:28:08,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-11-19 04:28:08,166 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:28:08,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:28:08,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1519421243, now seen corresponding path program 1 times [2021-11-19 04:28:08,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:28:08,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126278966] [2021-11-19 04:28:08,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:28:08,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:28:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:28:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:28:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:28:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:28:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:28:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:28:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:28:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:28:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:28:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:28:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:28:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:28:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:28:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:28:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:28:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:28:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:28:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-19 04:28:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-19 04:28:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-11-19 04:28:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-11-19 04:28:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-11-19 04:28:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2021-11-19 04:28:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-11-19 04:28:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2021-11-19 04:28:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-11-19 04:28:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-11-19 04:28:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2021-11-19 04:28:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-11-19 04:28:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-11-19 04:28:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-11-19 04:28:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2021-11-19 04:28:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2021-11-19 04:28:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-11-19 04:28:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 1023 trivial. 0 not checked. [2021-11-19 04:28:08,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:28:08,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126278966] [2021-11-19 04:28:08,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126278966] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:28:08,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771447877] [2021-11-19 04:28:08,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:28:08,361 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:28:08,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:28:08,365 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:28:08,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-19 04:28:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:08,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-19 04:28:08,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:28:09,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 127 proven. 307 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2021-11-19 04:28:09,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 04:28:10,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2021-11-19 04:28:10,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771447877] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 04:28:10,115 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 04:28:10,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 20 [2021-11-19 04:28:10,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602756167] [2021-11-19 04:28:10,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 04:28:10,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-19 04:28:10,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:28:10,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-19 04:28:10,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2021-11-19 04:28:10,117 INFO L87 Difference]: Start difference. First operand 2454 states and 2975 transitions. Second operand has 20 states, 20 states have (on average 15.3) internal successors, (306), 17 states have internal predecessors, (306), 7 states have call successors, (70), 7 states have call predecessors, (70), 9 states have return successors, (69), 9 states have call predecessors, (69), 7 states have call successors, (69) [2021-11-19 04:28:18,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:28:18,540 INFO L93 Difference]: Finished difference Result 12366 states and 15752 transitions. [2021-11-19 04:28:18,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2021-11-19 04:28:18,541 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 15.3) internal successors, (306), 17 states have internal predecessors, (306), 7 states have call successors, (70), 7 states have call predecessors, (70), 9 states have return successors, (69), 9 states have call predecessors, (69), 7 states have call successors, (69) Word has length 389 [2021-11-19 04:28:18,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:28:18,558 INFO L225 Difference]: With dead ends: 12366 [2021-11-19 04:28:18,558 INFO L226 Difference]: Without dead ends: 10378 [2021-11-19 04:28:18,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 994 GetRequests, 881 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4336 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1160, Invalid=11722, Unknown=0, NotChecked=0, Total=12882 [2021-11-19 04:28:18,564 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 2989 mSDsluCounter, 7297 mSDsCounter, 0 mSdLazyCounter, 5645 mSolverCounterSat, 1097 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3000 SdHoareTripleChecker+Valid, 7889 SdHoareTripleChecker+Invalid, 6742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1097 IncrementalHoareTripleChecker+Valid, 5645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-11-19 04:28:18,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3000 Valid, 7889 Invalid, 6742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1097 Valid, 5645 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-11-19 04:28:18,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2021-11-19 04:28:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 4023. [2021-11-19 04:28:19,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4023 states, 3302 states have (on average 1.1783767413688673) internal successors, (3891), 3332 states have internal predecessors, (3891), 469 states have call successors, (469), 251 states have call predecessors, (469), 251 states have return successors, (469), 439 states have call predecessors, (469), 469 states have call successors, (469) [2021-11-19 04:28:19,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4023 states to 4023 states and 4829 transitions. [2021-11-19 04:28:19,693 INFO L78 Accepts]: Start accepts. Automaton has 4023 states and 4829 transitions. Word has length 389 [2021-11-19 04:28:19,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:28:19,694 INFO L470 AbstractCegarLoop]: Abstraction has 4023 states and 4829 transitions. [2021-11-19 04:28:19,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 15.3) internal successors, (306), 17 states have internal predecessors, (306), 7 states have call successors, (70), 7 states have call predecessors, (70), 9 states have return successors, (69), 9 states have call predecessors, (69), 7 states have call successors, (69) [2021-11-19 04:28:19,694 INFO L276 IsEmpty]: Start isEmpty. Operand 4023 states and 4829 transitions. [2021-11-19 04:28:19,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2021-11-19 04:28:19,698 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:28:19,699 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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, 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] [2021-11-19 04:28:19,725 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-19 04:28:19,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2021-11-19 04:28:19,900 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:28:19,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:28:19,900 INFO L85 PathProgramCache]: Analyzing trace with hash 49162586, now seen corresponding path program 1 times [2021-11-19 04:28:19,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:28:19,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428463875] [2021-11-19 04:28:19,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:28:19,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:28:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:19,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:28:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:28:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:28:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:28:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:28:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:28:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:28:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:28:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:28:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:28:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:28:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:28:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:28:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:28:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:28:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:28:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:28:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-19 04:28:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-19 04:28:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-19 04:28:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-19 04:28:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-11-19 04:28:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-11-19 04:28:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-11-19 04:28:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2021-11-19 04:28:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-11-19 04:28:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2021-11-19 04:28:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2021-11-19 04:28:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2021-11-19 04:28:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2021-11-19 04:28:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2021-11-19 04:28:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2021-11-19 04:28:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-11-19 04:28:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2021-11-19 04:28:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 1086 trivial. 0 not checked. [2021-11-19 04:28:20,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:28:20,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428463875] [2021-11-19 04:28:20,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428463875] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:28:20,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41452177] [2021-11-19 04:28:20,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:28:20,134 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:28:20,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:28:20,135 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:28:20,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-19 04:28:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:20,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-19 04:28:20,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:28:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 283 proven. 5 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2021-11-19 04:28:20,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 04:28:21,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2021-11-19 04:28:21,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41452177] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 04:28:21,587 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 04:28:21,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 21 [2021-11-19 04:28:21,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573254062] [2021-11-19 04:28:21,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 04:28:21,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-19 04:28:21,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:28:21,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-19 04:28:21,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2021-11-19 04:28:21,589 INFO L87 Difference]: Start difference. First operand 4023 states and 4829 transitions. Second operand has 21 states, 21 states have (on average 8.428571428571429) internal successors, (177), 16 states have internal predecessors, (177), 5 states have call successors, (38), 5 states have call predecessors, (38), 8 states have return successors, (34), 8 states have call predecessors, (34), 5 states have call successors, (34) [2021-11-19 04:28:25,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:28:25,503 INFO L93 Difference]: Finished difference Result 10784 states and 13317 transitions. [2021-11-19 04:28:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-19 04:28:25,504 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.428571428571429) internal successors, (177), 16 states have internal predecessors, (177), 5 states have call successors, (38), 5 states have call predecessors, (38), 8 states have return successors, (34), 8 states have call predecessors, (34), 5 states have call successors, (34) Word has length 392 [2021-11-19 04:28:25,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:28:25,515 INFO L225 Difference]: With dead ends: 10784 [2021-11-19 04:28:25,515 INFO L226 Difference]: Without dead ends: 7158 [2021-11-19 04:28:25,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 848 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=1619, Unknown=0, NotChecked=0, Total=1892 [2021-11-19 04:28:25,520 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 1741 mSDsluCounter, 4054 mSDsCounter, 0 mSdLazyCounter, 3153 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 4483 SdHoareTripleChecker+Invalid, 3672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 3153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-19 04:28:25,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1756 Valid, 4483 Invalid, 3672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 3153 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-19 04:28:25,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7158 states. [2021-11-19 04:28:26,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7158 to 3855. [2021-11-19 04:28:26,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3855 states, 3170 states have (on average 1.16403785488959) internal successors, (3690), 3200 states have internal predecessors, (3690), 433 states have call successors, (433), 251 states have call predecessors, (433), 251 states have return successors, (433), 403 states have call predecessors, (433), 433 states have call successors, (433) [2021-11-19 04:28:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3855 states to 3855 states and 4556 transitions. [2021-11-19 04:28:26,523 INFO L78 Accepts]: Start accepts. Automaton has 3855 states and 4556 transitions. Word has length 392 [2021-11-19 04:28:26,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:28:26,523 INFO L470 AbstractCegarLoop]: Abstraction has 3855 states and 4556 transitions. [2021-11-19 04:28:26,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.428571428571429) internal successors, (177), 16 states have internal predecessors, (177), 5 states have call successors, (38), 5 states have call predecessors, (38), 8 states have return successors, (34), 8 states have call predecessors, (34), 5 states have call successors, (34) [2021-11-19 04:28:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3855 states and 4556 transitions. [2021-11-19 04:28:26,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2021-11-19 04:28:26,527 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:28:26,527 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 12, 12, 10, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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] [2021-11-19 04:28:26,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-19 04:28:26,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:28:26,728 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:28:26,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:28:26,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1107538834, now seen corresponding path program 1 times [2021-11-19 04:28:26,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:28:26,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246406402] [2021-11-19 04:28:26,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:28:26,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:28:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:26,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 04:28:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:26,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-19 04:28:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:26,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-19 04:28:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:26,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-19 04:28:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:26,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-19 04:28:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:26,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-19 04:28:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:26,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-19 04:28:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:26,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-19 04:28:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:26,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 04:28:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:26,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-19 04:28:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:26,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:28:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:26,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 04:28:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:26,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-19 04:28:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:26,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:28:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:26,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-19 04:28:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:26,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-19 04:28:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:27,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-19 04:28:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:27,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-19 04:28:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:27,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-19 04:28:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:27,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-11-19 04:28:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:27,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-11-19 04:28:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:27,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-11-19 04:28:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:27,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-11-19 04:28:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:27,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-11-19 04:28:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:27,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-11-19 04:28:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:27,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-11-19 04:28:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:27,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-11-19 04:28:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:27,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-11-19 04:28:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:27,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-11-19 04:28:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:27,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-11-19 04:28:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:27,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2021-11-19 04:28:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:27,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2021-11-19 04:28:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:27,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2021-11-19 04:28:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:27,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2021-11-19 04:28:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:27,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 139 proven. 132 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2021-11-19 04:28:27,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:28:27,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246406402] [2021-11-19 04:28:27,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246406402] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:28:27,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432771253] [2021-11-19 04:28:27,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:28:27,104 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:28:27,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:28:27,105 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:28:27,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-19 04:28:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:28:27,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-19 04:28:27,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:28:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 607 proven. 221 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2021-11-19 04:28:29,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 04:28:31,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 157 proven. 155 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2021-11-19 04:28:31,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432771253] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 04:28:31,021 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 04:28:31,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 25, 20] total 48 [2021-11-19 04:28:31,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881713560] [2021-11-19 04:28:31,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 04:28:31,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-11-19 04:28:31,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:28:31,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-11-19 04:28:31,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2048, Unknown=0, NotChecked=0, Total=2256 [2021-11-19 04:28:31,024 INFO L87 Difference]: Start difference. First operand 3855 states and 4556 transitions. Second operand has 48 states, 48 states have (on average 8.0) internal successors, (384), 40 states have internal predecessors, (384), 14 states have call successors, (62), 11 states have call predecessors, (62), 24 states have return successors, (62), 18 states have call predecessors, (62), 14 states have call successors, (62) [2021-11-19 04:28:36,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:28:36,468 INFO L93 Difference]: Finished difference Result 7953 states and 9578 transitions. [2021-11-19 04:28:36,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-11-19 04:28:36,468 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 8.0) internal successors, (384), 40 states have internal predecessors, (384), 14 states have call successors, (62), 11 states have call predecessors, (62), 24 states have return successors, (62), 18 states have call predecessors, (62), 14 states have call successors, (62) Word has length 394 [2021-11-19 04:28:36,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:28:36,474 INFO L225 Difference]: With dead ends: 7953 [2021-11-19 04:28:36,474 INFO L226 Difference]: Without dead ends: 4519 [2021-11-19 04:28:36,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 911 GetRequests, 826 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1635 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=801, Invalid=6171, Unknown=0, NotChecked=0, Total=6972 [2021-11-19 04:28:36,477 INFO L933 BasicCegarLoop]: 330 mSDtfsCounter, 779 mSDsluCounter, 6312 mSDsCounter, 0 mSdLazyCounter, 4416 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 6642 SdHoareTripleChecker+Invalid, 4773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 4416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-11-19 04:28:36,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [802 Valid, 6642 Invalid, 4773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 4416 Invalid, 0 Unknown, 144 Unchecked, 2.6s Time] [2021-11-19 04:28:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2021-11-19 04:28:37,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 3862. [2021-11-19 04:28:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3862 states, 3176 states have (on average 1.1627833753148615) internal successors, (3693), 3206 states have internal predecessors, (3693), 433 states have call successors, (433), 252 states have call predecessors, (433), 252 states have return successors, (433), 403 states have call predecessors, (433), 433 states have call successors, (433) [2021-11-19 04:28:37,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 4559 transitions. [2021-11-19 04:28:37,330 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 4559 transitions. Word has length 394 [2021-11-19 04:28:37,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:28:37,331 INFO L470 AbstractCegarLoop]: Abstraction has 3862 states and 4559 transitions. [2021-11-19 04:28:37,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 8.0) internal successors, (384), 40 states have internal predecessors, (384), 14 states have call successors, (62), 11 states have call predecessors, (62), 24 states have return successors, (62), 18 states have call predecessors, (62), 14 states have call successors, (62) [2021-11-19 04:28:37,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 4559 transitions. [2021-11-19 04:28:37,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2021-11-19 04:28:37,337 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:28:37,337 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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, 1] [2021-11-19 04:28:37,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-19 04:28:37,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:28:37,565 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 04:28:37,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:28:37,565 INFO L85 PathProgramCache]: Analyzing trace with hash -340747451, now seen corresponding path program 1 times [2021-11-19 04:28:37,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:28:37,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188735893] [2021-11-19 04:28:37,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:28:37,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:28:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 04:28:37,614 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 04:28:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 04:28:37,864 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-19 04:28:37,864 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-19 04:28:37,865 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-19 04:28:37,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-11-19 04:28:37,871 INFO L732 BasicCegarLoop]: Path program 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] [2021-11-19 04:28:37,876 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-19 04:28:38,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 04:28:38 BoogieIcfgContainer [2021-11-19 04:28:38,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-19 04:28:38,195 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-19 04:28:38,195 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-19 04:28:38,196 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-19 04:28:38,196 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:23:38" (3/4) ... [2021-11-19 04:28:38,198 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-19 04:28:38,496 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/witness.graphml [2021-11-19 04:28:38,497 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-19 04:28:38,497 INFO L158 Benchmark]: Toolchain (without parser) took 301227.61ms. Allocated memory was 104.9MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 74.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2021-11-19 04:28:38,497 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 104.9MB. Free memory was 61.8MB in the beginning and 61.8MB in the end (delta: 46.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 04:28:38,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.15ms. Allocated memory is still 104.9MB. Free memory was 73.8MB in the beginning and 74.1MB in the end (delta: -221.6kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-19 04:28:38,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.35ms. Allocated memory is still 104.9MB. Free memory was 74.1MB in the beginning and 71.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-19 04:28:38,498 INFO L158 Benchmark]: Boogie Preprocessor took 75.59ms. Allocated memory is still 104.9MB. Free memory was 71.0MB in the beginning and 68.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 04:28:38,498 INFO L158 Benchmark]: RCFGBuilder took 897.52ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 68.9MB in the beginning and 95.8MB in the end (delta: -27.0MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2021-11-19 04:28:38,499 INFO L158 Benchmark]: TraceAbstraction took 299392.76ms. Allocated memory was 125.8MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 95.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2021-11-19 04:28:38,499 INFO L158 Benchmark]: Witness Printer took 301.69ms. Allocated memory is still 2.9GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 66.1MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2021-11-19 04:28:38,500 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 104.9MB. Free memory was 61.8MB in the beginning and 61.8MB in the end (delta: 46.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 476.15ms. Allocated memory is still 104.9MB. Free memory was 73.8MB in the beginning and 74.1MB in the end (delta: -221.6kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.35ms. Allocated memory is still 104.9MB. Free memory was 74.1MB in the beginning and 71.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.59ms. Allocated memory is still 104.9MB. Free memory was 71.0MB in the beginning and 68.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 897.52ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 68.9MB in the beginning and 95.8MB in the end (delta: -27.0MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * TraceAbstraction took 299392.76ms. Allocated memory was 125.8MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 95.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 301.69ms. Allocated memory is still 2.9GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 66.1MB). Peak memory consumption was 65.0MB. 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: 535]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] msg_t nomsg = (msg_t )-1; [L24] port_t g1v ; [L25] int8_t g1v_old ; [L26] int8_t g1v_new ; [L27] port_t g2v ; [L28] int8_t g2v_old ; [L29] int8_t g2v_new ; [L30] port_t g3v ; [L31] int8_t g3v_old ; [L32] int8_t g3v_new ; [L36] _Bool gate1Failed ; [L37] _Bool gate2Failed ; [L38] _Bool gate3Failed ; [L39] msg_t VALUE1 ; [L40] msg_t VALUE2 ; [L41] msg_t VALUE3 ; [L43] _Bool gate1Failed_History_0 ; [L44] _Bool gate1Failed_History_1 ; [L45] _Bool gate1Failed_History_2 ; [L46] _Bool gate2Failed_History_0 ; [L47] _Bool gate2Failed_History_1 ; [L48] _Bool gate2Failed_History_2 ; [L49] _Bool gate3Failed_History_0 ; [L50] _Bool gate3Failed_History_1 ; [L51] _Bool gate3Failed_History_2 ; [L52] int8_t votedValue_History_0 ; [L53] int8_t votedValue_History_1 ; [L54] int8_t votedValue_History_2 ; VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=0, votedValue_History_1=0, votedValue_History_2=0] [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] gate1Failed = __VERIFIER_nondet_bool() [L482] gate2Failed = __VERIFIER_nondet_bool() [L483] gate3Failed = __VERIFIER_nondet_bool() [L484] VALUE1 = __VERIFIER_nondet_char() [L485] VALUE2 = __VERIFIER_nondet_char() [L486] VALUE3 = __VERIFIER_nondet_char() [L487] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L488] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L489] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L490] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L491] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L492] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L493] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L494] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L495] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L496] votedValue_History_0 = __VERIFIER_nondet_char() [L497] votedValue_History_1 = __VERIFIER_nondet_char() [L498] votedValue_History_2 = __VERIFIER_nondet_char() [L499] CALL, EXPR init() [L203] int tmp ; [L204] int tmp___0 ; [L205] int tmp___1 ; [L206] int tmp___2 ; VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] CALL, EXPR add_history_type(0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [\old(history_id)=0, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [\old(history_id)=0, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [\old(history_id)=0, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] RET, EXPR add_history_type(0) VAL [add_history_type(0)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] tmp = add_history_type(0) [L210] COND FALSE !(! tmp) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] CALL, EXPR add_history_type(1) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [\old(history_id)=1, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [\old(history_id)=1, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [\old(history_id)=1, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=1, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] RET, EXPR add_history_type(1) VAL [add_history_type(1)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] tmp___0 = add_history_type(1) [L214] COND FALSE !(! tmp___0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] CALL, EXPR add_history_type(2) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [\old(history_id)=2, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [\old(history_id)=2, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [\old(history_id)=2, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=2, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] RET, EXPR add_history_type(2) VAL [add_history_type(2)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] tmp___1 = add_history_type(2) [L218] COND FALSE !(! tmp___1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] CALL, EXPR add_history_type(3) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=3, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] RET, EXPR add_history_type(3) VAL [add_history_type(3)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] tmp___2 = add_history_type(3) [L222] COND FALSE !(! tmp___2) [L225] return (1); VAL [\result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L499] RET, EXPR init() [L499] i2 = init() [L500] COND FALSE !(!(i2)) VAL [c1=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, i2=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L501] g1v_old = nomsg [L502] g1v_new = nomsg [L503] g2v_old = nomsg [L504] g2v_new = nomsg [L505] g3v_old = nomsg [L506] g3v_new = nomsg [L507] i2 = 0 VAL [c1=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L508] COND TRUE i2 < 10 [L510] CALL gate1_each_pals_period() [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L344] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=4, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=5, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed_History_0=0, gate1Failed_History_1=4, gate1Failed_History_2=2, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=4, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=5, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=0, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, history_id=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L344] RET write_history_bool(0, gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L345] COND TRUE \read(gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L346] EXPR nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L346] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new [L510] RET gate1_each_pals_period() [L511] CALL gate2_each_pals_period() [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L375] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=5, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=5, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=1, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=5, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=1, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L375] RET write_history_bool(1, gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L376] COND TRUE \read(gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L377] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L511] RET gate2_each_pals_period() [L512] CALL gate3_each_pals_period() [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L406] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L186] COND FALSE !(history_id == 1) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L406] RET write_history_bool(2, gate3Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L407] COND FALSE !(\read(gate3Failed)) [L411] tmp = __VERIFIER_nondet_char() [L412] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L413] COND TRUE (int )next_state == 0 [L414] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L424] COND FALSE !(!((_Bool )tmp___0)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L425] EXPR next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L425] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [L512] RET gate3_each_pals_period() [L513] CALL voter() [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] voted_value = VALUE1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L470] CALL write_history_int8(3, voted_value) [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [\old(buf)=255, \old(history_id)=3, buf=255, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L470] RET write_history_int8(3, voted_value) [L513] RET voter() [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L520] CALL, EXPR check() [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L249] COND FALSE !(! gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L252] COND FALSE !(! gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L255] COND TRUE ! gate3Failed [L256] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L260] COND FALSE !(!((_Bool )tmp)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] CALL, EXPR read_history_bool(0, 1) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L127] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] RET, EXPR read_history_bool(0, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_bool(0, 1)=0, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND TRUE ! tmp___3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, tmp=1, tmp___3=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] CALL, EXPR read_history_bool(1, 1) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L137] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L140] COND TRUE historyIndex == 1 [L141] return (gate2Failed_History_1); VAL [\old(history_id)=1, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] RET, EXPR read_history_bool(1, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_bool(1, 1)=0, tmp=1, tmp___3=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] tmp___4 = read_history_bool(1, 1) [L264] COND TRUE ! tmp___4 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] CALL, EXPR read_history_bool(2, 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L147] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L150] COND TRUE historyIndex == 1 [L151] return (gate3Failed_History_1); VAL [\old(history_id)=2, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] RET, EXPR read_history_bool(2, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_bool(2, 1)=0, tmp=1, tmp___3=0, tmp___4=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] tmp___5 = read_history_bool(2, 1) [L266] COND TRUE ! tmp___5 [L267] temp_count = 0 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] tmp___0 = read_history_int8(3, 0) [L269] COND TRUE (int )VALUE1 == (int )tmp___0 [L270] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] tmp___1 = read_history_int8(3, 0) [L273] COND TRUE (int )VALUE2 == (int )tmp___1 [L274] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] tmp___2 = read_history_int8(3, 0) [L277] COND TRUE (int )VALUE3 == (int )tmp___2 [L278] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L280] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L294] COND FALSE !(! (temp_count > 1)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] CALL, EXPR read_history_int8(3, 1) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 1 [L111] return (votedValue_History_1); VAL [\old(history_id)=3, \old(historyIndex)=1, \result=-2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] RET, EXPR read_history_int8(3, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_int8(3, 1)=-2, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] tmp___10 = read_history_int8(3, 1) [L301] COND FALSE !((int )tmp___10 > -2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] tmp___11 = read_history_int8(3, 0) [L321] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___11=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L333] return (1); VAL [\result=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___11=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L520] RET, EXPR check() [L520] c1 = check() [L521] CALL assert(c1) VAL [\old(arg)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L533] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L521] RET assert(c1) VAL [c1=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L522] i2 ++ VAL [c1=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L508] COND TRUE i2 < 10 [L510] CALL gate1_each_pals_period() [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L344] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=0, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L344] RET write_history_bool(0, gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L345] COND FALSE !(\read(gate1Failed)) [L349] tmp = __VERIFIER_nondet_char() [L350] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, nomsg=-1, tmp=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L351] COND TRUE (int )next_state == 0 [L352] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L362] COND FALSE !(!((_Bool )tmp___0)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L363] EXPR next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L363] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L510] RET gate1_each_pals_period() [L511] CALL gate2_each_pals_period() [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L375] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=1, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=1, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L375] RET write_history_bool(1, gate2Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L376] COND TRUE \read(gate2Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L377] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L511] RET gate2_each_pals_period() [L512] CALL gate3_each_pals_period() [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L406] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L186] COND FALSE !(history_id == 1) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L406] RET write_history_bool(2, gate3Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L407] COND TRUE \read(gate3Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L408] EXPR nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L408] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new [L512] RET gate3_each_pals_period() [L513] CALL voter() [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] voted_value = VALUE1 VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L470] CALL write_history_int8(3, voted_value) [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [\old(buf)=255, \old(history_id)=3, buf=255, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L470] RET write_history_int8(3, voted_value) [L513] RET voter() [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L520] CALL, EXPR check() [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L249] COND TRUE ! gate1Failed [L250] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L260] COND FALSE !(!((_Bool )tmp)) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] CALL, EXPR read_history_bool(0, 1) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L127] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=-511, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] RET, EXPR read_history_bool(0, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(0, 1)=-511, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND FALSE !(! tmp___3) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] CALL, EXPR read_history_int8(3, 1) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND TRUE historyIndex == 1 [L111] return (votedValue_History_1); VAL [\old(history_id)=3, \old(historyIndex)=1, \result=-1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] RET, EXPR read_history_int8(3, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 1)=-1, tmp=1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] tmp___10 = read_history_int8(3, 1) [L301] COND TRUE (int )tmp___10 > -2 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 0)=-1, tmp=1, tmp___10=-1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] tmp___6 = read_history_int8(3, 0) [L303] COND TRUE (int )tmp___6 == (int )nomsg VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] CALL, EXPR read_history_bool(0, 1) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L127] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=-511, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] RET, EXPR read_history_bool(0, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(0, 1)=-511, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] tmp___7 = read_history_bool(0, 1) [L305] COND TRUE \read(tmp___7) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] CALL, EXPR read_history_bool(1, 1) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L137] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L140] COND TRUE historyIndex == 1 [L141] return (gate2Failed_History_1); VAL [\old(history_id)=1, \old(historyIndex)=1, \result=-255, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] RET, EXPR read_history_bool(1, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(1, 1)=-255, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] tmp___8 = read_history_bool(1, 1) [L307] COND TRUE \read(tmp___8) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] CALL, EXPR read_history_bool(2, 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L147] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L150] COND TRUE historyIndex == 1 [L151] return (gate3Failed_History_1); VAL [\old(history_id)=2, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] RET, EXPR read_history_bool(2, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(2, 1)=0, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] tmp___9 = read_history_bool(2, 1) [L309] COND TRUE ! tmp___9 [L310] return (0); VAL [\result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, tmp___9=0, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L520] RET, EXPR check() [L520] c1 = check() [L521] CALL assert(c1) VAL [\old(arg)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L533] COND TRUE ! arg VAL [\old(arg)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L535] reach_error() VAL [\old(arg)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 184 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 299.0s, OverallIterations: 57, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.4s, AutomataDifference: 219.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39437 SdHoareTripleChecker+Valid, 97.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38819 mSDsluCounter, 227969 SdHoareTripleChecker+Invalid, 81.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 144 IncrementalHoareTripleChecker+Unchecked, 203432 mSDsCounter, 23678 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172281 IncrementalHoareTripleChecker+Invalid, 196103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23678 mSolverCounterUnsat, 24537 mSDtfsCounter, 172281 mSolverCounterSat, 1.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17529 GetRequests, 14688 SyntacticMatches, 10 SemanticMatches, 2831 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431432 ImplicationChecksByTransitivity, 80.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6632occurred in iteration=44, InterpolantAutomatonStates: 2466, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.1s AutomataMinimizationTime, 56 MinimizatonAttempts, 162517 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 35.8s InterpolantComputationTime, 21049 NumberOfCodeBlocks, 21049 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 23653 ConstructedInterpolants, 2 QuantifiedInterpolants, 51253 SizeOfPredicates, 85 NumberOfNonLiveVariables, 22702 ConjunctsInSsa, 407 ConjunctsInUnsatCore, 88 InterpolantComputations, 43 PerfectInterpolantSequences, 58396/60879 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-11-19 04:28:38,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0976450-6740-4db7-87e2-3d4637e4f7bb/bin/uautomizer-ZXIjhQolGL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE