./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8 --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 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 22:33:58,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 22:33:58,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 22:33:58,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 22:33:58,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 22:33:58,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 22:33:58,824 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 22:33:58,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 22:33:58,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 22:33:58,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 22:33:58,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 22:33:58,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 22:33:58,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 22:33:58,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 22:33:58,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 22:33:58,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 22:33:58,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 22:33:58,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 22:33:58,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 22:33:58,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 22:33:58,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 22:33:58,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 22:33:58,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 22:33:58,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 22:33:58,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 22:33:58,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 22:33:58,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 22:33:58,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 22:33:58,847 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 22:33:58,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 22:33:58,848 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 22:33:58,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 22:33:58,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 22:33:58,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 22:33:58,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 22:33:58,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 22:33:58,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 22:33:58,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 22:33:58,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 22:33:58,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 22:33:58,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 22:33:58,852 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 22:33:58,865 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 22:33:58,865 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 22:33:58,865 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 22:33:58,866 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 22:33:58,866 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 22:33:58,866 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 22:33:58,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 22:33:58,867 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 22:33:58,867 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 22:33:58,867 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 22:33:58,867 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 22:33:58,867 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 22:33:58,867 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 22:33:58,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 22:33:58,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 22:33:58,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 22:33:58,868 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 22:33:58,868 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 22:33:58,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 22:33:58,868 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 22:33:58,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 22:33:58,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 22:33:58,868 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 22:33:58,868 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 22:33:58,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:33:58,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 22:33:58,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 22:33:58,869 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 22:33:58,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 22:33:58,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 22:33:58,869 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 22:33:58,869 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 22:33:58,869 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 22:33:58,869 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 22:33:58,869 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 22:33:58,869 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/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_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8 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 -> 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 [2022-12-13 22:33:59,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 22:33:59,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 22:33:59,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 22:33:59,060 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 22:33:59,060 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 22:33:59,061 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2022-12-13 22:34:01,568 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 22:34:01,722 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 22:34:01,722 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2022-12-13 22:34:01,729 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/data/e77b518f0/e528459050154b838ed0c57597117934/FLAGe27f3b4b1 [2022-12-13 22:34:02,126 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/data/e77b518f0/e528459050154b838ed0c57597117934 [2022-12-13 22:34:02,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 22:34:02,130 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 22:34:02,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 22:34:02,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 22:34:02,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 22:34:02,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:34:02" (1/1) ... [2022-12-13 22:34:02,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17b766d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:34:02, skipping insertion in model container [2022-12-13 22:34:02,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:34:02" (1/1) ... [2022-12-13 22:34:02,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 22:34:02,161 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 22:34:02,304 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2022-12-13 22:34:02,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:34:02,315 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 22:34:02,352 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2022-12-13 22:34:02,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:34:02,363 INFO L208 MainTranslator]: Completed translation [2022-12-13 22:34:02,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:34:02 WrapperNode [2022-12-13 22:34:02,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 22:34:02,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 22:34:02,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 22:34:02,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 22:34:02,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:34:02" (1/1) ... [2022-12-13 22:34:02,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:34:02" (1/1) ... [2022-12-13 22:34:02,398 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 381 [2022-12-13 22:34:02,398 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 22:34:02,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 22:34:02,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 22:34:02,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 22:34:02,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:34:02" (1/1) ... [2022-12-13 22:34:02,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:34:02" (1/1) ... [2022-12-13 22:34:02,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:34:02" (1/1) ... [2022-12-13 22:34:02,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:34:02" (1/1) ... [2022-12-13 22:34:02,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:34:02" (1/1) ... [2022-12-13 22:34:02,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:34:02" (1/1) ... [2022-12-13 22:34:02,420 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:34:02" (1/1) ... [2022-12-13 22:34:02,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:34:02" (1/1) ... [2022-12-13 22:34:02,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 22:34:02,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 22:34:02,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 22:34:02,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 22:34:02,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:34:02" (1/1) ... [2022-12-13 22:34:02,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:34:02,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:34:02,451 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 22:34:02,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 22:34:02,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 22:34:02,486 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2022-12-13 22:34:02,486 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2022-12-13 22:34:02,486 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-12-13 22:34:02,486 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-12-13 22:34:02,487 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2022-12-13 22:34:02,487 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2022-12-13 22:34:02,487 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2022-12-13 22:34:02,487 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2022-12-13 22:34:02,487 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2022-12-13 22:34:02,487 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2022-12-13 22:34:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 22:34:02,488 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 22:34:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 22:34:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 22:34:02,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 22:34:02,569 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 22:34:02,571 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 22:34:02,930 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 22:34:02,937 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 22:34:02,937 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 22:34:02,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:34:02 BoogieIcfgContainer [2022-12-13 22:34:02,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 22:34:02,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 22:34:02,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 22:34:02,943 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 22:34:02,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:34:02" (1/3) ... [2022-12-13 22:34:02,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b15d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:34:02, skipping insertion in model container [2022-12-13 22:34:02,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:34:02" (2/3) ... [2022-12-13 22:34:02,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b15d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:34:02, skipping insertion in model container [2022-12-13 22:34:02,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:34:02" (3/3) ... [2022-12-13 22:34:02,945 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2022-12-13 22:34:02,958 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 22:34:02,959 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 22:34:02,997 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 22:34:03,001 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@48cce616, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 22:34:03,001 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 22:34:03,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 133 states have (on average 1.586466165413534) internal successors, (211), 138 states have internal predecessors, (211), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-12-13 22:34:03,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 22:34:03,011 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:03,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:34:03,012 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:03,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:03,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2086312570, now seen corresponding path program 1 times [2022-12-13 22:34:03,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:03,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108956597] [2022-12-13 22:34:03,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:03,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:03,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:34:03,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:03,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108956597] [2022-12-13 22:34:03,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108956597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:03,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:03,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:34:03,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096766034] [2022-12-13 22:34:03,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:03,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:34:03,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:03,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:34:03,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:34:03,209 INFO L87 Difference]: Start difference. First operand has 178 states, 133 states have (on average 1.586466165413534) internal successors, (211), 138 states have internal predecessors, (211), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) 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) [2022-12-13 22:34:03,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:03,304 INFO L93 Difference]: Finished difference Result 357 states and 615 transitions. [2022-12-13 22:34:03,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:34:03,306 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 [2022-12-13 22:34:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:03,316 INFO L225 Difference]: With dead ends: 357 [2022-12-13 22:34:03,316 INFO L226 Difference]: Without dead ends: 182 [2022-12-13 22:34:03,320 INFO L412 NwaCegarLoop]: 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 [2022-12-13 22:34:03,322 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 18 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 799 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.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:34:03,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 799 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:03,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-12-13 22:34:03,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2022-12-13 22:34:03,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 135 states have (on average 1.5555555555555556) internal successors, (210), 139 states have internal predecessors, (210), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-12-13 22:34:03,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 284 transitions. [2022-12-13 22:34:03,364 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 284 transitions. Word has length 15 [2022-12-13 22:34:03,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:03,364 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 284 transitions. [2022-12-13 22:34:03,364 INFO L496 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) [2022-12-13 22:34:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 284 transitions. [2022-12-13 22:34:03,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 22:34:03,366 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:03,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:34:03,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 22:34:03,366 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:03,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:03,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2089918424, now seen corresponding path program 1 times [2022-12-13 22:34:03,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:03,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968787233] [2022-12-13 22:34:03,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:03,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:34:03,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:03,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968787233] [2022-12-13 22:34:03,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968787233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:03,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:03,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:34:03,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933467372] [2022-12-13 22:34:03,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:03,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:34:03,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:03,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:34:03,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:34:03,425 INFO L87 Difference]: Start difference. First operand 180 states and 284 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) [2022-12-13 22:34:03,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:03,472 INFO L93 Difference]: Finished difference Result 373 states and 591 transitions. [2022-12-13 22:34:03,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:34:03,472 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 [2022-12-13 22:34:03,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:03,474 INFO L225 Difference]: With dead ends: 373 [2022-12-13 22:34:03,474 INFO L226 Difference]: Without dead ends: 196 [2022-12-13 22:34:03,475 INFO L412 NwaCegarLoop]: 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 [2022-12-13 22:34:03,476 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 25 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 820 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 [2022-12-13 22:34:03,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 820 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:03,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-12-13 22:34:03,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2022-12-13 22:34:03,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 146 states have (on average 1.5342465753424657) internal successors, (224), 150 states have internal predecessors, (224), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-12-13 22:34:03,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 300 transitions. [2022-12-13 22:34:03,490 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 300 transitions. Word has length 16 [2022-12-13 22:34:03,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:03,490 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 300 transitions. [2022-12-13 22:34:03,491 INFO L496 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) [2022-12-13 22:34:03,491 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 300 transitions. [2022-12-13 22:34:03,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 22:34:03,491 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:03,492 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:34:03,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 22:34:03,492 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:03,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:03,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2079657108, now seen corresponding path program 1 times [2022-12-13 22:34:03,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:03,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944712155] [2022-12-13 22:34:03,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:03,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:03,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:03,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:34:03,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:03,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944712155] [2022-12-13 22:34:03,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944712155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:03,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:03,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:34:03,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832877036] [2022-12-13 22:34:03,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:03,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:34:03,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:03,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:34:03,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:34:03,545 INFO L87 Difference]: Start difference. First operand 193 states and 300 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 22:34:03,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:03,563 INFO L93 Difference]: Finished difference Result 405 states and 637 transitions. [2022-12-13 22:34:03,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:34:03,563 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-12-13 22:34:03,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:03,565 INFO L225 Difference]: With dead ends: 405 [2022-12-13 22:34:03,565 INFO L226 Difference]: Without dead ends: 222 [2022-12-13 22:34:03,565 INFO L412 NwaCegarLoop]: 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 [2022-12-13 22:34:03,566 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 22 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 554 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 [2022-12-13 22:34:03,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 554 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:03,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-12-13 22:34:03,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 195. [2022-12-13 22:34:03,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 148 states have (on average 1.527027027027027) internal successors, (226), 152 states have internal predecessors, (226), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-12-13 22:34:03,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 302 transitions. [2022-12-13 22:34:03,578 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 302 transitions. Word has length 24 [2022-12-13 22:34:03,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:03,579 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 302 transitions. [2022-12-13 22:34:03,579 INFO L496 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 22:34:03,579 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 302 transitions. [2022-12-13 22:34:03,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 22:34:03,580 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:03,580 INFO L195 NwaCegarLoop]: 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] [2022-12-13 22:34:03,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 22:34:03,580 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:03,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:03,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1546063421, now seen corresponding path program 1 times [2022-12-13 22:34:03,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:03,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174955777] [2022-12-13 22:34:03,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:03,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:03,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:03,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:03,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:34:03,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:03,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174955777] [2022-12-13 22:34:03,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174955777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:03,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:03,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:34:03,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535866628] [2022-12-13 22:34:03,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:03,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:34:03,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:03,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:34:03,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:34:03,661 INFO L87 Difference]: Start difference. First operand 195 states and 302 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) [2022-12-13 22:34:03,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:03,702 INFO L93 Difference]: Finished difference Result 479 states and 762 transitions. [2022-12-13 22:34:03,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:34:03,703 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 [2022-12-13 22:34:03,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:03,704 INFO L225 Difference]: With dead ends: 479 [2022-12-13 22:34:03,705 INFO L226 Difference]: Without dead ends: 300 [2022-12-13 22:34:03,705 INFO L412 NwaCegarLoop]: 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 [2022-12-13 22:34:03,706 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 118 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:34:03,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1170 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:03,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-12-13 22:34:03,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 199. [2022-12-13 22:34:03,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 151 states have (on average 1.5165562913907285) internal successors, (229), 155 states have internal predecessors, (229), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2022-12-13 22:34:03,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 306 transitions. [2022-12-13 22:34:03,718 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 306 transitions. Word has length 32 [2022-12-13 22:34:03,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:03,718 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 306 transitions. [2022-12-13 22:34:03,718 INFO L496 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) [2022-12-13 22:34:03,719 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 306 transitions. [2022-12-13 22:34:03,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 22:34:03,719 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:03,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:34:03,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 22:34:03,720 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:03,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:03,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1069273240, now seen corresponding path program 1 times [2022-12-13 22:34:03,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:03,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526568575] [2022-12-13 22:34:03,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:03,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:03,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:03,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:03,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 22:34:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:03,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:34:03,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:03,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526568575] [2022-12-13 22:34:03,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526568575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:03,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:03,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 22:34:03,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441963227] [2022-12-13 22:34:03,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:03,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:34:03,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:03,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:34:03,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:34:03,794 INFO L87 Difference]: Start difference. First operand 199 states and 306 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 22:34:03,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:03,849 INFO L93 Difference]: Finished difference Result 343 states and 534 transitions. [2022-12-13 22:34:03,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:34:03,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-12-13 22:34:03,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:03,851 INFO L225 Difference]: With dead ends: 343 [2022-12-13 22:34:03,851 INFO L226 Difference]: Without dead ends: 195 [2022-12-13 22:34:03,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 22:34:03,852 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 118 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:34:03,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1190 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-12-13 22:34:03,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-12-13 22:34:03,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 148 states have (on average 1.4932432432432432) internal successors, (221), 152 states have internal predecessors, (221), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-12-13 22:34:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 297 transitions. [2022-12-13 22:34:03,862 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 297 transitions. Word has length 35 [2022-12-13 22:34:03,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:03,863 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 297 transitions. [2022-12-13 22:34:03,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 22:34:03,863 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 297 transitions. [2022-12-13 22:34:03,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 22:34:03,864 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:03,864 INFO L195 NwaCegarLoop]: 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] [2022-12-13 22:34:03,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 22:34:03,864 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:03,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:03,864 INFO L85 PathProgramCache]: Analyzing trace with hash -32659331, now seen corresponding path program 1 times [2022-12-13 22:34:03,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:03,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229358282] [2022-12-13 22:34:03,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:03,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:03,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:03,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:03,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:34:03,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:03,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229358282] [2022-12-13 22:34:03,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229358282] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:34:03,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430496778] [2022-12-13 22:34:03,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:03,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:34:03,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:34:03,914 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:34:03,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 22:34:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:03,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 22:34:03,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:34:04,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:34:04,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:34:04,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:34:04,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430496778] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:34:04,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:34:04,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-12-13 22:34:04,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030291610] [2022-12-13 22:34:04,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:34:04,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:34:04,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:04,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:34:04,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:34:04,059 INFO L87 Difference]: Start difference. First operand 195 states and 297 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) [2022-12-13 22:34:04,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:04,103 INFO L93 Difference]: Finished difference Result 438 states and 681 transitions. [2022-12-13 22:34:04,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:34:04,103 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 [2022-12-13 22:34:04,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:04,105 INFO L225 Difference]: With dead ends: 438 [2022-12-13 22:34:04,105 INFO L226 Difference]: Without dead ends: 254 [2022-12-13 22:34:04,106 INFO L412 NwaCegarLoop]: 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 [2022-12-13 22:34:04,107 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 58 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:34:04,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1064 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:04,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-12-13 22:34:04,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2022-12-13 22:34:04,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 191 states have (on average 1.4659685863874345) internal successors, (280), 195 states have internal predecessors, (280), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-12-13 22:34:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 376 transitions. [2022-12-13 22:34:04,124 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 376 transitions. Word has length 35 [2022-12-13 22:34:04,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:04,124 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 376 transitions. [2022-12-13 22:34:04,125 INFO L496 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) [2022-12-13 22:34:04,125 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 376 transitions. [2022-12-13 22:34:04,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 22:34:04,126 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:04,126 INFO L195 NwaCegarLoop]: 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] [2022-12-13 22:34:04,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 22:34:04,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 22:34:04,328 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:04,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:04,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1003259933, now seen corresponding path program 2 times [2022-12-13 22:34:04,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:04,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171805412] [2022-12-13 22:34:04,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:04,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-13 22:34:04,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:04,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171805412] [2022-12-13 22:34:04,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171805412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:04,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:04,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:34:04,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444020014] [2022-12-13 22:34:04,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:04,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:34:04,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:04,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:34:04,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:34:04,484 INFO L87 Difference]: Start difference. First operand 248 states and 376 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) [2022-12-13 22:34:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:04,527 INFO L93 Difference]: Finished difference Result 506 states and 778 transitions. [2022-12-13 22:34:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:34:04,528 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 [2022-12-13 22:34:04,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:04,531 INFO L225 Difference]: With dead ends: 506 [2022-12-13 22:34:04,531 INFO L226 Difference]: Without dead ends: 287 [2022-12-13 22:34:04,532 INFO L412 NwaCegarLoop]: 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 [2022-12-13 22:34:04,533 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 24 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 812 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 [2022-12-13 22:34:04,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 812 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:04,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-12-13 22:34:04,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2022-12-13 22:34:04,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 223 states have (on average 1.4215246636771302) internal successors, (317), 227 states have internal predecessors, (317), 51 states have call successors, (51), 9 states have call predecessors, (51), 9 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-12-13 22:34:04,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 419 transitions. [2022-12-13 22:34:04,544 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 419 transitions. Word has length 57 [2022-12-13 22:34:04,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:04,544 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 419 transitions. [2022-12-13 22:34:04,544 INFO L496 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) [2022-12-13 22:34:04,544 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 419 transitions. [2022-12-13 22:34:04,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 22:34:04,545 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:04,545 INFO L195 NwaCegarLoop]: 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] [2022-12-13 22:34:04,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 22:34:04,545 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:04,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:04,546 INFO L85 PathProgramCache]: Analyzing trace with hash -447415154, now seen corresponding path program 1 times [2022-12-13 22:34:04,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:04,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893806852] [2022-12-13 22:34:04,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:04,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,596 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-12-13 22:34:04,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:04,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893806852] [2022-12-13 22:34:04,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893806852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:04,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:04,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:34:04,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221050418] [2022-12-13 22:34:04,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:04,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:34:04,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:04,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:34:04,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:34:04,597 INFO L87 Difference]: Start difference. First operand 284 states and 419 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) [2022-12-13 22:34:04,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:04,642 INFO L93 Difference]: Finished difference Result 543 states and 825 transitions. [2022-12-13 22:34:04,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:34:04,643 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 [2022-12-13 22:34:04,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:04,644 INFO L225 Difference]: With dead ends: 543 [2022-12-13 22:34:04,645 INFO L226 Difference]: Without dead ends: 293 [2022-12-13 22:34:04,645 INFO L412 NwaCegarLoop]: 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 [2022-12-13 22:34:04,646 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 19 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 798 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 [2022-12-13 22:34:04,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 798 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:04,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-12-13 22:34:04,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2022-12-13 22:34:04,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 229 states have (on average 1.4192139737991267) internal successors, (325), 233 states have internal predecessors, (325), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-12-13 22:34:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 427 transitions. [2022-12-13 22:34:04,659 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 427 transitions. Word has length 57 [2022-12-13 22:34:04,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:04,660 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 427 transitions. [2022-12-13 22:34:04,660 INFO L496 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) [2022-12-13 22:34:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 427 transitions. [2022-12-13 22:34:04,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-13 22:34:04,661 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:04,661 INFO L195 NwaCegarLoop]: 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] [2022-12-13 22:34:04,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 22:34:04,661 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:04,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:04,661 INFO L85 PathProgramCache]: Analyzing trace with hash 879511853, now seen corresponding path program 1 times [2022-12-13 22:34:04,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:04,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743099044] [2022-12-13 22:34:04,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:04,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,746 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-13 22:34:04,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:04,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743099044] [2022-12-13 22:34:04,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743099044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:04,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:04,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:34:04,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724000844] [2022-12-13 22:34:04,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:04,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:34:04,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:04,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:34:04,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:34:04,748 INFO L87 Difference]: Start difference. First operand 291 states and 427 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) [2022-12-13 22:34:04,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:04,776 INFO L93 Difference]: Finished difference Result 531 states and 793 transitions. [2022-12-13 22:34:04,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:34:04,776 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 [2022-12-13 22:34:04,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:04,778 INFO L225 Difference]: With dead ends: 531 [2022-12-13 22:34:04,778 INFO L226 Difference]: Without dead ends: 293 [2022-12-13 22:34:04,778 INFO L412 NwaCegarLoop]: 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 [2022-12-13 22:34:04,779 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:34:04,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1080 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:04,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-12-13 22:34:04,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2022-12-13 22:34:04,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 229 states have (on average 1.4061135371179039) internal successors, (322), 233 states have internal predecessors, (322), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-12-13 22:34:04,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 424 transitions. [2022-12-13 22:34:04,790 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 424 transitions. Word has length 75 [2022-12-13 22:34:04,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:04,790 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 424 transitions. [2022-12-13 22:34:04,790 INFO L496 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) [2022-12-13 22:34:04,790 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 424 transitions. [2022-12-13 22:34:04,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-13 22:34:04,791 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:04,791 INFO L195 NwaCegarLoop]: 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] [2022-12-13 22:34:04,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 22:34:04,791 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:04,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:04,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1733898963, now seen corresponding path program 1 times [2022-12-13 22:34:04,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:04,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923505820] [2022-12-13 22:34:04,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:04,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-12-13 22:34:04,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:04,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923505820] [2022-12-13 22:34:04,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923505820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:04,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:04,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:34:04,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761036208] [2022-12-13 22:34:04,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:04,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:34:04,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:04,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:34:04,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:34:04,866 INFO L87 Difference]: Start difference. First operand 291 states and 424 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) [2022-12-13 22:34:04,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:04,908 INFO L93 Difference]: Finished difference Result 568 states and 849 transitions. [2022-12-13 22:34:04,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:34:04,908 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 [2022-12-13 22:34:04,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:04,909 INFO L225 Difference]: With dead ends: 568 [2022-12-13 22:34:04,910 INFO L226 Difference]: Without dead ends: 335 [2022-12-13 22:34:04,910 INFO L412 NwaCegarLoop]: 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 [2022-12-13 22:34:04,911 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 25 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 812 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 [2022-12-13 22:34:04,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 812 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:04,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-12-13 22:34:04,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2022-12-13 22:34:04,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 266 states have (on average 1.368421052631579) internal successors, (364), 270 states have internal predecessors, (364), 54 states have call successors, (54), 11 states have call predecessors, (54), 11 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-12-13 22:34:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 472 transitions. [2022-12-13 22:34:04,923 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 472 transitions. Word has length 104 [2022-12-13 22:34:04,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:04,923 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 472 transitions. [2022-12-13 22:34:04,923 INFO L496 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) [2022-12-13 22:34:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 472 transitions. [2022-12-13 22:34:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-13 22:34:04,924 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:04,924 INFO L195 NwaCegarLoop]: 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] [2022-12-13 22:34:04,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 22:34:04,924 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:04,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:04,924 INFO L85 PathProgramCache]: Analyzing trace with hash -8134044, now seen corresponding path program 1 times [2022-12-13 22:34:04,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:04,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777686943] [2022-12-13 22:34:04,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:04,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:04,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,007 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-12-13 22:34:05,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:05,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777686943] [2022-12-13 22:34:05,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777686943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:05,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:05,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:34:05,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622004076] [2022-12-13 22:34:05,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:05,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:34:05,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:05,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:34:05,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:34:05,009 INFO L87 Difference]: Start difference. First operand 332 states and 472 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) [2022-12-13 22:34:05,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:05,051 INFO L93 Difference]: Finished difference Result 594 states and 869 transitions. [2022-12-13 22:34:05,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:34:05,051 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 [2022-12-13 22:34:05,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:05,053 INFO L225 Difference]: With dead ends: 594 [2022-12-13 22:34:05,053 INFO L226 Difference]: Without dead ends: 326 [2022-12-13 22:34:05,054 INFO L412 NwaCegarLoop]: 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 [2022-12-13 22:34:05,054 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 15 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 771 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 [2022-12-13 22:34:05,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 771 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:05,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-12-13 22:34:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2022-12-13 22:34:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 261 states have (on average 1.3486590038314177) internal successors, (352), 265 states have internal predecessors, (352), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2022-12-13 22:34:05,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 458 transitions. [2022-12-13 22:34:05,066 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 458 transitions. Word has length 105 [2022-12-13 22:34:05,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:05,066 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 458 transitions. [2022-12-13 22:34:05,066 INFO L496 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) [2022-12-13 22:34:05,066 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 458 transitions. [2022-12-13 22:34:05,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-12-13 22:34:05,067 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:05,067 INFO L195 NwaCegarLoop]: 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] [2022-12-13 22:34:05,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 22:34:05,068 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:05,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:05,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1589641163, now seen corresponding path program 1 times [2022-12-13 22:34:05,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:05,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703117325] [2022-12-13 22:34:05,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:05,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-12-13 22:34:05,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:05,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703117325] [2022-12-13 22:34:05,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703117325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:05,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:05,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:34:05,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648888685] [2022-12-13 22:34:05,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:05,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:34:05,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:05,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:34:05,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:34:05,158 INFO L87 Difference]: Start difference. First operand 326 states and 458 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) [2022-12-13 22:34:05,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:05,193 INFO L93 Difference]: Finished difference Result 569 states and 818 transitions. [2022-12-13 22:34:05,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:34:05,193 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 [2022-12-13 22:34:05,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:05,196 INFO L225 Difference]: With dead ends: 569 [2022-12-13 22:34:05,196 INFO L226 Difference]: Without dead ends: 328 [2022-12-13 22:34:05,197 INFO L412 NwaCegarLoop]: 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 [2022-12-13 22:34:05,197 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:34:05,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1065 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:05,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-12-13 22:34:05,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2022-12-13 22:34:05,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 261 states have (on average 1.3371647509578544) internal successors, (349), 265 states have internal predecessors, (349), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2022-12-13 22:34:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 455 transitions. [2022-12-13 22:34:05,209 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 455 transitions. Word has length 124 [2022-12-13 22:34:05,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:05,209 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 455 transitions. [2022-12-13 22:34:05,209 INFO L496 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) [2022-12-13 22:34:05,209 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 455 transitions. [2022-12-13 22:34:05,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-12-13 22:34:05,210 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:05,211 INFO L195 NwaCegarLoop]: 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] [2022-12-13 22:34:05,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 22:34:05,211 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:05,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:05,211 INFO L85 PathProgramCache]: Analyzing trace with hash -164352821, now seen corresponding path program 1 times [2022-12-13 22:34:05,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:05,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886204] [2022-12-13 22:34:05,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:05,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2022-12-13 22:34:05,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:05,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886204] [2022-12-13 22:34:05,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:05,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:05,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:34:05,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384685273] [2022-12-13 22:34:05,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:05,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:34:05,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:05,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:34:05,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:34:05,300 INFO L87 Difference]: Start difference. First operand 326 states and 455 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) [2022-12-13 22:34:05,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:05,347 INFO L93 Difference]: Finished difference Result 532 states and 778 transitions. [2022-12-13 22:34:05,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:34:05,348 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 [2022-12-13 22:34:05,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:05,349 INFO L225 Difference]: With dead ends: 532 [2022-12-13 22:34:05,349 INFO L226 Difference]: Without dead ends: 324 [2022-12-13 22:34:05,350 INFO L412 NwaCegarLoop]: 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 [2022-12-13 22:34:05,351 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 13 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 739 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 [2022-12-13 22:34:05,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 739 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:05,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-12-13 22:34:05,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2022-12-13 22:34:05,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 260 states have (on average 1.3346153846153845) internal successors, (347), 264 states have internal predecessors, (347), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-12-13 22:34:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 451 transitions. [2022-12-13 22:34:05,361 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 451 transitions. Word has length 157 [2022-12-13 22:34:05,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:05,362 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 451 transitions. [2022-12-13 22:34:05,362 INFO L496 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) [2022-12-13 22:34:05,362 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 451 transitions. [2022-12-13 22:34:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-12-13 22:34:05,363 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:05,364 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1] [2022-12-13 22:34:05,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 22:34:05,364 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:05,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:05,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1524827283, now seen corresponding path program 1 times [2022-12-13 22:34:05,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:05,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837586894] [2022-12-13 22:34:05,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:05,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-12-13 22:34:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2022-12-13 22:34:05,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:05,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837586894] [2022-12-13 22:34:05,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837586894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:05,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:05,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:34:05,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556197705] [2022-12-13 22:34:05,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:05,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:34:05,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:05,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:34:05,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:34:05,497 INFO L87 Difference]: Start difference. First operand 324 states and 451 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 22:34:05,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:05,544 INFO L93 Difference]: Finished difference Result 472 states and 674 transitions. [2022-12-13 22:34:05,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:34:05,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 176 [2022-12-13 22:34:05,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:05,547 INFO L225 Difference]: With dead ends: 472 [2022-12-13 22:34:05,548 INFO L226 Difference]: Without dead ends: 307 [2022-12-13 22:34:05,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:34:05,549 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 35 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 720 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 [2022-12-13 22:34:05,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 720 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:05,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-12-13 22:34:05,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2022-12-13 22:34:05,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 246 states have (on average 1.3252032520325203) internal successors, (326), 250 states have internal predecessors, (326), 49 states have call successors, (49), 11 states have call predecessors, (49), 11 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-12-13 22:34:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 424 transitions. [2022-12-13 22:34:05,561 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 424 transitions. Word has length 176 [2022-12-13 22:34:05,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:05,561 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 424 transitions. [2022-12-13 22:34:05,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 22:34:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 424 transitions. [2022-12-13 22:34:05,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-12-13 22:34:05,563 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:05,563 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1] [2022-12-13 22:34:05,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 22:34:05,563 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:05,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:05,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1721529288, now seen corresponding path program 1 times [2022-12-13 22:34:05,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:05,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829603997] [2022-12-13 22:34:05,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:05,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-12-13 22:34:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-12-13 22:34:05,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:05,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829603997] [2022-12-13 22:34:05,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829603997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:05,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:05,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:34:05,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184573346] [2022-12-13 22:34:05,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:05,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:34:05,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:05,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:34:05,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:34:05,676 INFO L87 Difference]: Start difference. First operand 307 states and 424 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 22:34:05,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:05,722 INFO L93 Difference]: Finished difference Result 455 states and 647 transitions. [2022-12-13 22:34:05,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:34:05,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 178 [2022-12-13 22:34:05,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:05,724 INFO L225 Difference]: With dead ends: 455 [2022-12-13 22:34:05,724 INFO L226 Difference]: Without dead ends: 288 [2022-12-13 22:34:05,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:34:05,725 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 30 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 724 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 [2022-12-13 22:34:05,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 724 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:05,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-12-13 22:34:05,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-12-13 22:34:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 230 states have (on average 1.317391304347826) internal successors, (303), 234 states have internal predecessors, (303), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-12-13 22:34:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 395 transitions. [2022-12-13 22:34:05,735 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 395 transitions. Word has length 178 [2022-12-13 22:34:05,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:05,736 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 395 transitions. [2022-12-13 22:34:05,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 22:34:05,736 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 395 transitions. [2022-12-13 22:34:05,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-12-13 22:34:05,738 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:05,738 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1] [2022-12-13 22:34:05,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 22:34:05,739 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:05,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:05,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1770335087, now seen corresponding path program 1 times [2022-12-13 22:34:05,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:05,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013790588] [2022-12-13 22:34:05,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:05,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-12-13 22:34:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2022-12-13 22:34:05,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:05,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013790588] [2022-12-13 22:34:05,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013790588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:05,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:05,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:34:05,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582510267] [2022-12-13 22:34:05,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:05,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:34:05,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:05,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:34:05,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:34:05,848 INFO L87 Difference]: Start difference. First operand 288 states and 395 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 22:34:05,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:05,876 INFO L93 Difference]: Finished difference Result 435 states and 617 transitions. [2022-12-13 22:34:05,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:34:05,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 179 [2022-12-13 22:34:05,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:05,879 INFO L225 Difference]: With dead ends: 435 [2022-12-13 22:34:05,879 INFO L226 Difference]: Without dead ends: 288 [2022-12-13 22:34:05,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:34:05,880 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:34:05,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1044 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:05,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-12-13 22:34:05,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-12-13 22:34:05,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 230 states have (on average 1.291304347826087) internal successors, (297), 234 states have internal predecessors, (297), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-12-13 22:34:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 389 transitions. [2022-12-13 22:34:05,889 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 389 transitions. Word has length 179 [2022-12-13 22:34:05,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:05,890 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 389 transitions. [2022-12-13 22:34:05,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 22:34:05,890 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 389 transitions. [2022-12-13 22:34:05,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-12-13 22:34:05,891 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:05,891 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1] [2022-12-13 22:34:05,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 22:34:05,892 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:05,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:05,892 INFO L85 PathProgramCache]: Analyzing trace with hash -984884076, now seen corresponding path program 1 times [2022-12-13 22:34:05,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:05,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379458366] [2022-12-13 22:34:05,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:05,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-12-13 22:34:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:05,995 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-12-13 22:34:05,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:05,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379458366] [2022-12-13 22:34:05,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379458366] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:34:05,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078938917] [2022-12-13 22:34:05,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:05,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:34:05,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:34:05,997 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:34:05,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 22:34:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 22:34:06,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:34:06,159 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-12-13 22:34:06,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:34:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-12-13 22:34:06,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078938917] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 22:34:06,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 22:34:06,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2022-12-13 22:34:06,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420385221] [2022-12-13 22:34:06,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:06,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:34:06,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:06,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:34:06,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:34:06,264 INFO L87 Difference]: Start difference. First operand 288 states and 389 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 22:34:06,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:06,303 INFO L93 Difference]: Finished difference Result 456 states and 639 transitions. [2022-12-13 22:34:06,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:34:06,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 186 [2022-12-13 22:34:06,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:06,306 INFO L225 Difference]: With dead ends: 456 [2022-12-13 22:34:06,307 INFO L226 Difference]: Without dead ends: 267 [2022-12-13 22:34:06,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:34:06,308 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 30 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 495 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 [2022-12-13 22:34:06,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 495 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:06,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-12-13 22:34:06,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2022-12-13 22:34:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 212 states have (on average 1.2830188679245282) internal successors, (272), 216 states have internal predecessors, (272), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-12-13 22:34:06,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 358 transitions. [2022-12-13 22:34:06,319 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 358 transitions. Word has length 186 [2022-12-13 22:34:06,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:06,320 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 358 transitions. [2022-12-13 22:34:06,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 22:34:06,320 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 358 transitions. [2022-12-13 22:34:06,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-12-13 22:34:06,321 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:06,322 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1] [2022-12-13 22:34:06,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 22:34:06,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 22:34:06,522 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:06,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:06,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1901722937, now seen corresponding path program 1 times [2022-12-13 22:34:06,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:06,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287032963] [2022-12-13 22:34:06,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:06,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:34:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:34:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,677 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2022-12-13 22:34:06,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:06,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287032963] [2022-12-13 22:34:06,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287032963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:06,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:06,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:34:06,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784454764] [2022-12-13 22:34:06,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:06,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:34:06,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:06,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:34:06,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:34:06,679 INFO L87 Difference]: Start difference. First operand 267 states and 358 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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) [2022-12-13 22:34:06,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:06,707 INFO L93 Difference]: Finished difference Result 413 states and 580 transitions. [2022-12-13 22:34:06,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:34:06,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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 210 [2022-12-13 22:34:06,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:06,709 INFO L225 Difference]: With dead ends: 413 [2022-12-13 22:34:06,709 INFO L226 Difference]: Without dead ends: 273 [2022-12-13 22:34:06,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:34:06,710 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 6 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 764 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 [2022-12-13 22:34:06,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 764 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:06,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-12-13 22:34:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2022-12-13 22:34:06,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 215 states have (on average 1.2790697674418605) internal successors, (275), 219 states have internal predecessors, (275), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-12-13 22:34:06,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 361 transitions. [2022-12-13 22:34:06,719 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 361 transitions. Word has length 210 [2022-12-13 22:34:06,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:06,720 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 361 transitions. [2022-12-13 22:34:06,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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) [2022-12-13 22:34:06,720 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 361 transitions. [2022-12-13 22:34:06,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-12-13 22:34:06,722 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:06,723 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-12-13 22:34:06,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 22:34:06,723 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:06,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:06,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2012455842, now seen corresponding path program 1 times [2022-12-13 22:34:06,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:06,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821950067] [2022-12-13 22:34:06,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:06,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:34:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:34:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:34:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2022-12-13 22:34:06,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:06,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821950067] [2022-12-13 22:34:06,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821950067] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:34:06,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486898349] [2022-12-13 22:34:06,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:06,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:34:06,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:34:06,848 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:34:06,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 22:34:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:06,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 22:34:06,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:34:06,984 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2022-12-13 22:34:06,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:34:06,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486898349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:06,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 22:34:06,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-12-13 22:34:06,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915280086] [2022-12-13 22:34:06,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:06,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:34:06,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:06,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:34:06,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:34:06,986 INFO L87 Difference]: Start difference. First operand 271 states and 361 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, (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) [2022-12-13 22:34:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:07,019 INFO L93 Difference]: Finished difference Result 422 states and 587 transitions. [2022-12-13 22:34:07,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:34:07,020 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, (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 217 [2022-12-13 22:34:07,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:07,022 INFO L225 Difference]: With dead ends: 422 [2022-12-13 22:34:07,022 INFO L226 Difference]: Without dead ends: 278 [2022-12-13 22:34:07,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:34:07,023 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 7 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 769 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 [2022-12-13 22:34:07,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 769 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:07,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-12-13 22:34:07,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2022-12-13 22:34:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 219 states have (on average 1.273972602739726) internal successors, (279), 223 states have internal predecessors, (279), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-12-13 22:34:07,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 365 transitions. [2022-12-13 22:34:07,037 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 365 transitions. Word has length 217 [2022-12-13 22:34:07,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:07,038 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 365 transitions. [2022-12-13 22:34:07,038 INFO L496 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, (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) [2022-12-13 22:34:07,038 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 365 transitions. [2022-12-13 22:34:07,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-12-13 22:34:07,041 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:07,041 INFO L195 NwaCegarLoop]: 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] [2022-12-13 22:34:07,046 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 22:34:07,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:34:07,242 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:07,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:07,242 INFO L85 PathProgramCache]: Analyzing trace with hash -323224646, now seen corresponding path program 1 times [2022-12-13 22:34:07,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:07,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84342641] [2022-12-13 22:34:07,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:07,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:34:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:34:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:34:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:34:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2022-12-13 22:34:07,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:07,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84342641] [2022-12-13 22:34:07,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84342641] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:34:07,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145597496] [2022-12-13 22:34:07,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:07,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:34:07,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:34:07,423 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:34:07,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 22:34:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 22:34:07,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:34:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2022-12-13 22:34:07,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:34:07,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145597496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:07,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 22:34:07,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-12-13 22:34:07,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918666867] [2022-12-13 22:34:07,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:07,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:34:07,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:07,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:34:07,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:34:07,586 INFO L87 Difference]: Start difference. First operand 276 states and 365 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-12-13 22:34:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:07,614 INFO L93 Difference]: Finished difference Result 424 states and 585 transitions. [2022-12-13 22:34:07,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:34:07,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 225 [2022-12-13 22:34:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:07,616 INFO L225 Difference]: With dead ends: 424 [2022-12-13 22:34:07,616 INFO L226 Difference]: Without dead ends: 275 [2022-12-13 22:34:07,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:34:07,617 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 7 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 755 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 [2022-12-13 22:34:07,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 755 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:07,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-12-13 22:34:07,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2022-12-13 22:34:07,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 219 states have (on average 1.2602739726027397) internal successors, (276), 222 states have internal predecessors, (276), 42 states have call successors, (42), 13 states have call predecessors, (42), 13 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-12-13 22:34:07,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 360 transitions. [2022-12-13 22:34:07,628 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 360 transitions. Word has length 225 [2022-12-13 22:34:07,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:07,629 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 360 transitions. [2022-12-13 22:34:07,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-12-13 22:34:07,629 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 360 transitions. [2022-12-13 22:34:07,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-12-13 22:34:07,632 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:07,632 INFO L195 NwaCegarLoop]: 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] [2022-12-13 22:34:07,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 22:34:07,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:34:07,834 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:07,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:07,835 INFO L85 PathProgramCache]: Analyzing trace with hash -270122890, now seen corresponding path program 1 times [2022-12-13 22:34:07,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:07,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414144197] [2022-12-13 22:34:07,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:07,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:07,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:34:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:34:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:34:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:34:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 22:34:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2022-12-13 22:34:08,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:08,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414144197] [2022-12-13 22:34:08,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414144197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:08,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:08,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:34:08,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139979488] [2022-12-13 22:34:08,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:08,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:34:08,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:08,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:34:08,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:34:08,068 INFO L87 Difference]: Start difference. First operand 275 states and 360 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-13 22:34:08,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:08,297 INFO L93 Difference]: Finished difference Result 457 states and 636 transitions. [2022-12-13 22:34:08,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:34:08,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 232 [2022-12-13 22:34:08,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:08,300 INFO L225 Difference]: With dead ends: 457 [2022-12-13 22:34:08,300 INFO L226 Difference]: Without dead ends: 309 [2022-12-13 22:34:08,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:34:08,301 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 175 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 22:34:08,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 529 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 22:34:08,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-12-13 22:34:08,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 274. [2022-12-13 22:34:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 219 states have (on average 1.2557077625570776) internal successors, (275), 221 states have internal predecessors, (275), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-12-13 22:34:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 357 transitions. [2022-12-13 22:34:08,320 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 357 transitions. Word has length 232 [2022-12-13 22:34:08,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:08,321 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 357 transitions. [2022-12-13 22:34:08,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-13 22:34:08,321 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 357 transitions. [2022-12-13 22:34:08,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-12-13 22:34:08,324 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:08,324 INFO L195 NwaCegarLoop]: 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] [2022-12-13 22:34:08,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 22:34:08,325 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:08,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:08,325 INFO L85 PathProgramCache]: Analyzing trace with hash 28448745, now seen corresponding path program 1 times [2022-12-13 22:34:08,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:08,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827079506] [2022-12-13 22:34:08,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:08,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:34:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:34:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:34:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:34:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 22:34:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2022-12-13 22:34:08,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:08,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827079506] [2022-12-13 22:34:08,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827079506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:08,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:08,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:34:08,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519560954] [2022-12-13 22:34:08,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:08,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:34:08,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:08,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:34:08,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:34:08,500 INFO L87 Difference]: Start difference. First operand 274 states and 357 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 22:34:08,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:08,990 INFO L93 Difference]: Finished difference Result 634 states and 855 transitions. [2022-12-13 22:34:08,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 22:34:08,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 235 [2022-12-13 22:34:08,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:08,994 INFO L225 Difference]: With dead ends: 634 [2022-12-13 22:34:08,994 INFO L226 Difference]: Without dead ends: 487 [2022-12-13 22:34:08,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 22:34:08,995 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 421 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 22:34:08,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 653 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 22:34:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-12-13 22:34:09,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 481. [2022-12-13 22:34:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 379 states have (on average 1.3087071240105541) internal successors, (496), 381 states have internal predecessors, (496), 70 states have call successors, (70), 31 states have call predecessors, (70), 31 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2022-12-13 22:34:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 636 transitions. [2022-12-13 22:34:09,025 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 636 transitions. Word has length 235 [2022-12-13 22:34:09,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:09,025 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 636 transitions. [2022-12-13 22:34:09,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 22:34:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 636 transitions. [2022-12-13 22:34:09,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2022-12-13 22:34:09,027 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:09,027 INFO L195 NwaCegarLoop]: 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, 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] [2022-12-13 22:34:09,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 22:34:09,027 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:09,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:09,027 INFO L85 PathProgramCache]: Analyzing trace with hash 443330850, now seen corresponding path program 1 times [2022-12-13 22:34:09,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:09,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836536780] [2022-12-13 22:34:09,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:09,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:34:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:34:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:34:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:34:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 22:34:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-12-13 22:34:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-12-13 22:34:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-12-13 22:34:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-12-13 22:34:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2022-12-13 22:34:09,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:09,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836536780] [2022-12-13 22:34:09,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836536780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:09,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:09,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:34:09,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222094302] [2022-12-13 22:34:09,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:09,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:34:09,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:09,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:34:09,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:34:09,154 INFO L87 Difference]: Start difference. First operand 481 states and 636 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-12-13 22:34:09,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:09,615 INFO L93 Difference]: Finished difference Result 1052 states and 1442 transitions. [2022-12-13 22:34:09,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:34:09,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 266 [2022-12-13 22:34:09,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:09,621 INFO L225 Difference]: With dead ends: 1052 [2022-12-13 22:34:09,621 INFO L226 Difference]: Without dead ends: 770 [2022-12-13 22:34:09,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:34:09,622 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 224 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 22:34:09,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 494 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 22:34:09,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-12-13 22:34:09,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 601. [2022-12-13 22:34:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 474 states have (on average 1.3164556962025316) internal successors, (624), 480 states have internal predecessors, (624), 85 states have call successors, (85), 41 states have call predecessors, (85), 41 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2022-12-13 22:34:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 794 transitions. [2022-12-13 22:34:09,675 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 794 transitions. Word has length 266 [2022-12-13 22:34:09,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:09,676 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 794 transitions. [2022-12-13 22:34:09,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-12-13 22:34:09,676 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 794 transitions. [2022-12-13 22:34:09,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-12-13 22:34:09,677 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:09,677 INFO L195 NwaCegarLoop]: 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, 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] [2022-12-13 22:34:09,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 22:34:09,677 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:09,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:09,678 INFO L85 PathProgramCache]: Analyzing trace with hash 363579022, now seen corresponding path program 1 times [2022-12-13 22:34:09,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:09,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321723277] [2022-12-13 22:34:09,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:09,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:34:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:34:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:34:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:34:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 22:34:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-12-13 22:34:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-12-13 22:34:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-12-13 22:34:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-12-13 22:34:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2022-12-13 22:34:09,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:09,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321723277] [2022-12-13 22:34:09,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321723277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:09,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:09,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:34:09,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454578371] [2022-12-13 22:34:09,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:09,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:34:09,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:09,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:34:09,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:34:09,779 INFO L87 Difference]: Start difference. First operand 601 states and 794 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-12-13 22:34:10,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:10,199 INFO L93 Difference]: Finished difference Result 1329 states and 1806 transitions. [2022-12-13 22:34:10,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:34:10,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 267 [2022-12-13 22:34:10,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:10,205 INFO L225 Difference]: With dead ends: 1329 [2022-12-13 22:34:10,205 INFO L226 Difference]: Without dead ends: 960 [2022-12-13 22:34:10,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:34:10,207 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 225 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 22:34:10,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 519 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 22:34:10,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2022-12-13 22:34:10,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 952. [2022-12-13 22:34:10,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 745 states have (on average 1.3436241610738255) internal successors, (1001), 759 states have internal predecessors, (1001), 139 states have call successors, (139), 67 states have call predecessors, (139), 67 states have return successors, (139), 129 states have call predecessors, (139), 139 states have call successors, (139) [2022-12-13 22:34:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1279 transitions. [2022-12-13 22:34:10,277 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1279 transitions. Word has length 267 [2022-12-13 22:34:10,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:10,277 INFO L495 AbstractCegarLoop]: Abstraction has 952 states and 1279 transitions. [2022-12-13 22:34:10,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-12-13 22:34:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1279 transitions. [2022-12-13 22:34:10,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-12-13 22:34:10,279 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:10,279 INFO L195 NwaCegarLoop]: 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, 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] [2022-12-13 22:34:10,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 22:34:10,279 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:10,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:10,279 INFO L85 PathProgramCache]: Analyzing trace with hash -947160963, now seen corresponding path program 1 times [2022-12-13 22:34:10,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:10,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33387878] [2022-12-13 22:34:10,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:10,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:34:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:34:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:34:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:34:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 22:34:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-12-13 22:34:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 22:34:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-12-13 22:34:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-12-13 22:34:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2022-12-13 22:34:10,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:10,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33387878] [2022-12-13 22:34:10,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33387878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:10,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:10,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:34:10,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154668458] [2022-12-13 22:34:10,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:10,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:34:10,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:10,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:34:10,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:34:10,402 INFO L87 Difference]: Start difference. First operand 952 states and 1279 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 22:34:10,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:10,846 INFO L93 Difference]: Finished difference Result 2220 states and 3057 transitions. [2022-12-13 22:34:10,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:34:10,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 268 [2022-12-13 22:34:10,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:10,851 INFO L225 Difference]: With dead ends: 2220 [2022-12-13 22:34:10,851 INFO L226 Difference]: Without dead ends: 1540 [2022-12-13 22:34:10,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:34:10,853 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 225 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 22:34:10,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 543 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 22:34:10,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2022-12-13 22:34:10,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1526. [2022-12-13 22:34:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1187 states have (on average 1.3689974726200504) internal successors, (1625), 1215 states have internal predecessors, (1625), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2022-12-13 22:34:10,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 2087 transitions. [2022-12-13 22:34:10,937 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 2087 transitions. Word has length 268 [2022-12-13 22:34:10,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:10,937 INFO L495 AbstractCegarLoop]: Abstraction has 1526 states and 2087 transitions. [2022-12-13 22:34:10,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 22:34:10,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 2087 transitions. [2022-12-13 22:34:10,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-12-13 22:34:10,939 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:10,939 INFO L195 NwaCegarLoop]: 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, 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] [2022-12-13 22:34:10,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 22:34:10,939 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:10,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:10,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1341527749, now seen corresponding path program 1 times [2022-12-13 22:34:10,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:10,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516375080] [2022-12-13 22:34:10,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:10,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:34:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:34:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:34:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:34:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 22:34:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-12-13 22:34:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 22:34:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-12-13 22:34:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-12-13 22:34:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2022-12-13 22:34:11,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:11,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516375080] [2022-12-13 22:34:11,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516375080] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:34:11,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782327257] [2022-12-13 22:34:11,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:11,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:34:11,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:34:11,123 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:34:11,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 22:34:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 22:34:11,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:34:11,299 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2022-12-13 22:34:11,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:34:11,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782327257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:11,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 22:34:11,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-12-13 22:34:11,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512806238] [2022-12-13 22:34:11,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:11,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:34:11,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:11,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:34:11,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 22:34:11,300 INFO L87 Difference]: Start difference. First operand 1526 states and 2087 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2022-12-13 22:34:11,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:11,451 INFO L93 Difference]: Finished difference Result 2820 states and 3914 transitions. [2022-12-13 22:34:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:34:11,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 268 [2022-12-13 22:34:11,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:11,456 INFO L225 Difference]: With dead ends: 2820 [2022-12-13 22:34:11,456 INFO L226 Difference]: Without dead ends: 1526 [2022-12-13 22:34:11,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 22:34:11,458 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 51 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 672 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.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:34:11,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 672 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:11,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2022-12-13 22:34:11,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1526. [2022-12-13 22:34:11,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1187 states have (on average 1.3487784330244312) internal successors, (1601), 1215 states have internal predecessors, (1601), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2022-12-13 22:34:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 2063 transitions. [2022-12-13 22:34:11,541 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 2063 transitions. Word has length 268 [2022-12-13 22:34:11,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:11,542 INFO L495 AbstractCegarLoop]: Abstraction has 1526 states and 2063 transitions. [2022-12-13 22:34:11,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2022-12-13 22:34:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 2063 transitions. [2022-12-13 22:34:11,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-12-13 22:34:11,543 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:11,544 INFO L195 NwaCegarLoop]: 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, 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] [2022-12-13 22:34:11,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 22:34:11,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 22:34:11,744 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:11,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:11,745 INFO L85 PathProgramCache]: Analyzing trace with hash 731956630, now seen corresponding path program 1 times [2022-12-13 22:34:11,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:11,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313059152] [2022-12-13 22:34:11,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:11,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:34:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:34:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:34:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:34:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 22:34:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-12-13 22:34:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 22:34:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-12-13 22:34:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-12-13 22:34:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2022-12-13 22:34:11,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:11,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313059152] [2022-12-13 22:34:11,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313059152] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:34:11,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686971946] [2022-12-13 22:34:11,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:11,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:34:11,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:34:11,938 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:34:11,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 22:34:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 22:34:12,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:34:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2022-12-13 22:34:12,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:34:12,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686971946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:12,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 22:34:12,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-12-13 22:34:12,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415752364] [2022-12-13 22:34:12,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:12,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:34:12,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:12,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:34:12,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 22:34:12,088 INFO L87 Difference]: Start difference. First operand 1526 states and 2063 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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) [2022-12-13 22:34:12,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:12,196 INFO L93 Difference]: Finished difference Result 2820 states and 3858 transitions. [2022-12-13 22:34:12,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:34:12,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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 269 [2022-12-13 22:34:12,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:12,201 INFO L225 Difference]: With dead ends: 2820 [2022-12-13 22:34:12,201 INFO L226 Difference]: Without dead ends: 1574 [2022-12-13 22:34:12,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 22:34:12,203 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 15 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 695 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 [2022-12-13 22:34:12,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 695 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:12,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2022-12-13 22:34:12,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1574. [2022-12-13 22:34:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1227 states have (on average 1.3504482477587612) internal successors, (1657), 1255 states have internal predecessors, (1657), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2022-12-13 22:34:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 2119 transitions. [2022-12-13 22:34:12,285 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 2119 transitions. Word has length 269 [2022-12-13 22:34:12,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:12,285 INFO L495 AbstractCegarLoop]: Abstraction has 1574 states and 2119 transitions. [2022-12-13 22:34:12,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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) [2022-12-13 22:34:12,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 2119 transitions. [2022-12-13 22:34:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-12-13 22:34:12,287 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:12,287 INFO L195 NwaCegarLoop]: 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, 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] [2022-12-13 22:34:12,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 22:34:12,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 22:34:12,488 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:12,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:12,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1189094123, now seen corresponding path program 1 times [2022-12-13 22:34:12,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:12,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598623154] [2022-12-13 22:34:12,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:12,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:34:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:34:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:34:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:34:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 22:34:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-12-13 22:34:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 22:34:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-12-13 22:34:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-12-13 22:34:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:12,823 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2022-12-13 22:34:12,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:12,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598623154] [2022-12-13 22:34:12,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598623154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:12,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:12,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 22:34:12,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027507536] [2022-12-13 22:34:12,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:12,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 22:34:12,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:12,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 22:34:12,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:34:12,825 INFO L87 Difference]: Start difference. First operand 1574 states and 2119 transitions. Second operand has 7 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-12-13 22:34:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:13,425 INFO L93 Difference]: Finished difference Result 2404 states and 3466 transitions. [2022-12-13 22:34:13,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 22:34:13,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 270 [2022-12-13 22:34:13,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:13,433 INFO L225 Difference]: With dead ends: 2404 [2022-12-13 22:34:13,433 INFO L226 Difference]: Without dead ends: 2402 [2022-12-13 22:34:13,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 22:34:13,434 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 234 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 22:34:13,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 1490 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 22:34:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2022-12-13 22:34:13,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 1622. [2022-12-13 22:34:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1259 states have (on average 1.34154090548054) internal successors, (1689), 1295 states have internal predecessors, (1689), 239 states have call successors, (239), 123 states have call predecessors, (239), 123 states have return successors, (239), 211 states have call predecessors, (239), 239 states have call successors, (239) [2022-12-13 22:34:13,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2167 transitions. [2022-12-13 22:34:13,576 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2167 transitions. Word has length 270 [2022-12-13 22:34:13,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:13,576 INFO L495 AbstractCegarLoop]: Abstraction has 1622 states and 2167 transitions. [2022-12-13 22:34:13,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-12-13 22:34:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2167 transitions. [2022-12-13 22:34:13,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2022-12-13 22:34:13,578 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:13,578 INFO L195 NwaCegarLoop]: 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, 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] [2022-12-13 22:34:13,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 22:34:13,578 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:13,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:13,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1337818136, now seen corresponding path program 1 times [2022-12-13 22:34:13,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:13,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671528780] [2022-12-13 22:34:13,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:13,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:34:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:34:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:34:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:34:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 22:34:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-12-13 22:34:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 22:34:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-12-13 22:34:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-12-13 22:34:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-12-13 22:34:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,834 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2022-12-13 22:34:13,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:13,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671528780] [2022-12-13 22:34:13,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671528780] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:34:13,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283754870] [2022-12-13 22:34:13,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:13,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:34:13,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:34:13,836 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:34:13,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 22:34:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:13,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 22:34:13,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:34:14,149 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 251 proven. 37 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-12-13 22:34:14,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:34:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2022-12-13 22:34:14,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283754870] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:34:14,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:34:14,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2022-12-13 22:34:14,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439529156] [2022-12-13 22:34:14,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:34:14,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 22:34:14,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:14,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 22:34:14,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-12-13 22:34:14,464 INFO L87 Difference]: Start difference. First operand 1622 states and 2167 transitions. Second operand has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 14 states have internal predecessors, (151), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2022-12-13 22:34:16,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:16,498 INFO L93 Difference]: Finished difference Result 4724 states and 6830 transitions. [2022-12-13 22:34:16,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 22:34:16,498 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 14 states have internal predecessors, (151), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) Word has length 278 [2022-12-13 22:34:16,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:16,513 INFO L225 Difference]: With dead ends: 4724 [2022-12-13 22:34:16,513 INFO L226 Difference]: Without dead ends: 3382 [2022-12-13 22:34:16,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 601 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 22:34:16,517 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 552 mSDsluCounter, 2372 mSDsCounter, 0 mSdLazyCounter, 2598 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 2667 SdHoareTripleChecker+Invalid, 2787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 2598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 22:34:16,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 2667 Invalid, 2787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 2598 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-13 22:34:16,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3382 states. [2022-12-13 22:34:16,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3382 to 2408. [2022-12-13 22:34:16,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2408 states, 1862 states have (on average 1.3286788399570355) internal successors, (2474), 1914 states have internal predecessors, (2474), 356 states have call successors, (356), 183 states have call predecessors, (356), 189 states have return successors, (364), 318 states have call predecessors, (364), 356 states have call successors, (364) [2022-12-13 22:34:16,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 3194 transitions. [2022-12-13 22:34:16,691 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 3194 transitions. Word has length 278 [2022-12-13 22:34:16,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:16,691 INFO L495 AbstractCegarLoop]: Abstraction has 2408 states and 3194 transitions. [2022-12-13 22:34:16,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 14 states have internal predecessors, (151), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2022-12-13 22:34:16,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 3194 transitions. [2022-12-13 22:34:16,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2022-12-13 22:34:16,694 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:16,694 INFO L195 NwaCegarLoop]: 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, 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] [2022-12-13 22:34:16,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 22:34:16,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 22:34:16,895 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:16,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:16,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1995535143, now seen corresponding path program 1 times [2022-12-13 22:34:16,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:16,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914885290] [2022-12-13 22:34:16,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:16,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:34:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:34:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:34:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:34:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 22:34:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-12-13 22:34:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:16,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 22:34:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-12-13 22:34:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-12-13 22:34:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-12-13 22:34:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2022-12-13 22:34:17,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:17,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914885290] [2022-12-13 22:34:17,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914885290] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:34:17,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025579801] [2022-12-13 22:34:17,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:17,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:34:17,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:34:17,015 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:34:17,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 22:34:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 22:34:17,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:34:17,162 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2022-12-13 22:34:17,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:34:17,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025579801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:17,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 22:34:17,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-12-13 22:34:17,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603936477] [2022-12-13 22:34:17,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:17,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:34:17,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:17,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:34:17,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:34:17,164 INFO L87 Difference]: Start difference. First operand 2408 states and 3194 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-12-13 22:34:17,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:17,410 INFO L93 Difference]: Finished difference Result 4649 states and 6264 transitions. [2022-12-13 22:34:17,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:34:17,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 278 [2022-12-13 22:34:17,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:17,417 INFO L225 Difference]: With dead ends: 4649 [2022-12-13 22:34:17,417 INFO L226 Difference]: Without dead ends: 2344 [2022-12-13 22:34:17,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:34:17,421 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 11 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 695 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 [2022-12-13 22:34:17,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 695 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:17,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2344 states. [2022-12-13 22:34:17,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2344 to 2344. [2022-12-13 22:34:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 1818 states have (on average 1.3113311331133113) internal successors, (2384), 1870 states have internal predecessors, (2384), 340 states have call successors, (340), 183 states have call predecessors, (340), 185 states have return successors, (344), 298 states have call predecessors, (344), 340 states have call successors, (344) [2022-12-13 22:34:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 3068 transitions. [2022-12-13 22:34:17,565 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 3068 transitions. Word has length 278 [2022-12-13 22:34:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:17,565 INFO L495 AbstractCegarLoop]: Abstraction has 2344 states and 3068 transitions. [2022-12-13 22:34:17,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-12-13 22:34:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3068 transitions. [2022-12-13 22:34:17,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2022-12-13 22:34:17,568 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:17,568 INFO L195 NwaCegarLoop]: 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, 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] [2022-12-13 22:34:17,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 22:34:17,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:34:17,769 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:17,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:17,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1834324692, now seen corresponding path program 1 times [2022-12-13 22:34:17,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:17,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397822076] [2022-12-13 22:34:17,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:17,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 22:34:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 22:34:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 22:34:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 22:34:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-12-13 22:34:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-12-13 22:34:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-12-13 22:34:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-12-13 22:34:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-12-13 22:34:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-12-13 22:34:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-12-13 22:34:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2022-12-13 22:34:17,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:17,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397822076] [2022-12-13 22:34:17,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397822076] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:34:17,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692213957] [2022-12-13 22:34:17,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:17,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:34:17,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:34:17,881 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:34:17,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 22:34:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:18,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 22:34:18,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:34:18,023 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2022-12-13 22:34:18,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:34:18,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692213957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:18,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 22:34:18,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-12-13 22:34:18,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344898422] [2022-12-13 22:34:18,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:18,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:34:18,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:18,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:34:18,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:34:18,025 INFO L87 Difference]: Start difference. First operand 2344 states and 3068 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-12-13 22:34:18,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:18,191 INFO L93 Difference]: Finished difference Result 4431 states and 5905 transitions. [2022-12-13 22:34:18,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:34:18,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 281 [2022-12-13 22:34:18,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:18,198 INFO L225 Difference]: With dead ends: 4431 [2022-12-13 22:34:18,199 INFO L226 Difference]: Without dead ends: 2172 [2022-12-13 22:34:18,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:34:18,203 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 8 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 698 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 [2022-12-13 22:34:18,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 698 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:34:18,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2022-12-13 22:34:18,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2172. [2022-12-13 22:34:18,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2172 states, 1676 states have (on average 1.3048926014319808) internal successors, (2187), 1728 states have internal predecessors, (2187), 323 states have call successors, (323), 172 states have call predecessors, (323), 172 states have return successors, (323), 279 states have call predecessors, (323), 323 states have call successors, (323) [2022-12-13 22:34:18,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 2833 transitions. [2022-12-13 22:34:18,419 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 2833 transitions. Word has length 281 [2022-12-13 22:34:18,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:18,419 INFO L495 AbstractCegarLoop]: Abstraction has 2172 states and 2833 transitions. [2022-12-13 22:34:18,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-12-13 22:34:18,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 2833 transitions. [2022-12-13 22:34:18,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-12-13 22:34:18,423 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:18,423 INFO L195 NwaCegarLoop]: 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, 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] [2022-12-13 22:34:18,428 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 22:34:18,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-13 22:34:18,624 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:18,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1939290951, now seen corresponding path program 1 times [2022-12-13 22:34:18,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:18,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999569455] [2022-12-13 22:34:18,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:18,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:18,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:18,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:18,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:18,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:18,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:18,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:18,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:18,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:18,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:18,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:18,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:19,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:19,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:19,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:19,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:19,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:34:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:19,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:34:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:19,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:34:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:19,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:34:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:19,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 22:34:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:19,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-12-13 22:34:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:19,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 22:34:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:19,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-12-13 22:34:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:19,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-12-13 22:34:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:19,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-12-13 22:34:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:19,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-12-13 22:34:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:19,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2022-12-13 22:34:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 16 proven. 146 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2022-12-13 22:34:19,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:19,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999569455] [2022-12-13 22:34:19,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999569455] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:34:19,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35382868] [2022-12-13 22:34:19,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:19,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:34:19,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:34:19,120 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:34:19,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 22:34:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:19,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 22:34:19,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:34:19,382 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2022-12-13 22:34:19,382 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:34:19,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35382868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:19,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 22:34:19,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2022-12-13 22:34:19,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438447204] [2022-12-13 22:34:19,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:19,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 22:34:19,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:19,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 22:34:19,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2022-12-13 22:34:19,384 INFO L87 Difference]: Start difference. First operand 2172 states and 2833 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2022-12-13 22:34:19,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:19,810 INFO L93 Difference]: Finished difference Result 5326 states and 7176 transitions. [2022-12-13 22:34:19,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 22:34:19,810 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 293 [2022-12-13 22:34:19,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:19,819 INFO L225 Difference]: With dead ends: 5326 [2022-12-13 22:34:19,819 INFO L226 Difference]: Without dead ends: 3720 [2022-12-13 22:34:19,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2022-12-13 22:34:19,822 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 363 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1930 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 22:34:19,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1930 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 22:34:19,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3720 states. [2022-12-13 22:34:20,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3720 to 3182. [2022-12-13 22:34:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3182 states, 2447 states have (on average 1.298324478953821) internal successors, (3177), 2527 states have internal predecessors, (3177), 467 states have call successors, (467), 267 states have call predecessors, (467), 267 states have return successors, (467), 395 states have call predecessors, (467), 467 states have call successors, (467) [2022-12-13 22:34:20,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 4111 transitions. [2022-12-13 22:34:20,025 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 4111 transitions. Word has length 293 [2022-12-13 22:34:20,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:20,026 INFO L495 AbstractCegarLoop]: Abstraction has 3182 states and 4111 transitions. [2022-12-13 22:34:20,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2022-12-13 22:34:20,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4111 transitions. [2022-12-13 22:34:20,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-12-13 22:34:20,028 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:20,028 INFO L195 NwaCegarLoop]: 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, 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] [2022-12-13 22:34:20,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 22:34:20,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:34:20,229 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:20,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:20,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1839544214, now seen corresponding path program 1 times [2022-12-13 22:34:20,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:20,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389969169] [2022-12-13 22:34:20,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:20,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:34:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:34:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:34:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:34:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 22:34:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-12-13 22:34:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 22:34:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-12-13 22:34:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-12-13 22:34:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-12-13 22:34:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-12-13 22:34:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2022-12-13 22:34:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:20,404 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2022-12-13 22:34:20,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:20,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389969169] [2022-12-13 22:34:20,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389969169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:20,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:20,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 22:34:20,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437971342] [2022-12-13 22:34:20,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:20,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 22:34:20,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:20,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 22:34:20,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:34:20,406 INFO L87 Difference]: Start difference. First operand 3182 states and 4111 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 5 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) [2022-12-13 22:34:21,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:21,477 INFO L93 Difference]: Finished difference Result 9758 states and 14097 transitions. [2022-12-13 22:34:21,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:34:21,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 5 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 299 [2022-12-13 22:34:21,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:21,494 INFO L225 Difference]: With dead ends: 9758 [2022-12-13 22:34:21,494 INFO L226 Difference]: Without dead ends: 7082 [2022-12-13 22:34:21,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:34:21,498 INFO L413 NwaCegarLoop]: 554 mSDtfsCounter, 454 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 22:34:21,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1775 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 22:34:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7082 states. [2022-12-13 22:34:21,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7082 to 3438. [2022-12-13 22:34:21,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3438 states, 2655 states have (on average 1.3111111111111111) internal successors, (3481), 2735 states have internal predecessors, (3481), 515 states have call successors, (515), 267 states have call predecessors, (515), 267 states have return successors, (515), 443 states have call predecessors, (515), 515 states have call successors, (515) [2022-12-13 22:34:21,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 4511 transitions. [2022-12-13 22:34:21,769 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 4511 transitions. Word has length 299 [2022-12-13 22:34:21,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:21,770 INFO L495 AbstractCegarLoop]: Abstraction has 3438 states and 4511 transitions. [2022-12-13 22:34:21,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 5 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) [2022-12-13 22:34:21,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 4511 transitions. [2022-12-13 22:34:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-12-13 22:34:21,771 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:21,771 INFO L195 NwaCegarLoop]: 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, 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] [2022-12-13 22:34:21,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 22:34:21,772 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:21,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash 9129234, now seen corresponding path program 1 times [2022-12-13 22:34:21,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:21,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030144518] [2022-12-13 22:34:21,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:21,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:34:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:34:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:34:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:34:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 22:34:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-12-13 22:34:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 22:34:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-12-13 22:34:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-12-13 22:34:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-12-13 22:34:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-12-13 22:34:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2022-12-13 22:34:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2022-12-13 22:34:21,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:21,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030144518] [2022-12-13 22:34:21,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030144518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:21,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:21,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 22:34:21,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622690468] [2022-12-13 22:34:21,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:21,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:34:21,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:21,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:34:21,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:34:21,942 INFO L87 Difference]: Start difference. First operand 3438 states and 4511 transitions. Second operand has 6 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2022-12-13 22:34:22,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:22,452 INFO L93 Difference]: Finished difference Result 6215 states and 8207 transitions. [2022-12-13 22:34:22,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:34:22,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 299 [2022-12-13 22:34:22,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:22,461 INFO L225 Difference]: With dead ends: 6215 [2022-12-13 22:34:22,461 INFO L226 Difference]: Without dead ends: 3384 [2022-12-13 22:34:22,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 22:34:22,465 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 63 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 22:34:22,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 781 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 22:34:22,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2022-12-13 22:34:22,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 3384. [2022-12-13 22:34:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3384 states, 2610 states have (on average 1.3080459770114943) internal successors, (3414), 2685 states have internal predecessors, (3414), 511 states have call successors, (511), 263 states have call predecessors, (511), 262 states have return successors, (510), 442 states have call predecessors, (510), 510 states have call successors, (510) [2022-12-13 22:34:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 4435 transitions. [2022-12-13 22:34:22,732 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 4435 transitions. Word has length 299 [2022-12-13 22:34:22,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:22,732 INFO L495 AbstractCegarLoop]: Abstraction has 3384 states and 4435 transitions. [2022-12-13 22:34:22,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2022-12-13 22:34:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 4435 transitions. [2022-12-13 22:34:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2022-12-13 22:34:22,734 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:22,734 INFO L195 NwaCegarLoop]: 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, 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] [2022-12-13 22:34:22,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 22:34:22,734 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:22,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:22,735 INFO L85 PathProgramCache]: Analyzing trace with hash -788096576, now seen corresponding path program 1 times [2022-12-13 22:34:22,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:22,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953256920] [2022-12-13 22:34:22,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:22,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:22,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:22,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:22,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:22,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:22,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:22,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:22,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:22,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:22,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:22,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:22,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:22,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:22,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:22,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:22,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:22,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:34:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:22,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:34:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:23,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:34:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:23,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:34:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:23,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-12-13 22:34:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:23,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-12-13 22:34:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:23,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 22:34:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:23,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-12-13 22:34:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:23,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-12-13 22:34:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:23,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-12-13 22:34:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:23,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-12-13 22:34:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:23,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-12-13 22:34:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:23,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-12-13 22:34:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:23,041 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2022-12-13 22:34:23,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:23,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953256920] [2022-12-13 22:34:23,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953256920] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:34:23,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266328126] [2022-12-13 22:34:23,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:23,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:34:23,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:34:23,043 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:34:23,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 22:34:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:23,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 22:34:23,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:34:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 189 proven. 4 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2022-12-13 22:34:23,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:34:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2022-12-13 22:34:23,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266328126] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 22:34:23,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 22:34:23,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 10] total 21 [2022-12-13 22:34:23,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707211752] [2022-12-13 22:34:23,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:23,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 22:34:23,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:23,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 22:34:23,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2022-12-13 22:34:23,422 INFO L87 Difference]: Start difference. First operand 3384 states and 4435 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 9 states have internal predecessors, (98), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2022-12-13 22:34:25,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:25,136 INFO L93 Difference]: Finished difference Result 12710 states and 17414 transitions. [2022-12-13 22:34:25,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 22:34:25,137 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 9 states have internal predecessors, (98), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 304 [2022-12-13 22:34:25,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:25,156 INFO L225 Difference]: With dead ends: 12710 [2022-12-13 22:34:25,156 INFO L226 Difference]: Without dead ends: 9846 [2022-12-13 22:34:25,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 655 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=1377, Unknown=0, NotChecked=0, Total=1560 [2022-12-13 22:34:25,161 INFO L413 NwaCegarLoop]: 529 mSDtfsCounter, 1180 mSDsluCounter, 3083 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 3612 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 22:34:25,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 3612 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 22:34:25,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9846 states. [2022-12-13 22:34:25,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9846 to 5490. [2022-12-13 22:34:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5490 states, 4214 states have (on average 1.3028001898433792) internal successors, (5490), 4334 states have internal predecessors, (5490), 852 states have call successors, (852), 424 states have call predecessors, (852), 423 states have return successors, (851), 738 states have call predecessors, (851), 851 states have call successors, (851) [2022-12-13 22:34:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5490 states to 5490 states and 7193 transitions. [2022-12-13 22:34:25,635 INFO L78 Accepts]: Start accepts. Automaton has 5490 states and 7193 transitions. Word has length 304 [2022-12-13 22:34:25,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:25,636 INFO L495 AbstractCegarLoop]: Abstraction has 5490 states and 7193 transitions. [2022-12-13 22:34:25,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 9 states have internal predecessors, (98), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2022-12-13 22:34:25,636 INFO L276 IsEmpty]: Start isEmpty. Operand 5490 states and 7193 transitions. [2022-12-13 22:34:25,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2022-12-13 22:34:25,638 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:25,638 INFO L195 NwaCegarLoop]: 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, 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] [2022-12-13 22:34:25,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 22:34:25,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-13 22:34:25,838 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:25,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:25,838 INFO L85 PathProgramCache]: Analyzing trace with hash -112763456, now seen corresponding path program 1 times [2022-12-13 22:34:25,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:25,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253770575] [2022-12-13 22:34:25,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:25,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:34:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:34:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:34:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:34:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-12-13 22:34:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-12-13 22:34:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 22:34:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-12-13 22:34:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-12-13 22:34:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-12-13 22:34:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-12-13 22:34:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-12-13 22:34:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-12-13 22:34:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2022-12-13 22:34:26,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:26,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253770575] [2022-12-13 22:34:26,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253770575] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:34:26,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158135783] [2022-12-13 22:34:26,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:26,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:34:26,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:34:26,154 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:34:26,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 22:34:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:26,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 22:34:26,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:34:26,350 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2022-12-13 22:34:26,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:34:26,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158135783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:26,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 22:34:26,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 15 [2022-12-13 22:34:26,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423277234] [2022-12-13 22:34:26,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:26,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 22:34:26,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:26,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 22:34:26,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-12-13 22:34:26,352 INFO L87 Difference]: Start difference. First operand 5490 states and 7193 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2022-12-13 22:34:27,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:27,549 INFO L93 Difference]: Finished difference Result 12314 states and 16769 transitions. [2022-12-13 22:34:27,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 22:34:27,550 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 304 [2022-12-13 22:34:27,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:27,568 INFO L225 Difference]: With dead ends: 12314 [2022-12-13 22:34:27,568 INFO L226 Difference]: Without dead ends: 7296 [2022-12-13 22:34:27,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-12-13 22:34:27,576 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 392 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 2190 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 22:34:27,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 2190 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 22:34:27,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7296 states. [2022-12-13 22:34:28,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7296 to 5326. [2022-12-13 22:34:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5326 states, 4090 states have (on average 1.2953545232273838) internal successors, (5298), 4206 states have internal predecessors, (5298), 816 states have call successors, (816), 420 states have call predecessors, (816), 419 states have return successors, (815), 706 states have call predecessors, (815), 815 states have call successors, (815) [2022-12-13 22:34:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5326 states to 5326 states and 6929 transitions. [2022-12-13 22:34:28,057 INFO L78 Accepts]: Start accepts. Automaton has 5326 states and 6929 transitions. Word has length 304 [2022-12-13 22:34:28,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:28,058 INFO L495 AbstractCegarLoop]: Abstraction has 5326 states and 6929 transitions. [2022-12-13 22:34:28,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2022-12-13 22:34:28,058 INFO L276 IsEmpty]: Start isEmpty. Operand 5326 states and 6929 transitions. [2022-12-13 22:34:28,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2022-12-13 22:34:28,059 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:28,060 INFO L195 NwaCegarLoop]: 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:34:28,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 22:34:28,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:34:28,260 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:28,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:28,260 INFO L85 PathProgramCache]: Analyzing trace with hash -446467712, now seen corresponding path program 1 times [2022-12-13 22:34:28,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:28,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383824107] [2022-12-13 22:34:28,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:28,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:34:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:34:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:34:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:34:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-12-13 22:34:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-12-13 22:34:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 22:34:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-12-13 22:34:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-12-13 22:34:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-12-13 22:34:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-12-13 22:34:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-12-13 22:34:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2022-12-13 22:34:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-12-13 22:34:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:28,381 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2022-12-13 22:34:28,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:28,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383824107] [2022-12-13 22:34:28,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383824107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:34:28,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:34:28,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:34:28,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049656330] [2022-12-13 22:34:28,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:34:28,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:34:28,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:28,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:34:28,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:34:28,383 INFO L87 Difference]: Start difference. First operand 5326 states and 6929 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-12-13 22:34:29,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:34:29,264 INFO L93 Difference]: Finished difference Result 8964 states and 11706 transitions. [2022-12-13 22:34:29,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 22:34:29,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 311 [2022-12-13 22:34:29,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:34:29,275 INFO L225 Difference]: With dead ends: 8964 [2022-12-13 22:34:29,275 INFO L226 Difference]: Without dead ends: 4406 [2022-12-13 22:34:29,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 22:34:29,283 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 475 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 22:34:29,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 782 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 22:34:29,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4406 states. [2022-12-13 22:34:29,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4406 to 4380. [2022-12-13 22:34:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4380 states, 3369 states have (on average 1.2766399525081626) internal successors, (4301), 3463 states have internal predecessors, (4301), 665 states have call successors, (665), 345 states have call predecessors, (665), 345 states have return successors, (665), 571 states have call predecessors, (665), 665 states have call successors, (665) [2022-12-13 22:34:29,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4380 states to 4380 states and 5631 transitions. [2022-12-13 22:34:29,671 INFO L78 Accepts]: Start accepts. Automaton has 4380 states and 5631 transitions. Word has length 311 [2022-12-13 22:34:29,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:34:29,671 INFO L495 AbstractCegarLoop]: Abstraction has 4380 states and 5631 transitions. [2022-12-13 22:34:29,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-12-13 22:34:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand 4380 states and 5631 transitions. [2022-12-13 22:34:29,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2022-12-13 22:34:29,675 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:34:29,675 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 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, 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] [2022-12-13 22:34:29,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 22:34:29,675 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:34:29,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:34:29,675 INFO L85 PathProgramCache]: Analyzing trace with hash -409137599, now seen corresponding path program 1 times [2022-12-13 22:34:29,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:34:29,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988552401] [2022-12-13 22:34:29,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:29,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:34:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:34:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:34:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:34:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:34:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:34:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:34:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:34:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:34:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:34:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:34:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:34:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:34:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:34:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:34:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:34:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:34:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:34:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:34:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-12-13 22:34:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-12-13 22:34:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 22:34:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-12-13 22:34:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-12-13 22:34:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-12-13 22:34:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-12-13 22:34:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-12-13 22:34:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2022-12-13 22:34:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-12-13 22:34:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-12-13 22:34:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-12-13 22:34:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-12-13 22:34:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-12-13 22:34:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2022-12-13 22:34:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2022-12-13 22:34:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,469 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2022-12-13 22:34:30,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:34:30,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988552401] [2022-12-13 22:34:30,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988552401] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:34:30,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371591812] [2022-12-13 22:34:30,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:34:30,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:34:30,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:34:30,470 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:34:30,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 22:34:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:34:30,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 1299 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 22:34:30,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:34:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 240 proven. 91 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2022-12-13 22:34:30,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:34:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 34 proven. 71 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2022-12-13 22:34:31,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371591812] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:34:31,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:34:31,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 34 [2022-12-13 22:34:31,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797163457] [2022-12-13 22:34:31,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:34:31,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 22:34:31,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:34:31,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 22:34:31,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 22:34:31,460 INFO L87 Difference]: Start difference. First operand 4380 states and 5631 transitions. Second operand has 34 states, 34 states have (on average 7.205882352941177) internal successors, (245), 29 states have internal predecessors, (245), 10 states have call successors, (67), 9 states have call predecessors, (67), 15 states have return successors, (67), 14 states have call predecessors, (67), 10 states have call successors, (67) [2022-12-13 22:35:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:35:37,116 INFO L93 Difference]: Finished difference Result 59981 states and 84394 transitions. [2022-12-13 22:35:37,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 712 states. [2022-12-13 22:35:37,117 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.205882352941177) internal successors, (245), 29 states have internal predecessors, (245), 10 states have call successors, (67), 9 states have call predecessors, (67), 15 states have return successors, (67), 14 states have call predecessors, (67), 10 states have call successors, (67) Word has length 359 [2022-12-13 22:35:37,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:35:37,258 INFO L225 Difference]: With dead ends: 59981 [2022-12-13 22:35:37,258 INFO L226 Difference]: Without dead ends: 56005 [2022-12-13 22:35:37,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1555 GetRequests, 813 SyntacticMatches, 1 SemanticMatches, 741 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250261 ImplicationChecksByTransitivity, 36.9s TimeCoverageRelationStatistics Valid=28017, Invalid=523289, Unknown=0, NotChecked=0, Total=551306 [2022-12-13 22:35:37,335 INFO L413 NwaCegarLoop]: 975 mSDtfsCounter, 8416 mSDsluCounter, 16510 mSDsCounter, 0 mSdLazyCounter, 34058 mSolverCounterSat, 12407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8416 SdHoareTripleChecker+Valid, 17485 SdHoareTripleChecker+Invalid, 46465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 12407 IncrementalHoareTripleChecker+Valid, 34058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.3s IncrementalHoareTripleChecker+Time [2022-12-13 22:35:37,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8416 Valid, 17485 Invalid, 46465 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [12407 Valid, 34058 Invalid, 0 Unknown, 0 Unchecked, 19.3s Time] [2022-12-13 22:35:37,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56005 states. [2022-12-13 22:35:39,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56005 to 9660. [2022-12-13 22:35:39,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9660 states, 7405 states have (on average 1.2515867656988522) internal successors, (9268), 7603 states have internal predecessors, (9268), 1473 states have call successors, (1473), 737 states have call predecessors, (1473), 781 states have return successors, (1535), 1319 states have call predecessors, (1535), 1473 states have call successors, (1535) [2022-12-13 22:35:39,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9660 states to 9660 states and 12276 transitions. [2022-12-13 22:35:39,592 INFO L78 Accepts]: Start accepts. Automaton has 9660 states and 12276 transitions. Word has length 359 [2022-12-13 22:35:39,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:35:39,592 INFO L495 AbstractCegarLoop]: Abstraction has 9660 states and 12276 transitions. [2022-12-13 22:35:39,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.205882352941177) internal successors, (245), 29 states have internal predecessors, (245), 10 states have call successors, (67), 9 states have call predecessors, (67), 15 states have return successors, (67), 14 states have call predecessors, (67), 10 states have call successors, (67) [2022-12-13 22:35:39,592 INFO L276 IsEmpty]: Start isEmpty. Operand 9660 states and 12276 transitions. [2022-12-13 22:35:39,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2022-12-13 22:35:39,602 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:35:39,602 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:35:39,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 22:35:39,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-13 22:35:39,803 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:35:39,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:35:39,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1100506943, now seen corresponding path program 1 times [2022-12-13 22:35:39,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:35:39,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995539534] [2022-12-13 22:35:39,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:35:39,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:35:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:35:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:35:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:35:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:35:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:35:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:35:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:35:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:35:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:35:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:35:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:35:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:35:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:35:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:35:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:35:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:35:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:35:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:35:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:35:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 22:35:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-12-13 22:35:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-12-13 22:35:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-12-13 22:35:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-12-13 22:35:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-12-13 22:35:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-12-13 22:35:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-12-13 22:35:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-12-13 22:35:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-12-13 22:35:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-12-13 22:35:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2022-12-13 22:35:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2022-12-13 22:35:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2022-12-13 22:35:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2022-12-13 22:35:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2022-12-13 22:35:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2022-12-13 22:35:40,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:35:40,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995539534] [2022-12-13 22:35:40,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995539534] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:35:40,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215427764] [2022-12-13 22:35:40,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:35:40,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:35:40,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:35:40,717 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:35:40,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 22:35:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:35:40,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 1300 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 22:35:40,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:35:41,206 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 206 proven. 118 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2022-12-13 22:35:41,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:35:41,704 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 33 proven. 69 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2022-12-13 22:35:41,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215427764] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:35:41,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:35:41,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 41 [2022-12-13 22:35:41,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925763308] [2022-12-13 22:35:41,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:35:41,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-13 22:35:41,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:35:41,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-13 22:35:41,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1535, Unknown=0, NotChecked=0, Total=1640 [2022-12-13 22:35:41,707 INFO L87 Difference]: Start difference. First operand 9660 states and 12276 transitions. Second operand has 41 states, 41 states have (on average 6.0) internal successors, (246), 35 states have internal predecessors, (246), 11 states have call successors, (68), 9 states have call predecessors, (68), 14 states have return successors, (68), 16 states have call predecessors, (68), 11 states have call successors, (68) [2022-12-13 22:36:11,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:36:11,565 INFO L93 Difference]: Finished difference Result 30248 states and 39247 transitions. [2022-12-13 22:36:11,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 298 states. [2022-12-13 22:36:11,566 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 6.0) internal successors, (246), 35 states have internal predecessors, (246), 11 states have call successors, (68), 9 states have call predecessors, (68), 14 states have return successors, (68), 16 states have call predecessors, (68), 11 states have call successors, (68) Word has length 360 [2022-12-13 22:36:11,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:36:11,600 INFO L225 Difference]: With dead ends: 30248 [2022-12-13 22:36:11,600 INFO L226 Difference]: Without dead ends: 21404 [2022-12-13 22:36:11,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1130 GetRequests, 796 SyntacticMatches, 1 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42730 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=6929, Invalid=104961, Unknown=0, NotChecked=0, Total=111890 [2022-12-13 22:36:11,617 INFO L413 NwaCegarLoop]: 978 mSDtfsCounter, 5337 mSDsluCounter, 22305 mSDsCounter, 0 mSdLazyCounter, 32539 mSolverCounterSat, 3595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5338 SdHoareTripleChecker+Valid, 23283 SdHoareTripleChecker+Invalid, 36134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3595 IncrementalHoareTripleChecker+Valid, 32539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2022-12-13 22:36:11,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5338 Valid, 23283 Invalid, 36134 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3595 Valid, 32539 Invalid, 0 Unknown, 0 Unchecked, 14.3s Time] [2022-12-13 22:36:11,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21404 states. [2022-12-13 22:36:13,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21404 to 8611. [2022-12-13 22:36:13,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8611 states, 6621 states have (on average 1.2360670593565926) internal successors, (8184), 6810 states have internal predecessors, (8184), 1244 states have call successors, (1244), 699 states have call predecessors, (1244), 745 states have return successors, (1302), 1101 states have call predecessors, (1302), 1244 states have call successors, (1302) [2022-12-13 22:36:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8611 states to 8611 states and 10730 transitions. [2022-12-13 22:36:13,544 INFO L78 Accepts]: Start accepts. Automaton has 8611 states and 10730 transitions. Word has length 360 [2022-12-13 22:36:13,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:36:13,545 INFO L495 AbstractCegarLoop]: Abstraction has 8611 states and 10730 transitions. [2022-12-13 22:36:13,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.0) internal successors, (246), 35 states have internal predecessors, (246), 11 states have call successors, (68), 9 states have call predecessors, (68), 14 states have return successors, (68), 16 states have call predecessors, (68), 11 states have call successors, (68) [2022-12-13 22:36:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 8611 states and 10730 transitions. [2022-12-13 22:36:13,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2022-12-13 22:36:13,553 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:36:13,553 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 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, 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] [2022-12-13 22:36:13,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 22:36:13,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-13 22:36:13,755 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:36:13,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:36:13,755 INFO L85 PathProgramCache]: Analyzing trace with hash 182416949, now seen corresponding path program 1 times [2022-12-13 22:36:13,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:36:13,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856451969] [2022-12-13 22:36:13,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:36:13,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:36:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:36:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:36:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:36:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:36:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:36:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:36:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:36:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:36:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:36:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:36:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:36:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:36:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:36:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:36:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:36:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:36:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:36:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:36:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:36:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 22:36:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-12-13 22:36:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-12-13 22:36:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-12-13 22:36:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-12-13 22:36:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-12-13 22:36:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-12-13 22:36:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-12-13 22:36:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-12-13 22:36:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-12-13 22:36:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-12-13 22:36:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2022-12-13 22:36:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2022-12-13 22:36:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2022-12-13 22:36:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-12-13 22:36:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2022-12-13 22:36:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:13,904 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2022-12-13 22:36:13,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:36:13,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856451969] [2022-12-13 22:36:13,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856451969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:36:13,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:36:13,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:36:13,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975153853] [2022-12-13 22:36:13,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:36:13,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:36:13,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:36:13,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:36:13,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:36:13,905 INFO L87 Difference]: Start difference. First operand 8611 states and 10730 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-12-13 22:36:15,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:36:15,905 INFO L93 Difference]: Finished difference Result 17487 states and 21743 transitions. [2022-12-13 22:36:15,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:36:15,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 361 [2022-12-13 22:36:15,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:36:15,918 INFO L225 Difference]: With dead ends: 17487 [2022-12-13 22:36:15,918 INFO L226 Difference]: Without dead ends: 8487 [2022-12-13 22:36:15,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 22:36:15,926 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 114 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 22:36:15,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 602 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 22:36:15,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8487 states. [2022-12-13 22:36:17,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8487 to 8487. [2022-12-13 22:36:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8487 states, 6543 states have (on average 1.2057160324010392) internal successors, (7889), 6702 states have internal predecessors, (7889), 1244 states have call successors, (1244), 699 states have call predecessors, (1244), 699 states have return successors, (1244), 1085 states have call predecessors, (1244), 1244 states have call successors, (1244) [2022-12-13 22:36:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8487 states to 8487 states and 10377 transitions. [2022-12-13 22:36:17,735 INFO L78 Accepts]: Start accepts. Automaton has 8487 states and 10377 transitions. Word has length 361 [2022-12-13 22:36:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:36:17,735 INFO L495 AbstractCegarLoop]: Abstraction has 8487 states and 10377 transitions. [2022-12-13 22:36:17,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-12-13 22:36:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 8487 states and 10377 transitions. [2022-12-13 22:36:17,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2022-12-13 22:36:17,745 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:36:17,745 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 22:36:17,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 22:36:17,745 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:36:17,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:36:17,745 INFO L85 PathProgramCache]: Analyzing trace with hash 889989627, now seen corresponding path program 1 times [2022-12-13 22:36:17,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:36:17,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782987613] [2022-12-13 22:36:17,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:36:17,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:36:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:36:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:36:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:36:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:36:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:36:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:36:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:36:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:36:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:36:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:36:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:36:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:36:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:36:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:36:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:36:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:36:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:36:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:36:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:36:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 22:36:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-12-13 22:36:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-12-13 22:36:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-12-13 22:36:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-12-13 22:36:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-12-13 22:36:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-12-13 22:36:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-12-13 22:36:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-12-13 22:36:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-12-13 22:36:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-12-13 22:36:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2022-12-13 22:36:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2022-12-13 22:36:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2022-12-13 22:36:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-12-13 22:36:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2022-12-13 22:36:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2022-12-13 22:36:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,181 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 48 proven. 49 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2022-12-13 22:36:18,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:36:18,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782987613] [2022-12-13 22:36:18,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782987613] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:36:18,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516102916] [2022-12-13 22:36:18,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:36:18,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:36:18,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:36:18,183 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:36:18,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 22:36:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 1325 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 22:36:18,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:36:18,530 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 274 proven. 101 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2022-12-13 22:36:18,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:36:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 56 proven. 52 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2022-12-13 22:36:18,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516102916] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:36:18,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:36:18,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 23 [2022-12-13 22:36:18,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997979868] [2022-12-13 22:36:18,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:36:18,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 22:36:18,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:36:18,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 22:36:18,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-12-13 22:36:18,930 INFO L87 Difference]: Start difference. First operand 8487 states and 10377 transitions. Second operand has 23 states, 23 states have (on average 9.0) internal successors, (207), 19 states have internal predecessors, (207), 5 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (49), 7 states have call predecessors, (49), 4 states have call successors, (49) [2022-12-13 22:36:30,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:36:30,123 INFO L93 Difference]: Finished difference Result 36170 states and 45449 transitions. [2022-12-13 22:36:30,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-12-13 22:36:30,124 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.0) internal successors, (207), 19 states have internal predecessors, (207), 5 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (49), 7 states have call predecessors, (49), 4 states have call successors, (49) Word has length 371 [2022-12-13 22:36:30,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:36:30,175 INFO L225 Difference]: With dead ends: 36170 [2022-12-13 22:36:30,175 INFO L226 Difference]: Without dead ends: 29616 [2022-12-13 22:36:30,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 907 GetRequests, 834 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=801, Invalid=4169, Unknown=0, NotChecked=0, Total=4970 [2022-12-13 22:36:30,186 INFO L413 NwaCegarLoop]: 839 mSDtfsCounter, 1288 mSDsluCounter, 8352 mSDsCounter, 0 mSdLazyCounter, 4500 mSolverCounterSat, 759 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 9191 SdHoareTripleChecker+Invalid, 5259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 759 IncrementalHoareTripleChecker+Valid, 4500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-12-13 22:36:30,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1310 Valid, 9191 Invalid, 5259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [759 Valid, 4500 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-12-13 22:36:30,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29616 states. [2022-12-13 22:36:33,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29616 to 13853. [2022-12-13 22:36:33,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13853 states, 10601 states have (on average 1.2046033393076125) internal successors, (12770), 10853 states have internal predecessors, (12770), 2118 states have call successors, (2118), 1133 states have call predecessors, (2118), 1133 states have return successors, (2118), 1866 states have call predecessors, (2118), 2118 states have call successors, (2118) [2022-12-13 22:36:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13853 states to 13853 states and 17006 transitions. [2022-12-13 22:36:33,854 INFO L78 Accepts]: Start accepts. Automaton has 13853 states and 17006 transitions. Word has length 371 [2022-12-13 22:36:33,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:36:33,854 INFO L495 AbstractCegarLoop]: Abstraction has 13853 states and 17006 transitions. [2022-12-13 22:36:33,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.0) internal successors, (207), 19 states have internal predecessors, (207), 5 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (49), 7 states have call predecessors, (49), 4 states have call successors, (49) [2022-12-13 22:36:33,855 INFO L276 IsEmpty]: Start isEmpty. Operand 13853 states and 17006 transitions. [2022-12-13 22:36:33,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2022-12-13 22:36:33,870 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:36:33,871 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 22:36:33,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 22:36:34,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-12-13 22:36:34,073 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:36:34,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:36:34,074 INFO L85 PathProgramCache]: Analyzing trace with hash -642586994, now seen corresponding path program 1 times [2022-12-13 22:36:34,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:36:34,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332329512] [2022-12-13 22:36:34,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:36:34,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:36:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:36:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:36:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:36:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:36:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:36:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:36:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:36:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:36:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:36:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:36:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:36:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:36:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:36:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:36:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:36:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:36:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:36:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:36:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:36:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-12-13 22:36:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-12-13 22:36:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-12-13 22:36:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-12-13 22:36:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-12-13 22:36:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-12-13 22:36:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-12-13 22:36:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-12-13 22:36:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-12-13 22:36:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-12-13 22:36:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-12-13 22:36:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2022-12-13 22:36:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2022-12-13 22:36:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2022-12-13 22:36:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-12-13 22:36:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2022-12-13 22:36:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2022-12-13 22:36:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:34,853 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2022-12-13 22:36:34,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:36:34,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332329512] [2022-12-13 22:36:34,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332329512] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:36:34,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437158095] [2022-12-13 22:36:34,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:36:34,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:36:34,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:36:34,854 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:36:34,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 22:36:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:35,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 1325 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-13 22:36:35,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:36:35,409 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 343 proven. 126 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2022-12-13 22:36:35,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:36:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 42 proven. 204 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2022-12-13 22:36:36,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437158095] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:36:36,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:36:36,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15, 19] total 49 [2022-12-13 22:36:36,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332739931] [2022-12-13 22:36:36,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:36:36,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-13 22:36:36,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:36:36,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-13 22:36:36,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2219, Unknown=0, NotChecked=0, Total=2352 [2022-12-13 22:36:36,038 INFO L87 Difference]: Start difference. First operand 13853 states and 17006 transitions. Second operand has 49 states, 48 states have (on average 6.166666666666667) internal successors, (296), 42 states have internal predecessors, (296), 14 states have call successors, (79), 10 states have call predecessors, (79), 13 states have return successors, (80), 18 states have call predecessors, (80), 13 states have call successors, (80) [2022-12-13 22:37:12,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:37:12,348 INFO L93 Difference]: Finished difference Result 65548 states and 89338 transitions. [2022-12-13 22:37:12,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2022-12-13 22:37:12,349 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 6.166666666666667) internal successors, (296), 42 states have internal predecessors, (296), 14 states have call successors, (79), 10 states have call predecessors, (79), 13 states have return successors, (80), 18 states have call predecessors, (80), 13 states have call successors, (80) Word has length 371 [2022-12-13 22:37:12,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:37:12,462 INFO L225 Difference]: With dead ends: 65548 [2022-12-13 22:37:12,462 INFO L226 Difference]: Without dead ends: 52798 [2022-12-13 22:37:12,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1061 GetRequests, 804 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23062 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=4017, Invalid=62805, Unknown=0, NotChecked=0, Total=66822 [2022-12-13 22:37:12,487 INFO L413 NwaCegarLoop]: 661 mSDtfsCounter, 4081 mSDsluCounter, 17233 mSDsCounter, 0 mSdLazyCounter, 23884 mSolverCounterSat, 2360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4099 SdHoareTripleChecker+Valid, 17894 SdHoareTripleChecker+Invalid, 26244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2360 IncrementalHoareTripleChecker+Valid, 23884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-12-13 22:37:12,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4099 Valid, 17894 Invalid, 26244 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2360 Valid, 23884 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-12-13 22:37:12,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52798 states. [2022-12-13 22:37:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52798 to 15606. [2022-12-13 22:37:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15606 states, 11969 states have (on average 1.1989305706408222) internal successors, (14350), 12238 states have internal predecessors, (14350), 2349 states have call successors, (2349), 1285 states have call predecessors, (2349), 1287 states have return successors, (2353), 2082 states have call predecessors, (2353), 2349 states have call successors, (2353) [2022-12-13 22:37:16,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15606 states to 15606 states and 19052 transitions. [2022-12-13 22:37:16,989 INFO L78 Accepts]: Start accepts. Automaton has 15606 states and 19052 transitions. Word has length 371 [2022-12-13 22:37:16,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:37:16,989 INFO L495 AbstractCegarLoop]: Abstraction has 15606 states and 19052 transitions. [2022-12-13 22:37:16,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 6.166666666666667) internal successors, (296), 42 states have internal predecessors, (296), 14 states have call successors, (79), 10 states have call predecessors, (79), 13 states have return successors, (80), 18 states have call predecessors, (80), 13 states have call successors, (80) [2022-12-13 22:37:16,989 INFO L276 IsEmpty]: Start isEmpty. Operand 15606 states and 19052 transitions. [2022-12-13 22:37:17,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2022-12-13 22:37:17,009 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:37:17,009 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 22:37:17,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 22:37:17,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-12-13 22:37:17,210 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:37:17,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:37:17,211 INFO L85 PathProgramCache]: Analyzing trace with hash 88317705, now seen corresponding path program 1 times [2022-12-13 22:37:17,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:37:17,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490838790] [2022-12-13 22:37:17,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:37:17,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:37:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:37:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:37:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 22:37:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 22:37:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 22:37:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:37:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:37:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:37:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 22:37:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:37:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:37:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:37:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 22:37:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:37:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:37:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:37:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 22:37:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 22:37:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-12-13 22:37:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-12-13 22:37:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-12-13 22:37:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-12-13 22:37:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-12-13 22:37:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-12-13 22:37:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-12-13 22:37:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-12-13 22:37:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-12-13 22:37:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-12-13 22:37:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-12-13 22:37:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-12-13 22:37:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-12-13 22:37:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-12-13 22:37:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-12-13 22:37:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2022-12-13 22:37:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2022-12-13 22:37:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2022-12-13 22:37:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 9 proven. 136 refuted. 0 times theorem prover too weak. 839 trivial. 0 not checked. [2022-12-13 22:37:17,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:37:17,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490838790] [2022-12-13 22:37:17,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490838790] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:37:17,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003496215] [2022-12-13 22:37:17,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:37:17,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:37:17,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:37:17,350 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:37:17,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 22:37:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:17,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 1325 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 22:37:17,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:37:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2022-12-13 22:37:17,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:37:17,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003496215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:37:17,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 22:37:17,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-12-13 22:37:17,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075562282] [2022-12-13 22:37:17,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:37:17,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:37:17,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:37:17,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:37:17,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:37:17,514 INFO L87 Difference]: Start difference. First operand 15606 states and 19052 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2022-12-13 22:37:21,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:37:21,424 INFO L93 Difference]: Finished difference Result 30520 states and 37332 transitions. [2022-12-13 22:37:21,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:37:21,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 374 [2022-12-13 22:37:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:37:21,449 INFO L225 Difference]: With dead ends: 30520 [2022-12-13 22:37:21,449 INFO L226 Difference]: Without dead ends: 14915 [2022-12-13 22:37:21,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:37:21,464 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 28 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 658 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 [2022-12-13 22:37:21,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 658 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:37:21,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14915 states. [2022-12-13 22:37:25,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14915 to 14915. [2022-12-13 22:37:25,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14915 states, 11415 states have (on average 1.2020148926850636) internal successors, (13721), 11684 states have internal predecessors, (13721), 2276 states have call successors, (2276), 1223 states have call predecessors, (2276), 1223 states have return successors, (2276), 2007 states have call predecessors, (2276), 2276 states have call successors, (2276) [2022-12-13 22:37:25,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14915 states to 14915 states and 18273 transitions. [2022-12-13 22:37:25,656 INFO L78 Accepts]: Start accepts. Automaton has 14915 states and 18273 transitions. Word has length 374 [2022-12-13 22:37:25,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:37:25,656 INFO L495 AbstractCegarLoop]: Abstraction has 14915 states and 18273 transitions. [2022-12-13 22:37:25,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2022-12-13 22:37:25,657 INFO L276 IsEmpty]: Start isEmpty. Operand 14915 states and 18273 transitions. [2022-12-13 22:37:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2022-12-13 22:37:25,673 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:37:25,674 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 22:37:25,680 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 22:37:25,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:37:25,875 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:37:25,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:37:25,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1456395492, now seen corresponding path program 1 times [2022-12-13 22:37:25,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:37:25,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850529008] [2022-12-13 22:37:25,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:37:25,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:37:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:37:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:37:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:37:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:37:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:37:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:37:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:37:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:37:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:37:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:37:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:37:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:37:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:37:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:37:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:37:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:37:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:37:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:37:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 22:37:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-12-13 22:37:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-12-13 22:37:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-12-13 22:37:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-12-13 22:37:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-12-13 22:37:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-12-13 22:37:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-12-13 22:37:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-12-13 22:37:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-12-13 22:37:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-12-13 22:37:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-12-13 22:37:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-12-13 22:37:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2022-12-13 22:37:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-12-13 22:37:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2022-12-13 22:37:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2022-12-13 22:37:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-12-13 22:37:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2022-12-13 22:37:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1039 backedges. 89 proven. 172 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2022-12-13 22:37:26,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:37:26,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850529008] [2022-12-13 22:37:26,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850529008] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:37:26,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096082308] [2022-12-13 22:37:26,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:37:26,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:37:26,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:37:26,367 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:37:26,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 22:37:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:26,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 1350 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 22:37:26,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:37:27,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1039 backedges. 367 proven. 83 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2022-12-13 22:37:27,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:37:27,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1039 backedges. 54 proven. 46 refuted. 0 times theorem prover too weak. 939 trivial. 0 not checked. [2022-12-13 22:37:27,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096082308] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:37:27,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:37:27,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 10] total 34 [2022-12-13 22:37:27,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968117543] [2022-12-13 22:37:27,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:37:27,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 22:37:27,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:37:27,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 22:37:27,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 22:37:27,325 INFO L87 Difference]: Start difference. First operand 14915 states and 18273 transitions. Second operand has 34 states, 32 states have (on average 8.84375) internal successors, (283), 29 states have internal predecessors, (283), 9 states have call successors, (65), 7 states have call predecessors, (65), 15 states have return successors, (65), 12 states have call predecessors, (65), 9 states have call successors, (65) [2022-12-13 22:37:37,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:37:37,083 INFO L93 Difference]: Finished difference Result 30732 states and 38715 transitions. [2022-12-13 22:37:37,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-12-13 22:37:37,084 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 8.84375) internal successors, (283), 29 states have internal predecessors, (283), 9 states have call successors, (65), 7 states have call predecessors, (65), 15 states have return successors, (65), 12 states have call predecessors, (65), 9 states have call successors, (65) Word has length 381 [2022-12-13 22:37:37,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:37:37,111 INFO L225 Difference]: With dead ends: 30732 [2022-12-13 22:37:37,111 INFO L226 Difference]: Without dead ends: 15463 [2022-12-13 22:37:37,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 918 GetRequests, 824 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2216 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=810, Invalid=8120, Unknown=0, NotChecked=0, Total=8930 [2022-12-13 22:37:37,125 INFO L413 NwaCegarLoop]: 497 mSDtfsCounter, 1146 mSDsluCounter, 9075 mSDsCounter, 0 mSdLazyCounter, 5385 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 9572 SdHoareTripleChecker+Invalid, 5787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 5385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-12-13 22:37:37,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 9572 Invalid, 5787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 5385 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-12-13 22:37:37,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15463 states. [2022-12-13 22:37:39,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15463 to 8494. [2022-12-13 22:37:39,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8494 states, 6553 states have (on average 1.1864794750495955) internal successors, (7775), 6658 states have internal predecessors, (7775), 1237 states have call successors, (1237), 703 states have call predecessors, (1237), 703 states have return successors, (1237), 1132 states have call predecessors, (1237), 1237 states have call successors, (1237) [2022-12-13 22:37:39,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8494 states to 8494 states and 10249 transitions. [2022-12-13 22:37:39,671 INFO L78 Accepts]: Start accepts. Automaton has 8494 states and 10249 transitions. Word has length 381 [2022-12-13 22:37:39,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:37:39,672 INFO L495 AbstractCegarLoop]: Abstraction has 8494 states and 10249 transitions. [2022-12-13 22:37:39,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 8.84375) internal successors, (283), 29 states have internal predecessors, (283), 9 states have call successors, (65), 7 states have call predecessors, (65), 15 states have return successors, (65), 12 states have call predecessors, (65), 9 states have call successors, (65) [2022-12-13 22:37:39,672 INFO L276 IsEmpty]: Start isEmpty. Operand 8494 states and 10249 transitions. [2022-12-13 22:37:39,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2022-12-13 22:37:39,679 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:37:39,680 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 22:37:39,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 22:37:39,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:37:39,881 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:37:39,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:37:39,882 INFO L85 PathProgramCache]: Analyzing trace with hash 507838617, now seen corresponding path program 1 times [2022-12-13 22:37:39,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:37:39,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339585757] [2022-12-13 22:37:39,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:37:39,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:37:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:37:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:37:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:37:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:37:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:37:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:37:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:37:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:37:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:37:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:37:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:37:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:37:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:37:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:37:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:37:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:37:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:37:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:37:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:37:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-12-13 22:37:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-12-13 22:37:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-12-13 22:37:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-12-13 22:37:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-12-13 22:37:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-12-13 22:37:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-12-13 22:37:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-12-13 22:37:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2022-12-13 22:37:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-12-13 22:37:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2022-12-13 22:37:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2022-12-13 22:37:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-12-13 22:37:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2022-12-13 22:37:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2022-12-13 22:37:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2022-12-13 22:37:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2022-12-13 22:37:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-12-13 22:37:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2022-12-13 22:37:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:40,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2022-12-13 22:37:40,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:37:40,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339585757] [2022-12-13 22:37:40,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339585757] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:37:40,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057832331] [2022-12-13 22:37:40,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:37:40,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:37:40,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:37:40,829 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:37:40,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 22:37:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:37:41,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 1377 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-13 22:37:41,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:37:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 571 proven. 261 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2022-12-13 22:37:42,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:37:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 155 proven. 154 refuted. 0 times theorem prover too weak. 794 trivial. 0 not checked. [2022-12-13 22:37:43,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057832331] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:37:43,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:37:43,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27, 21] total 64 [2022-12-13 22:37:43,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146148096] [2022-12-13 22:37:43,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:37:43,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-12-13 22:37:43,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:37:43,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-12-13 22:37:43,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=3796, Unknown=0, NotChecked=0, Total=4032 [2022-12-13 22:37:43,292 INFO L87 Difference]: Start difference. First operand 8494 states and 10249 transitions. Second operand has 64 states, 64 states have (on average 6.078125) internal successors, (389), 55 states have internal predecessors, (389), 20 states have call successors, (85), 12 states have call predecessors, (85), 22 states have return successors, (89), 28 states have call predecessors, (89), 20 states have call successors, (89) [2022-12-13 22:38:11,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:38:11,628 INFO L93 Difference]: Finished difference Result 29514 states and 38296 transitions. [2022-12-13 22:38:11,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2022-12-13 22:38:11,629 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 6.078125) internal successors, (389), 55 states have internal predecessors, (389), 20 states have call successors, (85), 12 states have call predecessors, (85), 22 states have return successors, (89), 28 states have call predecessors, (89), 20 states have call successors, (89) Word has length 393 [2022-12-13 22:38:11,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:38:11,663 INFO L225 Difference]: With dead ends: 29514 [2022-12-13 22:38:11,663 INFO L226 Difference]: Without dead ends: 21813 [2022-12-13 22:38:11,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1042 GetRequests, 837 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12150 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2708, Invalid=39934, Unknown=0, NotChecked=0, Total=42642 [2022-12-13 22:38:11,674 INFO L413 NwaCegarLoop]: 612 mSDtfsCounter, 2152 mSDsluCounter, 20145 mSDsCounter, 0 mSdLazyCounter, 25351 mSolverCounterSat, 1264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 20757 SdHoareTripleChecker+Invalid, 26615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1264 IncrementalHoareTripleChecker+Valid, 25351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-12-13 22:38:11,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 20757 Invalid, 26615 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1264 Valid, 25351 Invalid, 0 Unknown, 0 Unchecked, 12.1s Time] [2022-12-13 22:38:11,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21813 states. [2022-12-13 22:38:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21813 to 8842. [2022-12-13 22:38:14,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8842 states, 6822 states have (on average 1.1871885077689828) internal successors, (8099), 6926 states have internal predecessors, (8099), 1276 states have call successors, (1276), 743 states have call predecessors, (1276), 743 states have return successors, (1276), 1172 states have call predecessors, (1276), 1276 states have call successors, (1276) [2022-12-13 22:38:14,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8842 states to 8842 states and 10651 transitions. [2022-12-13 22:38:14,812 INFO L78 Accepts]: Start accepts. Automaton has 8842 states and 10651 transitions. Word has length 393 [2022-12-13 22:38:14,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:38:14,812 INFO L495 AbstractCegarLoop]: Abstraction has 8842 states and 10651 transitions. [2022-12-13 22:38:14,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 6.078125) internal successors, (389), 55 states have internal predecessors, (389), 20 states have call successors, (85), 12 states have call predecessors, (85), 22 states have return successors, (89), 28 states have call predecessors, (89), 20 states have call successors, (89) [2022-12-13 22:38:14,812 INFO L276 IsEmpty]: Start isEmpty. Operand 8842 states and 10651 transitions. [2022-12-13 22:38:14,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2022-12-13 22:38:14,820 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:38:14,821 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 22:38:14,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 22:38:15,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:38:15,022 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:38:15,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:38:15,023 INFO L85 PathProgramCache]: Analyzing trace with hash -2086466752, now seen corresponding path program 1 times [2022-12-13 22:38:15,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:38:15,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101552266] [2022-12-13 22:38:15,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:38:15,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:38:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:38:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:38:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:38:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:38:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:38:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:38:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:38:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:38:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:38:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:38:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:38:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:38:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:38:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:38:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:38:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:38:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:38:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:38:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:38:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-12-13 22:38:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-12-13 22:38:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-12-13 22:38:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-12-13 22:38:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-12-13 22:38:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-12-13 22:38:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-12-13 22:38:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2022-12-13 22:38:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-12-13 22:38:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-12-13 22:38:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-12-13 22:38:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2022-12-13 22:38:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-12-13 22:38:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2022-12-13 22:38:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2022-12-13 22:38:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2022-12-13 22:38:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2022-12-13 22:38:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-12-13 22:38:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2022-12-13 22:38:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2022-12-13 22:38:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2022-12-13 22:38:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 404 [2022-12-13 22:38:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 1203 trivial. 0 not checked. [2022-12-13 22:38:15,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:38:15,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101552266] [2022-12-13 22:38:15,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101552266] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:38:15,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037100552] [2022-12-13 22:38:15,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:38:15,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:38:15,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:38:15,276 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:38:15,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 22:38:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:15,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 1463 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 22:38:15,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:38:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 476 proven. 87 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2022-12-13 22:38:15,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:38:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 52 proven. 34 refuted. 0 times theorem prover too weak. 1137 trivial. 0 not checked. [2022-12-13 22:38:16,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037100552] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:38:16,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:38:16,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 10] total 27 [2022-12-13 22:38:16,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959275008] [2022-12-13 22:38:16,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:38:16,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 22:38:16,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:38:16,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 22:38:16,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-12-13 22:38:16,011 INFO L87 Difference]: Start difference. First operand 8842 states and 10651 transitions. Second operand has 27 states, 24 states have (on average 10.75) internal successors, (258), 24 states have internal predecessors, (258), 9 states have call successors, (67), 8 states have call predecessors, (67), 11 states have return successors, (64), 8 states have call predecessors, (64), 9 states have call successors, (64) [2022-12-13 22:38:21,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:38:21,448 INFO L93 Difference]: Finished difference Result 17932 states and 22136 transitions. [2022-12-13 22:38:21,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-13 22:38:21,449 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 10.75) internal successors, (258), 24 states have internal predecessors, (258), 9 states have call successors, (67), 8 states have call predecessors, (67), 11 states have return successors, (64), 8 states have call predecessors, (64), 9 states have call successors, (64) Word has length 419 [2022-12-13 22:38:21,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:38:21,463 INFO L225 Difference]: With dead ends: 17932 [2022-12-13 22:38:21,463 INFO L226 Difference]: Without dead ends: 10172 [2022-12-13 22:38:21,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 946 GetRequests, 898 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=320, Invalid=2130, Unknown=0, NotChecked=0, Total=2450 [2022-12-13 22:38:21,469 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 600 mSDsluCounter, 2879 mSDsCounter, 0 mSdLazyCounter, 1965 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 3153 SdHoareTripleChecker+Invalid, 2187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 22:38:21,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 3153 Invalid, 2187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1965 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 22:38:21,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10172 states. [2022-12-13 22:38:24,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10172 to 8742. [2022-12-13 22:38:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8742 states, 6743 states have (on average 1.1827079934747144) internal successors, (7975), 6846 states have internal predecessors, (7975), 1263 states have call successors, (1263), 735 states have call predecessors, (1263), 735 states have return successors, (1263), 1160 states have call predecessors, (1263), 1263 states have call successors, (1263) [2022-12-13 22:38:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8742 states to 8742 states and 10501 transitions. [2022-12-13 22:38:24,526 INFO L78 Accepts]: Start accepts. Automaton has 8742 states and 10501 transitions. Word has length 419 [2022-12-13 22:38:24,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:38:24,527 INFO L495 AbstractCegarLoop]: Abstraction has 8742 states and 10501 transitions. [2022-12-13 22:38:24,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 10.75) internal successors, (258), 24 states have internal predecessors, (258), 9 states have call successors, (67), 8 states have call predecessors, (67), 11 states have return successors, (64), 8 states have call predecessors, (64), 9 states have call successors, (64) [2022-12-13 22:38:24,527 INFO L276 IsEmpty]: Start isEmpty. Operand 8742 states and 10501 transitions. [2022-12-13 22:38:24,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2022-12-13 22:38:24,535 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:38:24,535 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 11, 9, 8, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:38:24,540 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-13 22:38:24,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:38:24,736 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:38:24,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:38:24,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1773801962, now seen corresponding path program 1 times [2022-12-13 22:38:24,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:38:24,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399719972] [2022-12-13 22:38:24,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:38:24,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:38:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:38:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:38:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:38:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:38:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:38:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:38:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:38:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:38:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:38:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:38:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:38:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:38:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:38:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:38:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:38:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:38:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:38:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:38:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:38:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 22:38:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-12-13 22:38:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-12-13 22:38:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-12-13 22:38:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-12-13 22:38:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-12-13 22:38:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-12-13 22:38:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-12-13 22:38:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2022-12-13 22:38:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-12-13 22:38:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-12-13 22:38:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-12-13 22:38:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-12-13 22:38:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-12-13 22:38:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-12-13 22:38:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2022-12-13 22:38:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2022-12-13 22:38:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-12-13 22:38:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2022-12-13 22:38:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2022-12-13 22:38:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2022-12-13 22:38:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2022-12-13 22:38:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 411 [2022-12-13 22:38:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:24,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1263 backedges. 41 proven. 2 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2022-12-13 22:38:24,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:38:24,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399719972] [2022-12-13 22:38:24,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399719972] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:38:24,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783275330] [2022-12-13 22:38:24,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:38:24,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:38:24,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:38:24,965 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:38:24,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 22:38:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:25,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 1488 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 22:38:25,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:38:25,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1263 backedges. 187 proven. 401 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2022-12-13 22:38:25,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:38:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1263 backedges. 23 proven. 31 refuted. 0 times theorem prover too weak. 1209 trivial. 0 not checked. [2022-12-13 22:38:25,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783275330] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:38:25,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:38:25,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 20 [2022-12-13 22:38:25,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954099501] [2022-12-13 22:38:25,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:38:25,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 22:38:25,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:38:25,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 22:38:25,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2022-12-13 22:38:25,694 INFO L87 Difference]: Start difference. First operand 8742 states and 10501 transitions. Second operand has 20 states, 20 states have (on average 15.45) internal successors, (309), 17 states have internal predecessors, (309), 7 states have call successors, (95), 7 states have call predecessors, (95), 9 states have return successors, (94), 9 states have call predecessors, (94), 7 states have call successors, (94) [2022-12-13 22:38:48,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:38:48,964 INFO L93 Difference]: Finished difference Result 35443 states and 45525 transitions. [2022-12-13 22:38:48,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-12-13 22:38:48,965 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 15.45) internal successors, (309), 17 states have internal predecessors, (309), 7 states have call successors, (95), 7 states have call predecessors, (95), 9 states have return successors, (94), 9 states have call predecessors, (94), 7 states have call successors, (94) Word has length 424 [2022-12-13 22:38:48,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:38:49,022 INFO L225 Difference]: With dead ends: 35443 [2022-12-13 22:38:49,022 INFO L226 Difference]: Without dead ends: 28477 [2022-12-13 22:38:49,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1080 GetRequests, 952 SyntacticMatches, 9 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4985 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1415, Invalid=13105, Unknown=0, NotChecked=0, Total=14520 [2022-12-13 22:38:49,036 INFO L413 NwaCegarLoop]: 503 mSDtfsCounter, 2595 mSDsluCounter, 5340 mSDsCounter, 0 mSdLazyCounter, 7033 mSolverCounterSat, 1444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2609 SdHoareTripleChecker+Valid, 5843 SdHoareTripleChecker+Invalid, 8477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1444 IncrementalHoareTripleChecker+Valid, 7033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-12-13 22:38:49,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2609 Valid, 5843 Invalid, 8477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1444 Valid, 7033 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-12-13 22:38:49,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28477 states. [2022-12-13 22:38:54,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28477 to 13216. [2022-12-13 22:38:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13216 states, 10233 states have (on average 1.174337926316818) internal successors, (12017), 10378 states have internal predecessors, (12017), 1898 states have call successors, (1898), 1084 states have call predecessors, (1898), 1084 states have return successors, (1898), 1753 states have call predecessors, (1898), 1898 states have call successors, (1898) [2022-12-13 22:38:54,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13216 states to 13216 states and 15813 transitions. [2022-12-13 22:38:54,026 INFO L78 Accepts]: Start accepts. Automaton has 13216 states and 15813 transitions. Word has length 424 [2022-12-13 22:38:54,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:38:54,027 INFO L495 AbstractCegarLoop]: Abstraction has 13216 states and 15813 transitions. [2022-12-13 22:38:54,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 15.45) internal successors, (309), 17 states have internal predecessors, (309), 7 states have call successors, (95), 7 states have call predecessors, (95), 9 states have return successors, (94), 9 states have call predecessors, (94), 7 states have call successors, (94) [2022-12-13 22:38:54,027 INFO L276 IsEmpty]: Start isEmpty. Operand 13216 states and 15813 transitions. [2022-12-13 22:38:54,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2022-12-13 22:38:54,035 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:38:54,035 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 9, 9, 9, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 22:38:54,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-13 22:38:54,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:38:54,237 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:38:54,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:38:54,238 INFO L85 PathProgramCache]: Analyzing trace with hash -339759017, now seen corresponding path program 1 times [2022-12-13 22:38:54,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:38:54,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567230563] [2022-12-13 22:38:54,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:38:54,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:38:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:38:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:38:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:38:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:38:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:38:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:38:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:38:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:38:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:38:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:38:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:38:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:38:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:38:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:38:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:38:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:38:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:38:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:38:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:38:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 22:38:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-12-13 22:38:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-12-13 22:38:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-12-13 22:38:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-12-13 22:38:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-12-13 22:38:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-12-13 22:38:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-12-13 22:38:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2022-12-13 22:38:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-12-13 22:38:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-12-13 22:38:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-12-13 22:38:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-12-13 22:38:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-12-13 22:38:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2022-12-13 22:38:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2022-12-13 22:38:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2022-12-13 22:38:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2022-12-13 22:38:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2022-12-13 22:38:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2022-12-13 22:38:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 393 [2022-12-13 22:38:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 401 [2022-12-13 22:38:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 410 [2022-12-13 22:38:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 24 proven. 23 refuted. 0 times theorem prover too weak. 1226 trivial. 0 not checked. [2022-12-13 22:38:54,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:38:54,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567230563] [2022-12-13 22:38:54,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567230563] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:38:54,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947348930] [2022-12-13 22:38:54,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:38:54,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:38:54,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:38:54,789 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:38:54,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 22:38:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:38:54,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 1486 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 22:38:54,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:38:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 599 proven. 4 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2022-12-13 22:38:55,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:38:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 1228 trivial. 0 not checked. [2022-12-13 22:38:55,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947348930] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:38:55,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:38:55,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 24 [2022-12-13 22:38:55,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364794595] [2022-12-13 22:38:55,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:38:55,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 22:38:55,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:38:55,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 22:38:55,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2022-12-13 22:38:55,194 INFO L87 Difference]: Start difference. First operand 13216 states and 15813 transitions. Second operand has 24 states, 24 states have (on average 11.291666666666666) internal successors, (271), 21 states have internal predecessors, (271), 10 states have call successors, (87), 5 states have call predecessors, (87), 7 states have return successors, (87), 12 states have call predecessors, (87), 10 states have call successors, (87) [2022-12-13 22:39:45,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:39:45,573 INFO L93 Difference]: Finished difference Result 68069 states and 87791 transitions. [2022-12-13 22:39:45,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 332 states. [2022-12-13 22:39:45,574 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 11.291666666666666) internal successors, (271), 21 states have internal predecessors, (271), 10 states have call successors, (87), 5 states have call predecessors, (87), 7 states have return successors, (87), 12 states have call predecessors, (87), 10 states have call successors, (87) Word has length 425 [2022-12-13 22:39:45,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:39:45,683 INFO L225 Difference]: With dead ends: 68069 [2022-12-13 22:39:45,683 INFO L226 Difference]: Without dead ends: 56080 [2022-12-13 22:39:45,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1308 GetRequests, 959 SyntacticMatches, 0 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53501 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=7741, Invalid=115109, Unknown=0, NotChecked=0, Total=122850 [2022-12-13 22:39:45,710 INFO L413 NwaCegarLoop]: 905 mSDtfsCounter, 3350 mSDsluCounter, 9606 mSDsCounter, 0 mSdLazyCounter, 17660 mSolverCounterSat, 2832 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3368 SdHoareTripleChecker+Valid, 10511 SdHoareTripleChecker+Invalid, 20492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2832 IncrementalHoareTripleChecker+Valid, 17660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-12-13 22:39:45,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3368 Valid, 10511 Invalid, 20492 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2832 Valid, 17660 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-12-13 22:39:45,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56080 states. [2022-12-13 22:39:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56080 to 12188. [2022-12-13 22:39:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12188 states, 9513 states have (on average 1.1792284242615367) internal successors, (11218), 9619 states have internal predecessors, (11218), 1694 states have call successors, (1694), 980 states have call predecessors, (1694), 980 states have return successors, (1694), 1588 states have call predecessors, (1694), 1694 states have call successors, (1694) [2022-12-13 22:39:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12188 states to 12188 states and 14606 transitions. [2022-12-13 22:39:51,422 INFO L78 Accepts]: Start accepts. Automaton has 12188 states and 14606 transitions. Word has length 425 [2022-12-13 22:39:51,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:39:51,422 INFO L495 AbstractCegarLoop]: Abstraction has 12188 states and 14606 transitions. [2022-12-13 22:39:51,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 11.291666666666666) internal successors, (271), 21 states have internal predecessors, (271), 10 states have call successors, (87), 5 states have call predecessors, (87), 7 states have return successors, (87), 12 states have call predecessors, (87), 10 states have call successors, (87) [2022-12-13 22:39:51,422 INFO L276 IsEmpty]: Start isEmpty. Operand 12188 states and 14606 transitions. [2022-12-13 22:39:51,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2022-12-13 22:39:51,429 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:39:51,429 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 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, 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] [2022-12-13 22:39:51,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-13 22:39:51,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-13 22:39:51,630 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:39:51,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:39:51,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1820955306, now seen corresponding path program 1 times [2022-12-13 22:39:51,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:39:51,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90661133] [2022-12-13 22:39:51,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:39:51,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:39:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:39:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 22:39:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:39:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 22:39:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 22:39:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 22:39:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 22:39:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 22:39:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 22:39:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 22:39:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:39:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 22:39:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 22:39:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 22:39:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 22:39:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 22:39:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 22:39:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 22:39:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 22:39:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-12-13 22:39:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-12-13 22:39:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 22:39:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-12-13 22:39:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-12-13 22:39:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-12-13 22:39:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-12-13 22:39:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-12-13 22:39:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-12-13 22:39:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-12-13 22:39:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2022-12-13 22:39:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2022-12-13 22:39:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-12-13 22:39:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-12-13 22:39:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2022-12-13 22:39:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2022-12-13 22:39:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2022-12-13 22:39:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2022-12-13 22:39:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2022-12-13 22:39:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 385 [2022-12-13 22:39:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 396 [2022-12-13 22:39:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 404 [2022-12-13 22:39:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 412 [2022-12-13 22:39:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2022-12-13 22:39:51,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:39:51,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90661133] [2022-12-13 22:39:51,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90661133] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:39:51,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691996578] [2022-12-13 22:39:51,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:39:51,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:39:51,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:39:51,861 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:39:51,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 22:39:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:39:52,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 22:39:52,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:39:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 560 proven. 90 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2022-12-13 22:39:52,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:39:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 75 proven. 54 refuted. 0 times theorem prover too weak. 1171 trivial. 0 not checked. [2022-12-13 22:39:52,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691996578] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:39:52,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:39:52,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 27 [2022-12-13 22:39:52,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101162656] [2022-12-13 22:39:52,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:39:52,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 22:39:52,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:39:52,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 22:39:52,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2022-12-13 22:39:52,576 INFO L87 Difference]: Start difference. First operand 12188 states and 14606 transitions. Second operand has 27 states, 27 states have (on average 10.037037037037036) internal successors, (271), 22 states have internal predecessors, (271), 5 states have call successors, (76), 9 states have call predecessors, (76), 15 states have return successors, (75), 9 states have call predecessors, (75), 5 states have call successors, (75) [2022-12-13 22:40:25,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:40:25,641 INFO L93 Difference]: Finished difference Result 43887 states and 54953 transitions. [2022-12-13 22:40:25,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2022-12-13 22:40:25,642 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 10.037037037037036) internal successors, (271), 22 states have internal predecessors, (271), 5 states have call successors, (76), 9 states have call predecessors, (76), 15 states have return successors, (75), 9 states have call predecessors, (75), 5 states have call successors, (75) Word has length 427 [2022-12-13 22:40:25,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:40:25,697 INFO L225 Difference]: With dead ends: 43887 [2022-12-13 22:40:25,697 INFO L226 Difference]: Without dead ends: 32242 [2022-12-13 22:40:25,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1141 GetRequests, 968 SyntacticMatches, 1 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10695 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2891, Invalid=27211, Unknown=0, NotChecked=0, Total=30102 [2022-12-13 22:40:25,712 INFO L413 NwaCegarLoop]: 691 mSDtfsCounter, 4405 mSDsluCounter, 8643 mSDsCounter, 0 mSdLazyCounter, 10367 mSolverCounterSat, 3149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4411 SdHoareTripleChecker+Valid, 9334 SdHoareTripleChecker+Invalid, 13516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3149 IncrementalHoareTripleChecker+Valid, 10367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-12-13 22:40:25,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4411 Valid, 9334 Invalid, 13516 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3149 Valid, 10367 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-12-13 22:40:25,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32242 states. [2022-12-13 22:40:34,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32242 to 16533. [2022-12-13 22:40:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16533 states, 12957 states have (on average 1.1628463378868565) internal successors, (15067), 13095 states have internal predecessors, (15067), 2165 states have call successors, (2165), 1410 states have call predecessors, (2165), 1410 states have return successors, (2165), 2027 states have call predecessors, (2165), 2165 states have call successors, (2165) [2022-12-13 22:40:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16533 states to 16533 states and 19397 transitions. [2022-12-13 22:40:34,268 INFO L78 Accepts]: Start accepts. Automaton has 16533 states and 19397 transitions. Word has length 427 [2022-12-13 22:40:34,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:40:34,269 INFO L495 AbstractCegarLoop]: Abstraction has 16533 states and 19397 transitions. [2022-12-13 22:40:34,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 10.037037037037036) internal successors, (271), 22 states have internal predecessors, (271), 5 states have call successors, (76), 9 states have call predecessors, (76), 15 states have return successors, (75), 9 states have call predecessors, (75), 5 states have call successors, (75) [2022-12-13 22:40:34,269 INFO L276 IsEmpty]: Start isEmpty. Operand 16533 states and 19397 transitions. [2022-12-13 22:40:34,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2022-12-13 22:40:34,279 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:40:34,279 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:40:34,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-13 22:40:34,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-13 22:40:34,480 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:40:34,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:40:34,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1127425218, now seen corresponding path program 1 times [2022-12-13 22:40:34,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:40:34,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622048597] [2022-12-13 22:40:34,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:40:34,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:40:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:40:34,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:40:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:40:34,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:40:34,766 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 22:40:34,767 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 22:40:34,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 22:40:34,771 INFO L445 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] [2022-12-13 22:40:34,774 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 22:40:34,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:40:34 BoogieIcfgContainer [2022-12-13 22:40:34,949 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 22:40:34,950 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 22:40:34,950 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 22:40:34,950 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 22:40:34,950 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:34:02" (3/4) ... [2022-12-13 22:40:34,952 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 22:40:35,111 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 22:40:35,111 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 22:40:35,111 INFO L158 Benchmark]: Toolchain (without parser) took 392981.94ms. Allocated memory was 115.3MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 77.8MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 830.5MB. Max. memory is 16.1GB. [2022-12-13 22:40:35,112 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 115.3MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:40:35,112 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.12ms. Allocated memory is still 115.3MB. Free memory was 77.8MB in the beginning and 61.9MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 22:40:35,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.48ms. Allocated memory is still 115.3MB. Free memory was 61.9MB in the beginning and 59.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 22:40:35,112 INFO L158 Benchmark]: Boogie Preprocessor took 25.88ms. Allocated memory is still 115.3MB. Free memory was 59.1MB in the beginning and 56.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 22:40:35,112 INFO L158 Benchmark]: RCFGBuilder took 513.49ms. Allocated memory is still 115.3MB. Free memory was 56.6MB in the beginning and 68.7MB in the end (delta: -12.1MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2022-12-13 22:40:35,112 INFO L158 Benchmark]: TraceAbstraction took 392009.09ms. Allocated memory was 115.3MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 68.1MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 776.0MB. Max. memory is 16.1GB. [2022-12-13 22:40:35,112 INFO L158 Benchmark]: Witness Printer took 161.43ms. Allocated memory is still 2.7GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 41.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2022-12-13 22:40:35,113 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.12ms. Allocated memory is still 115.3MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.12ms. Allocated memory is still 115.3MB. Free memory was 77.8MB in the beginning and 61.9MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.48ms. Allocated memory is still 115.3MB. Free memory was 61.9MB in the beginning and 59.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.88ms. Allocated memory is still 115.3MB. Free memory was 59.1MB in the beginning and 56.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 513.49ms. Allocated memory is still 115.3MB. Free memory was 56.6MB in the beginning and 68.7MB in the end (delta: -12.1MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * TraceAbstraction took 392009.09ms. Allocated memory was 115.3MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 68.1MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 776.0MB. Max. memory is 16.1GB. * Witness Printer took 161.43ms. Allocated memory is still 2.7GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 41.6MB). Peak memory consumption was 41.9MB. 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: 537]: 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 ; [L39] _Bool gate1Failed ; [L40] _Bool gate2Failed ; [L41] _Bool gate3Failed ; [L42] msg_t VALUE1 ; [L43] msg_t VALUE2 ; [L44] msg_t VALUE3 ; [L46] _Bool gate1Failed_History_0 ; [L47] _Bool gate1Failed_History_1 ; [L48] _Bool gate1Failed_History_2 ; [L49] _Bool gate2Failed_History_0 ; [L50] _Bool gate2Failed_History_1 ; [L51] _Bool gate2Failed_History_2 ; [L52] _Bool gate3Failed_History_0 ; [L53] _Bool gate3Failed_History_1 ; [L54] _Bool gate3Failed_History_2 ; [L55] int8_t votedValue_History_0 ; [L56] int8_t votedValue_History_1 ; [L57] 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] [L479] int c1 ; [L480] int i2 ; [L483] c1 = 0 [L484] gate1Failed = __VERIFIER_nondet_bool() [L485] gate2Failed = __VERIFIER_nondet_bool() [L486] gate3Failed = __VERIFIER_nondet_bool() [L487] VALUE1 = __VERIFIER_nondet_char() [L488] VALUE2 = __VERIFIER_nondet_char() [L489] VALUE3 = __VERIFIER_nondet_char() [L490] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L491] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L492] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L493] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L494] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L495] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L496] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L497] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L498] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L499] votedValue_History_0 = __VERIFIER_nondet_char() [L500] votedValue_History_1 = __VERIFIER_nondet_char() [L501] votedValue_History_2 = __VERIFIER_nondet_char() [L502] CALL, EXPR init() [L206] int tmp ; [L207] int tmp___0 ; [L208] int tmp___1 ; [L209] 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] [L212] 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] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] 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] [L74] 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] [L75] 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] [L76] 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] [L129] 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] [L130] COND TRUE historyIndex == 0 [L131] 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] [L76] 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] [L76] tmp = (int )read_history_bool(0, 0) [L77] 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] [L99] 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] [L74] 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] [L75] 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] [L76] 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] [L129] 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] [L130] COND TRUE historyIndex == 0 [L131] 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] [L76] 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] [L76] tmp = (int )read_history_bool(0, 0) [L77] 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] [L99] 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] [L74] 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] [L75] 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] [L76] 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] [L129] 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] [L130] COND TRUE historyIndex == 0 [L131] 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] [L76] 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] [L76] tmp = (int )read_history_bool(0, 0) [L77] 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] [L99] 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] [L74] 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] [L101] 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] [L212] 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] [L212] tmp = add_history_type(0) [L213] 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] [L216] 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] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] 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] [L74] 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] [L75] 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] [L81] 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] [L82] 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] [L129] 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] [L139] 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] [L140] COND TRUE historyIndex == 0 [L141] 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] [L82] 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] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] 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] [L99] 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] [L74] 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] [L75] 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] [L81] 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] [L82] 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] [L129] 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] [L139] 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] [L140] COND TRUE historyIndex == 0 [L141] 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] [L82] 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] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] 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] [L99] 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] [L74] 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] [L75] 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] [L81] 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] [L82] 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] [L129] 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] [L139] 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] [L140] COND TRUE historyIndex == 0 [L141] 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] [L82] 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] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] 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] [L99] 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] [L74] 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] [L101] 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] [L216] 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] [L216] tmp___0 = add_history_type(1) [L217] 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] [L220] 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] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] 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] [L74] 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] [L75] 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] [L81] 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] [L87] 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] [L88] 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] [L129] 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] [L139] 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] [L149] 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] [L150] COND TRUE historyIndex == 0 [L151] 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] [L88] 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] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] 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] [L99] 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] [L74] 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] [L75] 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] [L81] 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] [L87] 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] [L88] 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] [L129] 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] [L139] 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] [L149] 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] [L150] COND TRUE historyIndex == 0 [L151] 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] [L88] 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] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] 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] [L99] 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] [L74] 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] [L75] 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] [L81] 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] [L87] 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] [L88] 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] [L129] 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] [L139] 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] [L149] 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] [L150] COND TRUE historyIndex == 0 [L151] 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] [L88] 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] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] 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] [L99] 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] [L74] 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] [L101] 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] [L220] 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] [L220] tmp___1 = add_history_type(2) [L221] 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] [L224] 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] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] 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] [L74] 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] [L75] 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] [L81] 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] [L87] 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] [L93] 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] [L94] 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] [L109] 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] [L110] COND TRUE historyIndex == 0 [L111] 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] [L94] 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] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] 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] [L99] 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] [L74] 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] [L75] 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] [L81] 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] [L87] 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] [L93] 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] [L94] 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] [L109] 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] [L110] COND TRUE historyIndex == 0 [L111] 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] [L94] 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] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] 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] [L99] 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] [L74] 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] [L75] 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] [L81] 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] [L87] 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] [L93] 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] [L94] 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] [L109] 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] [L110] COND TRUE historyIndex == 0 [L111] 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] [L94] 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] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] 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] [L99] 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] [L74] 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] [L101] 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] [L224] 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] [L224] tmp___2 = add_history_type(3) [L225] COND FALSE !(! tmp___2) [L228] 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] [L502] RET, EXPR init() [L502] i2 = init() [L503] CALL assume_abort_if_not(i2) VAL [\old(cond)=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, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [\old(cond)=1, cond=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, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L503] RET assume_abort_if_not(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] [L504] g1v_old = nomsg [L505] g1v_new = nomsg [L506] g2v_old = nomsg [L507] g2v_new = nomsg [L508] g3v_old = nomsg [L509] g3v_new = nomsg [L510] 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] [L511] COND TRUE 1 [L513] CALL gate1_each_pals_period() [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [L347] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=7, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=3, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=5, \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=1, gate1Failed_History_0=0, gate1Failed_History_1=7, gate1Failed_History_2=2, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=4, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L184] COND TRUE history_id == 0 [L185] gate1Failed_History_2 = gate1Failed_History_1 [L186] gate1Failed_History_1 = gate1Failed_History_0 [L187] gate1Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=7, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=3, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=5, \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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=4, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, history_id=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L347] 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=7, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=4, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L348] COND TRUE \read(gate1Failed) [L349] g1v_new = 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=7, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=4, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L513] RET gate1_each_pals_period() [L514] CALL gate2_each_pals_period() [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L378] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=3, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=5, \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=7, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=4, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L184] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=3, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=5, \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=7, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=4, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L189] COND TRUE history_id == 1 [L190] gate2Failed_History_2 = gate2Failed_History_1 [L191] gate2Failed_History_1 = gate2Failed_History_0 [L192] gate2Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=3, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=5, \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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L378] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L379] COND TRUE \read(gate2Failed) [L380] g2v_new = 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L514] RET gate2_each_pals_period() [L515] CALL gate3_each_pals_period() [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L409] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=5, \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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L184] COND FALSE !(history_id == 0) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=5, \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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L189] COND FALSE !(history_id == 1) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=5, \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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L194] COND TRUE history_id == 2 [L195] gate3Failed_History_2 = gate3Failed_History_1 [L196] gate3Failed_History_1 = gate3Failed_History_0 [L197] gate3Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=5, \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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L409] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L410] COND FALSE !(\read(gate3Failed)) [L414] tmp = __VERIFIER_nondet_char() [L415] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L416] COND TRUE (int )next_state == 0 [L417] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L427] CALL assume_abort_if_not((_Bool )tmp___0) VAL [\old(cond)=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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [\old(cond)=1, cond=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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L427] RET assume_abort_if_not((_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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L428] g3v_new = 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=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L515] RET gate3_each_pals_period() [L516] CALL voter() [L434] int8_t voted_value ; [L437] voted_value = nomsg [L438] VALUE1 = g1v_old [L439] g1v_old = nomsg [L440] VALUE2 = g2v_old [L441] g2v_old = nomsg [L442] VALUE3 = g3v_old [L443] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L444] COND TRUE (int )VALUE1 == (int )VALUE2 [L445] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L473] CALL write_history_int8(3, voted_value) [L169] COND TRUE history_id == 3 [L170] votedValue_History_2 = votedValue_History_1 [L171] votedValue_History_1 = votedValue_History_0 [L172] votedValue_History_0 = buf VAL [\old(buf)=-1, \old(history_id)=3, buf=-1, 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L473] RET write_history_int8(3, voted_value) [L516] RET voter() [L517] g1v_old = g1v_new [L518] g1v_new = nomsg [L519] g2v_old = g2v_new [L520] g2v_new = nomsg [L521] g3v_old = g3v_new [L522] g3v_new = nomsg [L523] CALL, EXPR check() [L233] int tmp ; [L234] int temp_count ; [L235] int8_t tmp___0 ; [L236] int8_t tmp___1 ; [L237] int8_t tmp___2 ; [L238] _Bool tmp___3 ; [L239] _Bool tmp___4 ; [L240] _Bool tmp___5 ; [L241] int8_t tmp___6 ; [L242] _Bool tmp___7 ; [L243] _Bool tmp___8 ; [L244] _Bool tmp___9 ; [L245] int8_t tmp___10 ; [L246] int8_t tmp___11 ; [L247] int8_t tmp___12 ; [L248] int8_t tmp___13 ; [L249] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L252] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L255] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L258] COND TRUE ! gate3Failed [L259] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [\old(cond)=1, cond=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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] RET assume_abort_if_not((_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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L264] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L129] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L133] COND TRUE historyIndex == 1 [L134] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L264] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L264] tmp___3 = read_history_bool(0, 1) [L265] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L266] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L129] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L139] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L143] COND TRUE historyIndex == 1 [L144] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L266] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L266] tmp___4 = read_history_bool(1, 1) [L267] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L268] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L129] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L139] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L149] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L153] COND TRUE historyIndex == 1 [L154] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L268] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L268] tmp___5 = read_history_bool(2, 1) [L269] COND TRUE ! tmp___5 [L270] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L271] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L110] COND TRUE historyIndex == 0 [L111] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L271] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L271] tmp___0 = read_history_int8(3, 0) [L272] COND TRUE (int )VALUE1 == (int )tmp___0 [L273] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L275] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L110] COND TRUE historyIndex == 0 [L111] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L275] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L275] tmp___1 = read_history_int8(3, 0) [L276] COND TRUE (int )VALUE2 == (int )tmp___1 [L277] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L279] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L110] COND TRUE historyIndex == 0 [L111] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L279] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L279] tmp___2 = read_history_int8(3, 0) [L280] COND TRUE (int )VALUE3 == (int )tmp___2 [L281] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L283] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L297] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L303] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L113] COND TRUE historyIndex == 1 [L114] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L303] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L303] tmp___10 = read_history_int8(3, 1) [L304] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L323] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L110] COND TRUE historyIndex == 0 [L111] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L323] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L323] tmp___11 = read_history_int8(3, 0) [L324] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L336] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L523] RET, EXPR check() [L523] c1 = check() [L524] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L535] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L524] 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=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L511] COND TRUE 1 [L513] CALL gate1_each_pals_period() [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [L347] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=0, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L184] COND TRUE history_id == 0 [L185] gate1Failed_History_2 = gate1Failed_History_1 [L186] gate1Failed_History_1 = gate1Failed_History_0 [L187] gate1Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=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=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L347] 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=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L348] COND FALSE !(\read(gate1Failed)) [L352] tmp = __VERIFIER_nondet_char() [L353] 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=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L354] COND TRUE (int )next_state == 0 [L355] 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=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L365] CALL assume_abort_if_not((_Bool )tmp___0) VAL [\old(cond)=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=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=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [\old(cond)=1, cond=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=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=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L365] RET assume_abort_if_not((_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=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L366] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_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=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L513] RET gate1_each_pals_period() [L514] CALL gate2_each_pals_period() [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L378] 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)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L184] 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)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L189] COND TRUE history_id == 1 [L190] gate2Failed_History_2 = gate2Failed_History_1 [L191] gate2Failed_History_1 = gate2Failed_History_0 [L192] 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)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=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=6, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L378] 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=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L379] COND TRUE \read(gate2Failed) [L380] g2v_new = 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=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L514] RET gate2_each_pals_period() [L515] CALL gate3_each_pals_period() [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L409] 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)=6, \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=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L184] 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)=6, \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=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L189] 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)=6, \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=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L194] COND TRUE history_id == 2 [L195] gate3Failed_History_2 = gate3Failed_History_1 [L196] gate3Failed_History_1 = gate3Failed_History_0 [L197] 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)=6, \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=1, 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] [L409] 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] [L410] COND TRUE \read(gate3Failed) [L411] g3v_new = 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, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L515] RET gate3_each_pals_period() [L516] CALL voter() [L434] int8_t voted_value ; [L437] voted_value = nomsg [L438] VALUE1 = g1v_old [L439] g1v_old = nomsg [L440] VALUE2 = g2v_old [L441] g2v_old = nomsg [L442] VALUE3 = g3v_old [L443] 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] [L444] COND TRUE (int )VALUE1 == (int )VALUE2 [L445] 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] [L473] CALL write_history_int8(3, voted_value) [L169] COND TRUE history_id == 3 [L170] votedValue_History_2 = votedValue_History_1 [L171] votedValue_History_1 = votedValue_History_0 [L172] votedValue_History_0 = buf VAL [\old(buf)=-1, \old(history_id)=3, 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=-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] [L473] RET write_history_int8(3, voted_value) [L516] RET voter() [L517] g1v_old = g1v_new [L518] g1v_new = nomsg [L519] g2v_old = g2v_new [L520] g2v_new = nomsg [L521] g3v_old = g3v_new [L522] g3v_new = nomsg [L523] CALL, EXPR check() [L233] int tmp ; [L234] int temp_count ; [L235] int8_t tmp___0 ; [L236] int8_t tmp___1 ; [L237] int8_t tmp___2 ; [L238] _Bool tmp___3 ; [L239] _Bool tmp___4 ; [L240] _Bool tmp___5 ; [L241] int8_t tmp___6 ; [L242] _Bool tmp___7 ; [L243] _Bool tmp___8 ; [L244] _Bool tmp___9 ; [L245] int8_t tmp___10 ; [L246] int8_t tmp___11 ; [L247] int8_t tmp___12 ; [L248] int8_t tmp___13 ; [L249] 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] [L252] COND TRUE ! gate1Failed [L253] 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] [L263] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=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] [L37] COND FALSE !(!cond) VAL [\old(cond)=1, cond=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] [L263] RET assume_abort_if_not((_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] [L264] 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] [L129] 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] [L130] 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] [L133] COND TRUE historyIndex == 1 [L134] 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] [L264] 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] [L264] tmp___3 = read_history_bool(0, 1) [L265] 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] [L303] 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] [L109] 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] [L110] 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] [L113] COND TRUE historyIndex == 1 [L114] 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] [L303] 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] [L303] tmp___10 = read_history_int8(3, 1) [L304] 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] [L305] 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] [L109] 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] [L110] COND TRUE historyIndex == 0 [L111] 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] [L305] 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] [L305] tmp___6 = read_history_int8(3, 0) [L306] 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] [L307] 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] [L129] 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] [L130] 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] [L133] COND TRUE historyIndex == 1 [L134] 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] [L307] 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] [L307] tmp___7 = read_history_bool(0, 1) [L308] 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] [L309] 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] [L129] 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] [L139] 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] [L140] 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] [L143] COND TRUE historyIndex == 1 [L144] 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] [L309] 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] [L309] tmp___8 = read_history_bool(1, 1) [L310] 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] [L311] 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] [L129] 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] [L139] 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] [L149] 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] [L150] 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] [L153] COND TRUE historyIndex == 1 [L154] 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] [L311] 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] [L311] tmp___9 = read_history_bool(2, 1) [L312] COND TRUE ! tmp___9 [L313] 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] [L523] RET, EXPR check() [L523] c1 = check() [L524] 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] [L535] 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] [L537] 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 7 procedures, 178 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 391.8s, OverallIterations: 50, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 312.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39747 SdHoareTripleChecker+Valid, 84.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39150 mSDsluCounter, 165953 SdHoareTripleChecker+Invalid, 72.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148098 mSDsCounter, 29876 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172239 IncrementalHoareTripleChecker+Invalid, 202115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29876 mSolverCounterUnsat, 17855 mSDtfsCounter, 172239 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16835 GetRequests, 14171 SyntacticMatches, 24 SemanticMatches, 2640 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401770 ImplicationChecksByTransitivity, 78.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16533occurred in iteration=49, InterpolantAutomatonStates: 2373, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 49.7s AutomataMinimizationTime, 49 MinimizatonAttempts, 221000 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 19.7s InterpolantComputationTime, 19265 NumberOfCodeBlocks, 19265 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 23483 ConstructedInterpolants, 0 QuantifiedInterpolants, 53324 SizeOfPredicates, 80 NumberOfNonLiveVariables, 25069 ConjunctsInSsa, 467 ConjunctsInUnsatCore, 86 InterpolantComputations, 37 PerfectInterpolantSequences, 58472/61359 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 22:40:35,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b7c7825-087f-4551-acac-cead93af2147/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE