./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac8e60fb32c268c01bf0cc1d1cd76454411c67e3ab15d16b4eca5e74b982e97f --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 22:21:10,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 22:21:10,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 22:21:10,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 22:21:10,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 22:21:10,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 22:21:10,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 22:21:10,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 22:21:10,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 22:21:10,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 22:21:10,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 22:21:10,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 22:21:10,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 22:21:10,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 22:21:10,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 22:21:10,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 22:21:10,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 22:21:10,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 22:21:10,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 22:21:10,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 22:21:10,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 22:21:10,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 22:21:10,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 22:21:10,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 22:21:10,367 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 22:21:10,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 22:21:10,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 22:21:10,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 22:21:10,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 22:21:10,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 22:21:10,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 22:21:10,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 22:21:10,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 22:21:10,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 22:21:10,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 22:21:10,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 22:21:10,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 22:21:10,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 22:21:10,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 22:21:10,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 22:21:10,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 22:21:10,377 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 22:21:10,394 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 22:21:10,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 22:21:10,395 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 22:21:10,395 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 22:21:10,395 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 22:21:10,395 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 22:21:10,396 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 22:21:10,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 22:21:10,396 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 22:21:10,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 22:21:10,396 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 22:21:10,396 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 22:21:10,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 22:21:10,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 22:21:10,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 22:21:10,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 22:21:10,397 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 22:21:10,397 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 22:21:10,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 22:21:10,397 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 22:21:10,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 22:21:10,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 22:21:10,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 22:21:10,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 22:21:10,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 22:21:10,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 22:21:10,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 22:21:10,398 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 22:21:10,398 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 22:21:10,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 22:21:10,399 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 22:21:10,399 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 22:21:10,399 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 22:21:10,399 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 22:21:10,399 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac8e60fb32c268c01bf0cc1d1cd76454411c67e3ab15d16b4eca5e74b982e97f [2021-12-06 22:21:10,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 22:21:10,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 22:21:10,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 22:21:10,607 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 22:21:10,607 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 22:21:10,608 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2021-12-06 22:21:10,651 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/data/8ce17238a/0a21b319681d491aa9c23188465ce3be/FLAG246a9f949 [2021-12-06 22:21:11,050 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 22:21:11,051 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2021-12-06 22:21:11,059 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/data/8ce17238a/0a21b319681d491aa9c23188465ce3be/FLAG246a9f949 [2021-12-06 22:21:11,068 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/data/8ce17238a/0a21b319681d491aa9c23188465ce3be [2021-12-06 22:21:11,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 22:21:11,071 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 22:21:11,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 22:21:11,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 22:21:11,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 22:21:11,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:21:11" (1/1) ... [2021-12-06 22:21:11,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33e4a868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:21:11, skipping insertion in model container [2021-12-06 22:21:11,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:21:11" (1/1) ... [2021-12-06 22:21:11,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 22:21:11,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 22:21:11,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c[14522,14535] [2021-12-06 22:21:11,306 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:21:11,315 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 22:21:11,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c[14522,14535] [2021-12-06 22:21:11,371 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:21:11,386 INFO L208 MainTranslator]: Completed translation [2021-12-06 22:21:11,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:21:11 WrapperNode [2021-12-06 22:21:11,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 22:21:11,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 22:21:11,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 22:21:11,388 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 22:21:11,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:21:11" (1/1) ... [2021-12-06 22:21:11,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:21:11" (1/1) ... [2021-12-06 22:21:11,435 INFO L137 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 530 [2021-12-06 22:21:11,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 22:21:11,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 22:21:11,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 22:21:11,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 22:21:11,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:21:11" (1/1) ... [2021-12-06 22:21:11,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:21:11" (1/1) ... [2021-12-06 22:21:11,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:21:11" (1/1) ... [2021-12-06 22:21:11,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:21:11" (1/1) ... [2021-12-06 22:21:11,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:21:11" (1/1) ... [2021-12-06 22:21:11,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:21:11" (1/1) ... [2021-12-06 22:21:11,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:21:11" (1/1) ... [2021-12-06 22:21:11,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 22:21:11,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 22:21:11,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 22:21:11,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 22:21:11,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:21:11" (1/1) ... [2021-12-06 22:21:11,479 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 22:21:11,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:21:11,495 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 22:21:11,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 22:21:11,524 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2021-12-06 22:21:11,524 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2021-12-06 22:21:11,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 22:21:11,524 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2021-12-06 22:21:11,524 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2021-12-06 22:21:11,524 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2021-12-06 22:21:11,524 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2021-12-06 22:21:11,524 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2021-12-06 22:21:11,525 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2021-12-06 22:21:11,525 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-06 22:21:11,525 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-06 22:21:11,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 22:21:11,525 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2021-12-06 22:21:11,525 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2021-12-06 22:21:11,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 22:21:11,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 22:21:11,525 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2021-12-06 22:21:11,525 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2021-12-06 22:21:11,603 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 22:21:11,604 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 22:21:11,957 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 22:21:11,967 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 22:21:11,968 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-06 22:21:11,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:21:11 BoogieIcfgContainer [2021-12-06 22:21:11,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 22:21:11,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 22:21:11,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 22:21:11,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 22:21:11,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 10:21:11" (1/3) ... [2021-12-06 22:21:11,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed3783c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 10:21:11, skipping insertion in model container [2021-12-06 22:21:11,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:21:11" (2/3) ... [2021-12-06 22:21:11,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed3783c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 10:21:11, skipping insertion in model container [2021-12-06 22:21:11,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:21:11" (3/3) ... [2021-12-06 22:21:11,978 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2021-12-06 22:21:11,984 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 22:21:11,984 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 22:21:12,023 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 22:21:12,028 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 22:21:12,028 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 22:21:12,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 204 states, 164 states have (on average 1.548780487804878) internal successors, (254), 166 states have internal predecessors, (254), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-12-06 22:21:12,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-06 22:21:12,052 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:12,052 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:12,052 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:12,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:12,058 INFO L85 PathProgramCache]: Analyzing trace with hash -753912551, now seen corresponding path program 1 times [2021-12-06 22:21:12,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:12,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791408898] [2021-12-06 22:21:12,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:12,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:12,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 22:21:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:12,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:21:12,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:12,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791408898] [2021-12-06 22:21:12,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791408898] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:12,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:12,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 22:21:12,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726536350] [2021-12-06 22:21:12,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:12,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-06 22:21:12,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:12,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 22:21:12,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 22:21:12,270 INFO L87 Difference]: Start difference. First operand has 204 states, 164 states have (on average 1.548780487804878) internal successors, (254), 166 states have internal predecessors, (254), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 22:21:12,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:12,307 INFO L93 Difference]: Finished difference Result 388 states and 629 transitions. [2021-12-06 22:21:12,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 22:21:12,308 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-12-06 22:21:12,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:12,316 INFO L225 Difference]: With dead ends: 388 [2021-12-06 22:21:12,316 INFO L226 Difference]: Without dead ends: 200 [2021-12-06 22:21:12,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 22:21:12,323 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:12,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:21:12,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-12-06 22:21:12,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2021-12-06 22:21:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 161 states have (on average 1.4968944099378882) internal successors, (241), 162 states have internal predecessors, (241), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-12-06 22:21:12,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 303 transitions. [2021-12-06 22:21:12,368 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 303 transitions. Word has length 44 [2021-12-06 22:21:12,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:12,368 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 303 transitions. [2021-12-06 22:21:12,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 22:21:12,368 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 303 transitions. [2021-12-06 22:21:12,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-06 22:21:12,370 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:12,371 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:12,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 22:21:12,371 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:12,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:12,372 INFO L85 PathProgramCache]: Analyzing trace with hash -762678055, now seen corresponding path program 1 times [2021-12-06 22:21:12,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:12,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718636227] [2021-12-06 22:21:12,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:12,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:12,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 22:21:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:12,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:21:12,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:12,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718636227] [2021-12-06 22:21:12,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718636227] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:12,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:12,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:21:12,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034999691] [2021-12-06 22:21:12,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:12,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:21:12,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:12,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:21:12,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:21:12,448 INFO L87 Difference]: Start difference. First operand 200 states and 303 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 22:21:12,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:12,516 INFO L93 Difference]: Finished difference Result 386 states and 580 transitions. [2021-12-06 22:21:12,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:21:12,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-12-06 22:21:12,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:12,519 INFO L225 Difference]: With dead ends: 386 [2021-12-06 22:21:12,519 INFO L226 Difference]: Without dead ends: 200 [2021-12-06 22:21:12,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:21:12,522 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 167 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:12,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 1282 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:21:12,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-12-06 22:21:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2021-12-06 22:21:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 161 states have (on average 1.4223602484472049) internal successors, (229), 162 states have internal predecessors, (229), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-12-06 22:21:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 291 transitions. [2021-12-06 22:21:12,543 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 291 transitions. Word has length 44 [2021-12-06 22:21:12,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:12,543 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 291 transitions. [2021-12-06 22:21:12,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 22:21:12,544 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 291 transitions. [2021-12-06 22:21:12,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-06 22:21:12,546 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:12,546 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:12,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 22:21:12,547 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:12,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:12,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1438178434, now seen corresponding path program 1 times [2021-12-06 22:21:12,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:12,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247241425] [2021-12-06 22:21:12,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:12,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:12,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:12,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:21:12,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:12,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247241425] [2021-12-06 22:21:12,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247241425] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:12,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:12,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:21:12,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013253768] [2021-12-06 22:21:12,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:12,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:21:12,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:12,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:21:12,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:21:12,692 INFO L87 Difference]: Start difference. First operand 200 states and 291 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 22:21:12,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:12,737 INFO L93 Difference]: Finished difference Result 387 states and 572 transitions. [2021-12-06 22:21:12,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:21:12,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2021-12-06 22:21:12,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:12,740 INFO L225 Difference]: With dead ends: 387 [2021-12-06 22:21:12,740 INFO L226 Difference]: Without dead ends: 204 [2021-12-06 22:21:12,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:21:12,743 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 5 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 845 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 [2021-12-06 22:21:12,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 845 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:21:12,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-12-06 22:21:12,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2021-12-06 22:21:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 164 states have (on average 1.4146341463414633) internal successors, (232), 165 states have internal predecessors, (232), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-12-06 22:21:12,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 294 transitions. [2021-12-06 22:21:12,763 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 294 transitions. Word has length 55 [2021-12-06 22:21:12,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:12,764 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 294 transitions. [2021-12-06 22:21:12,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 22:21:12,764 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 294 transitions. [2021-12-06 22:21:12,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-06 22:21:12,767 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:12,767 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:12,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 22:21:12,767 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:12,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:12,768 INFO L85 PathProgramCache]: Analyzing trace with hash -844326800, now seen corresponding path program 1 times [2021-12-06 22:21:12,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:12,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093103662] [2021-12-06 22:21:12,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:12,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:12,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:12,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 22:21:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:12,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-06 22:21:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 22:21:12,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:12,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093103662] [2021-12-06 22:21:12,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093103662] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:12,870 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:12,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:21:12,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655997166] [2021-12-06 22:21:12,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:12,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:21:12,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:12,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:21:12,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:21:12,872 INFO L87 Difference]: Start difference. First operand 204 states and 294 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 22:21:12,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:12,906 INFO L93 Difference]: Finished difference Result 555 states and 811 transitions. [2021-12-06 22:21:12,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:21:12,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 71 [2021-12-06 22:21:12,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:12,910 INFO L225 Difference]: With dead ends: 555 [2021-12-06 22:21:12,910 INFO L226 Difference]: Without dead ends: 368 [2021-12-06 22:21:12,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:21:12,912 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 222 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:12,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 612 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:21:12,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-12-06 22:21:12,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 359. [2021-12-06 22:21:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 282 states have (on average 1.4326241134751774) internal successors, (404), 284 states have internal predecessors, (404), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2021-12-06 22:21:12,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 524 transitions. [2021-12-06 22:21:12,945 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 524 transitions. Word has length 71 [2021-12-06 22:21:12,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:12,946 INFO L470 AbstractCegarLoop]: Abstraction has 359 states and 524 transitions. [2021-12-06 22:21:12,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 22:21:12,946 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 524 transitions. [2021-12-06 22:21:12,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-06 22:21:12,948 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:12,949 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:12,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 22:21:12,949 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:12,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:12,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1070072020, now seen corresponding path program 1 times [2021-12-06 22:21:12,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:12,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142214782] [2021-12-06 22:21:12,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:12,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:13,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:13,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 22:21:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:13,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-06 22:21:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 22:21:13,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:13,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142214782] [2021-12-06 22:21:13,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142214782] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:13,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:13,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:21:13,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351500364] [2021-12-06 22:21:13,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:13,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:21:13,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:13,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:21:13,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:21:13,028 INFO L87 Difference]: Start difference. First operand 359 states and 524 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 22:21:13,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:13,079 INFO L93 Difference]: Finished difference Result 994 states and 1465 transitions. [2021-12-06 22:21:13,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:21:13,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 72 [2021-12-06 22:21:13,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:13,087 INFO L225 Difference]: With dead ends: 994 [2021-12-06 22:21:13,087 INFO L226 Difference]: Without dead ends: 652 [2021-12-06 22:21:13,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:21:13,090 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 230 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:13,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 647 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:21:13,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2021-12-06 22:21:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 635. [2021-12-06 22:21:13,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 486 states have (on average 1.4506172839506173) internal successors, (705), 490 states have internal predecessors, (705), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2021-12-06 22:21:13,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 939 transitions. [2021-12-06 22:21:13,141 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 939 transitions. Word has length 72 [2021-12-06 22:21:13,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:13,141 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 939 transitions. [2021-12-06 22:21:13,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 22:21:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 939 transitions. [2021-12-06 22:21:13,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-06 22:21:13,143 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:13,144 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:13,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 22:21:13,144 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:13,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:13,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1945031598, now seen corresponding path program 1 times [2021-12-06 22:21:13,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:13,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628593256] [2021-12-06 22:21:13,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:13,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:13,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:13,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 22:21:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:13,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-06 22:21:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 22:21:13,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:13,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628593256] [2021-12-06 22:21:13,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628593256] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:13,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:13,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 22:21:13,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82003728] [2021-12-06 22:21:13,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:13,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:21:13,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:13,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:21:13,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:21:13,238 INFO L87 Difference]: Start difference. First operand 635 states and 939 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 22:21:13,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:13,473 INFO L93 Difference]: Finished difference Result 1779 states and 2677 transitions. [2021-12-06 22:21:13,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 22:21:13,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 72 [2021-12-06 22:21:13,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:13,480 INFO L225 Difference]: With dead ends: 1779 [2021-12-06 22:21:13,480 INFO L226 Difference]: Without dead ends: 1161 [2021-12-06 22:21:13,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:21:13,483 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 767 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:13,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [767 Valid, 773 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 22:21:13,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2021-12-06 22:21:13,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 760. [2021-12-06 22:21:13,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 598 states have (on average 1.4297658862876255) internal successors, (855), 601 states have internal predecessors, (855), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2021-12-06 22:21:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1103 transitions. [2021-12-06 22:21:13,528 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1103 transitions. Word has length 72 [2021-12-06 22:21:13,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:13,528 INFO L470 AbstractCegarLoop]: Abstraction has 760 states and 1103 transitions. [2021-12-06 22:21:13,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 22:21:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1103 transitions. [2021-12-06 22:21:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-06 22:21:13,529 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:13,530 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:13,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 22:21:13,530 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:13,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:13,530 INFO L85 PathProgramCache]: Analyzing trace with hash 971205827, now seen corresponding path program 1 times [2021-12-06 22:21:13,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:13,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534040319] [2021-12-06 22:21:13,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:13,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:13,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:13,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 22:21:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:13,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-06 22:21:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 22:21:13,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:13,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534040319] [2021-12-06 22:21:13,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534040319] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:13,588 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:13,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 22:21:13,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130683841] [2021-12-06 22:21:13,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:13,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:21:13,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:13,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:21:13,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:21:13,589 INFO L87 Difference]: Start difference. First operand 760 states and 1103 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 22:21:13,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:13,805 INFO L93 Difference]: Finished difference Result 1779 states and 2669 transitions. [2021-12-06 22:21:13,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 22:21:13,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 73 [2021-12-06 22:21:13,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:13,812 INFO L225 Difference]: With dead ends: 1779 [2021-12-06 22:21:13,812 INFO L226 Difference]: Without dead ends: 1161 [2021-12-06 22:21:13,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:21:13,815 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 763 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:13,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [763 Valid, 776 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:21:13,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2021-12-06 22:21:13,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 760. [2021-12-06 22:21:13,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 598 states have (on average 1.4230769230769231) internal successors, (851), 601 states have internal predecessors, (851), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2021-12-06 22:21:13,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1099 transitions. [2021-12-06 22:21:13,861 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1099 transitions. Word has length 73 [2021-12-06 22:21:13,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:13,862 INFO L470 AbstractCegarLoop]: Abstraction has 760 states and 1099 transitions. [2021-12-06 22:21:13,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 22:21:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1099 transitions. [2021-12-06 22:21:13,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-06 22:21:13,864 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:13,864 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:13,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 22:21:13,864 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:13,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:13,865 INFO L85 PathProgramCache]: Analyzing trace with hash -172369631, now seen corresponding path program 1 times [2021-12-06 22:21:13,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:13,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397767142] [2021-12-06 22:21:13,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:13,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:13,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:13,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 22:21:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:13,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 22:21:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 22:21:13,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:13,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397767142] [2021-12-06 22:21:13,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397767142] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:13,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:13,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:21:13,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228219860] [2021-12-06 22:21:13,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:13,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:21:13,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:13,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:21:13,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:21:13,936 INFO L87 Difference]: Start difference. First operand 760 states and 1099 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-06 22:21:13,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:13,981 INFO L93 Difference]: Finished difference Result 1398 states and 2048 transitions. [2021-12-06 22:21:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:21:13,982 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 74 [2021-12-06 22:21:13,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:13,986 INFO L225 Difference]: With dead ends: 1398 [2021-12-06 22:21:13,986 INFO L226 Difference]: Without dead ends: 780 [2021-12-06 22:21:13,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:21:13,988 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 6 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:13,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 857 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:21:13,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2021-12-06 22:21:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 780. [2021-12-06 22:21:14,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 614 states have (on average 1.4120521172638436) internal successors, (867), 617 states have internal predecessors, (867), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2021-12-06 22:21:14,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1115 transitions. [2021-12-06 22:21:14,027 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1115 transitions. Word has length 74 [2021-12-06 22:21:14,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:14,028 INFO L470 AbstractCegarLoop]: Abstraction has 780 states and 1115 transitions. [2021-12-06 22:21:14,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-06 22:21:14,028 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1115 transitions. [2021-12-06 22:21:14,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-12-06 22:21:14,030 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:14,030 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:14,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 22:21:14,030 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:14,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:14,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1566474644, now seen corresponding path program 1 times [2021-12-06 22:21:14,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:14,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506848432] [2021-12-06 22:21:14,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:14,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 22:21:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 22:21:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 22:21:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 22:21:14,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:14,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506848432] [2021-12-06 22:21:14,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506848432] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:14,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:14,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:21:14,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957853205] [2021-12-06 22:21:14,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:14,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:21:14,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:14,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:21:14,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:21:14,100 INFO L87 Difference]: Start difference. First operand 780 states and 1115 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 22:21:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:14,161 INFO L93 Difference]: Finished difference Result 1438 states and 2092 transitions. [2021-12-06 22:21:14,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:21:14,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 82 [2021-12-06 22:21:14,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:14,167 INFO L225 Difference]: With dead ends: 1438 [2021-12-06 22:21:14,167 INFO L226 Difference]: Without dead ends: 800 [2021-12-06 22:21:14,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:21:14,170 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 6 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:14,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 843 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:21:14,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2021-12-06 22:21:14,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2021-12-06 22:21:14,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 630 states have (on average 1.4015873015873015) internal successors, (883), 633 states have internal predecessors, (883), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2021-12-06 22:21:14,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1131 transitions. [2021-12-06 22:21:14,219 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1131 transitions. Word has length 82 [2021-12-06 22:21:14,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:14,220 INFO L470 AbstractCegarLoop]: Abstraction has 800 states and 1131 transitions. [2021-12-06 22:21:14,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 22:21:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1131 transitions. [2021-12-06 22:21:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-06 22:21:14,221 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:14,221 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:14,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 22:21:14,221 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:14,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:14,222 INFO L85 PathProgramCache]: Analyzing trace with hash -785723592, now seen corresponding path program 1 times [2021-12-06 22:21:14,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:14,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464495666] [2021-12-06 22:21:14,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:14,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 22:21:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 22:21:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 22:21:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 22:21:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 22:21:14,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:14,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464495666] [2021-12-06 22:21:14,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464495666] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:14,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:14,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:21:14,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393210652] [2021-12-06 22:21:14,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:14,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:21:14,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:14,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:21:14,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:21:14,290 INFO L87 Difference]: Start difference. First operand 800 states and 1131 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-06 22:21:14,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:14,351 INFO L93 Difference]: Finished difference Result 1478 states and 2124 transitions. [2021-12-06 22:21:14,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:21:14,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 90 [2021-12-06 22:21:14,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:14,357 INFO L225 Difference]: With dead ends: 1478 [2021-12-06 22:21:14,357 INFO L226 Difference]: Without dead ends: 820 [2021-12-06 22:21:14,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:21:14,361 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 6 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:14,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 843 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:21:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2021-12-06 22:21:14,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 820. [2021-12-06 22:21:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 646 states have (on average 1.391640866873065) internal successors, (899), 649 states have internal predecessors, (899), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2021-12-06 22:21:14,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1147 transitions. [2021-12-06 22:21:14,403 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1147 transitions. Word has length 90 [2021-12-06 22:21:14,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:14,404 INFO L470 AbstractCegarLoop]: Abstraction has 820 states and 1147 transitions. [2021-12-06 22:21:14,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-06 22:21:14,404 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1147 transitions. [2021-12-06 22:21:14,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-06 22:21:14,405 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:14,405 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:14,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 22:21:14,405 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:14,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:14,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1112784401, now seen corresponding path program 1 times [2021-12-06 22:21:14,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:14,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708011523] [2021-12-06 22:21:14,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:14,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 22:21:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 22:21:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 22:21:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 22:21:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 22:21:14,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:14,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708011523] [2021-12-06 22:21:14,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708011523] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:14,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:14,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:21:14,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780950593] [2021-12-06 22:21:14,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:14,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:21:14,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:14,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:21:14,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:21:14,462 INFO L87 Difference]: Start difference. First operand 820 states and 1147 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-06 22:21:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:14,506 INFO L93 Difference]: Finished difference Result 1514 states and 2140 transitions. [2021-12-06 22:21:14,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:21:14,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 90 [2021-12-06 22:21:14,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:14,511 INFO L225 Difference]: With dead ends: 1514 [2021-12-06 22:21:14,511 INFO L226 Difference]: Without dead ends: 836 [2021-12-06 22:21:14,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:21:14,513 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 5 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:14,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 852 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:21:14,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2021-12-06 22:21:14,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2021-12-06 22:21:14,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 658 states have (on average 1.384498480243161) internal successors, (911), 661 states have internal predecessors, (911), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2021-12-06 22:21:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1159 transitions. [2021-12-06 22:21:14,548 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1159 transitions. Word has length 90 [2021-12-06 22:21:14,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:14,548 INFO L470 AbstractCegarLoop]: Abstraction has 836 states and 1159 transitions. [2021-12-06 22:21:14,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-06 22:21:14,548 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1159 transitions. [2021-12-06 22:21:14,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-06 22:21:14,550 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:14,550 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:14,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 22:21:14,550 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:14,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:14,550 INFO L85 PathProgramCache]: Analyzing trace with hash 433986968, now seen corresponding path program 1 times [2021-12-06 22:21:14,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:14,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526000298] [2021-12-06 22:21:14,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:14,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 22:21:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 22:21:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 22:21:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 22:21:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 22:21:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 22:21:14,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:14,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526000298] [2021-12-06 22:21:14,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526000298] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:14,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:14,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:21:14,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471420620] [2021-12-06 22:21:14,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:14,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:21:14,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:14,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:21:14,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:21:14,633 INFO L87 Difference]: Start difference. First operand 836 states and 1159 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 22:21:14,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:14,690 INFO L93 Difference]: Finished difference Result 1554 states and 2176 transitions. [2021-12-06 22:21:14,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:21:14,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 98 [2021-12-06 22:21:14,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:14,697 INFO L225 Difference]: With dead ends: 1554 [2021-12-06 22:21:14,697 INFO L226 Difference]: Without dead ends: 860 [2021-12-06 22:21:14,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:21:14,700 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 7 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:14,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 854 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:21:14,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2021-12-06 22:21:14,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 860. [2021-12-06 22:21:14,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 678 states have (on average 1.373156342182891) internal successors, (931), 681 states have internal predecessors, (931), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2021-12-06 22:21:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1179 transitions. [2021-12-06 22:21:14,744 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1179 transitions. Word has length 98 [2021-12-06 22:21:14,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:14,744 INFO L470 AbstractCegarLoop]: Abstraction has 860 states and 1179 transitions. [2021-12-06 22:21:14,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 22:21:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1179 transitions. [2021-12-06 22:21:14,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-12-06 22:21:14,746 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:14,747 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:14,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 22:21:14,747 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:14,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:14,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1344619331, now seen corresponding path program 1 times [2021-12-06 22:21:14,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:14,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663581722] [2021-12-06 22:21:14,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:14,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 22:21:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 22:21:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 22:21:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 22:21:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 22:21:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-06 22:21:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:14,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 22:21:14,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:14,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663581722] [2021-12-06 22:21:14,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663581722] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:14,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:14,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 22:21:14,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220236391] [2021-12-06 22:21:14,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:14,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 22:21:14,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:14,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 22:21:14,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:21:14,889 INFO L87 Difference]: Start difference. First operand 860 states and 1179 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 22:21:15,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:15,145 INFO L93 Difference]: Finished difference Result 2457 states and 3421 transitions. [2021-12-06 22:21:15,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 22:21:15,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 101 [2021-12-06 22:21:15,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:15,155 INFO L225 Difference]: With dead ends: 2457 [2021-12-06 22:21:15,155 INFO L226 Difference]: Without dead ends: 1739 [2021-12-06 22:21:15,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-06 22:21:15,157 INFO L933 BasicCegarLoop]: 409 mSDtfsCounter, 388 mSDsluCounter, 1849 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 2258 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:15,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 2258 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:21:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2021-12-06 22:21:15,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1144. [2021-12-06 22:21:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 889 states have (on average 1.3644544431946006) internal successors, (1213), 894 states have internal predecessors, (1213), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2021-12-06 22:21:15,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1557 transitions. [2021-12-06 22:21:15,217 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1557 transitions. Word has length 101 [2021-12-06 22:21:15,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:15,217 INFO L470 AbstractCegarLoop]: Abstraction has 1144 states and 1557 transitions. [2021-12-06 22:21:15,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 22:21:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1557 transitions. [2021-12-06 22:21:15,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-12-06 22:21:15,219 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:15,219 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 22:21:15,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 22:21:15,219 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:15,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:15,219 INFO L85 PathProgramCache]: Analyzing trace with hash 714539601, now seen corresponding path program 1 times [2021-12-06 22:21:15,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:15,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045176617] [2021-12-06 22:21:15,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:15,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 22:21:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 22:21:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 22:21:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 22:21:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 22:21:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-06 22:21:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-06 22:21:15,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:15,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045176617] [2021-12-06 22:21:15,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045176617] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:15,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:15,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:21:15,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903289250] [2021-12-06 22:21:15,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:15,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:21:15,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:15,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:21:15,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:21:15,300 INFO L87 Difference]: Start difference. First operand 1144 states and 1557 transitions. Second operand has 6 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-06 22:21:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:15,407 INFO L93 Difference]: Finished difference Result 1607 states and 2285 transitions. [2021-12-06 22:21:15,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:21:15,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 104 [2021-12-06 22:21:15,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:15,415 INFO L225 Difference]: With dead ends: 1607 [2021-12-06 22:21:15,415 INFO L226 Difference]: Without dead ends: 1605 [2021-12-06 22:21:15,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:21:15,417 INFO L933 BasicCegarLoop]: 507 mSDtfsCounter, 253 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:15,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 2223 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:21:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2021-12-06 22:21:15,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1152. [2021-12-06 22:21:15,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 893 states have (on average 1.3628219484882418) internal successors, (1217), 900 states have internal predecessors, (1217), 174 states have call successors, (174), 84 states have call predecessors, (174), 84 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2021-12-06 22:21:15,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1565 transitions. [2021-12-06 22:21:15,480 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1565 transitions. Word has length 104 [2021-12-06 22:21:15,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:15,480 INFO L470 AbstractCegarLoop]: Abstraction has 1152 states and 1565 transitions. [2021-12-06 22:21:15,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-06 22:21:15,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1565 transitions. [2021-12-06 22:21:15,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-06 22:21:15,481 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:15,482 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 22:21:15,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 22:21:15,482 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:15,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:15,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1078064959, now seen corresponding path program 1 times [2021-12-06 22:21:15,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:15,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463850613] [2021-12-06 22:21:15,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:15,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 22:21:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 22:21:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 22:21:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 22:21:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 22:21:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-06 22:21:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,548 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 22:21:15,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:15,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463850613] [2021-12-06 22:21:15,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463850613] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:15,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:15,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:21:15,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387791292] [2021-12-06 22:21:15,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:15,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:21:15,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:15,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:21:15,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:21:15,550 INFO L87 Difference]: Start difference. First operand 1152 states and 1565 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-06 22:21:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:15,628 INFO L93 Difference]: Finished difference Result 2118 states and 2900 transitions. [2021-12-06 22:21:15,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:21:15,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 105 [2021-12-06 22:21:15,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:15,637 INFO L225 Difference]: With dead ends: 2118 [2021-12-06 22:21:15,637 INFO L226 Difference]: Without dead ends: 1176 [2021-12-06 22:21:15,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:21:15,641 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 5 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:15,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 852 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:21:15,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2021-12-06 22:21:15,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1176. [2021-12-06 22:21:15,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 911 states have (on average 1.3556531284302964) internal successors, (1235), 918 states have internal predecessors, (1235), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2021-12-06 22:21:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1583 transitions. [2021-12-06 22:21:15,716 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1583 transitions. Word has length 105 [2021-12-06 22:21:15,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:15,716 INFO L470 AbstractCegarLoop]: Abstraction has 1176 states and 1583 transitions. [2021-12-06 22:21:15,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-06 22:21:15,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1583 transitions. [2021-12-06 22:21:15,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-06 22:21:15,718 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:15,718 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 22:21:15,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 22:21:15,718 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:15,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:15,718 INFO L85 PathProgramCache]: Analyzing trace with hash -521364212, now seen corresponding path program 1 times [2021-12-06 22:21:15,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:15,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274108644] [2021-12-06 22:21:15,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:15,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 22:21:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 22:21:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 22:21:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 22:21:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 22:21:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-06 22:21:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:15,795 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-06 22:21:15,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:15,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274108644] [2021-12-06 22:21:15,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274108644] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:15,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:15,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 22:21:15,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656872274] [2021-12-06 22:21:15,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:15,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 22:21:15,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:15,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 22:21:15,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:21:15,797 INFO L87 Difference]: Start difference. First operand 1176 states and 1583 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 22:21:15,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:15,957 INFO L93 Difference]: Finished difference Result 2398 states and 3272 transitions. [2021-12-06 22:21:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 22:21:15,958 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 107 [2021-12-06 22:21:15,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:15,968 INFO L225 Difference]: With dead ends: 2398 [2021-12-06 22:21:15,968 INFO L226 Difference]: Without dead ends: 1514 [2021-12-06 22:21:15,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-06 22:21:15,972 INFO L933 BasicCegarLoop]: 402 mSDtfsCounter, 510 mSDsluCounter, 1818 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:15,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [515 Valid, 2220 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:21:15,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2021-12-06 22:21:16,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1220. [2021-12-06 22:21:16,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 966 states have (on average 1.3457556935817805) internal successors, (1300), 978 states have internal predecessors, (1300), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2021-12-06 22:21:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1624 transitions. [2021-12-06 22:21:16,061 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1624 transitions. Word has length 107 [2021-12-06 22:21:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:16,061 INFO L470 AbstractCegarLoop]: Abstraction has 1220 states and 1624 transitions. [2021-12-06 22:21:16,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 22:21:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1624 transitions. [2021-12-06 22:21:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-06 22:21:16,063 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:16,064 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:16,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 22:21:16,064 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:16,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:16,065 INFO L85 PathProgramCache]: Analyzing trace with hash -70167293, now seen corresponding path program 1 times [2021-12-06 22:21:16,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:16,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792572211] [2021-12-06 22:21:16,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:16,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:16,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:16,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 22:21:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:16,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 22:21:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:16,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 22:21:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:16,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 22:21:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:16,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 22:21:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:16,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-06 22:21:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:16,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-06 22:21:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-06 22:21:16,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:16,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792572211] [2021-12-06 22:21:16,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792572211] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:16,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:16,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 22:21:16,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738172378] [2021-12-06 22:21:16,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:16,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 22:21:16,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:16,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 22:21:16,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:21:16,200 INFO L87 Difference]: Start difference. First operand 1220 states and 1624 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 22:21:16,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:16,390 INFO L93 Difference]: Finished difference Result 2506 states and 3413 transitions. [2021-12-06 22:21:16,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 22:21:16,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 109 [2021-12-06 22:21:16,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:16,397 INFO L225 Difference]: With dead ends: 2506 [2021-12-06 22:21:16,397 INFO L226 Difference]: Without dead ends: 1558 [2021-12-06 22:21:16,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-06 22:21:16,400 INFO L933 BasicCegarLoop]: 432 mSDtfsCounter, 392 mSDsluCounter, 1938 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 2370 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:16,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 2370 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:21:16,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2021-12-06 22:21:16,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1107. [2021-12-06 22:21:16,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 880 states have (on average 1.3465909090909092) internal successors, (1185), 890 states have internal predecessors, (1185), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2021-12-06 22:21:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1475 transitions. [2021-12-06 22:21:16,452 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1475 transitions. Word has length 109 [2021-12-06 22:21:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:16,452 INFO L470 AbstractCegarLoop]: Abstraction has 1107 states and 1475 transitions. [2021-12-06 22:21:16,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 22:21:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1475 transitions. [2021-12-06 22:21:16,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-06 22:21:16,454 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:16,454 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:16,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-06 22:21:16,454 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:16,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:16,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1942381712, now seen corresponding path program 1 times [2021-12-06 22:21:16,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:16,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912369807] [2021-12-06 22:21:16,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:16,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:16,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:16,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 22:21:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:16,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 22:21:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:16,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 22:21:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:16,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 22:21:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:16,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 22:21:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:16,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-06 22:21:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:16,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 22:21:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 22:21:16,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:16,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912369807] [2021-12-06 22:21:16,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912369807] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:16,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:16,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 22:21:16,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658059176] [2021-12-06 22:21:16,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:16,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 22:21:16,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:16,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 22:21:16,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:21:16,562 INFO L87 Difference]: Start difference. First operand 1107 states and 1475 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-06 22:21:17,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:17,044 INFO L93 Difference]: Finished difference Result 2574 states and 3517 transitions. [2021-12-06 22:21:17,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 22:21:17,044 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 110 [2021-12-06 22:21:17,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:17,052 INFO L225 Difference]: With dead ends: 2574 [2021-12-06 22:21:17,052 INFO L226 Difference]: Without dead ends: 1659 [2021-12-06 22:21:17,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-12-06 22:21:17,055 INFO L933 BasicCegarLoop]: 498 mSDtfsCounter, 1025 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:17,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1031 Valid, 2116 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 22:21:17,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2021-12-06 22:21:17,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1123. [2021-12-06 22:21:17,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 888 states have (on average 1.3265765765765767) internal successors, (1178), 899 states have internal predecessors, (1178), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 137 states have call predecessors, (148), 148 states have call successors, (148) [2021-12-06 22:21:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1474 transitions. [2021-12-06 22:21:17,117 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1474 transitions. Word has length 110 [2021-12-06 22:21:17,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:17,117 INFO L470 AbstractCegarLoop]: Abstraction has 1123 states and 1474 transitions. [2021-12-06 22:21:17,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-06 22:21:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1474 transitions. [2021-12-06 22:21:17,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-06 22:21:17,118 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:17,119 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:17,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-06 22:21:17,119 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:17,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:17,119 INFO L85 PathProgramCache]: Analyzing trace with hash -774266467, now seen corresponding path program 1 times [2021-12-06 22:21:17,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:17,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549203275] [2021-12-06 22:21:17,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:17,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:17,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:17,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 22:21:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:17,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 22:21:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:17,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 22:21:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:17,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 22:21:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:17,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 22:21:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:17,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-06 22:21:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:17,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 22:21:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 22:21:17,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:17,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549203275] [2021-12-06 22:21:17,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549203275] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:17,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:17,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:21:17,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125202080] [2021-12-06 22:21:17,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:17,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:21:17,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:17,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:21:17,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:21:17,182 INFO L87 Difference]: Start difference. First operand 1123 states and 1474 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 22:21:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:17,361 INFO L93 Difference]: Finished difference Result 3143 states and 4211 transitions. [2021-12-06 22:21:17,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:21:17,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 110 [2021-12-06 22:21:17,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:17,371 INFO L225 Difference]: With dead ends: 3143 [2021-12-06 22:21:17,371 INFO L226 Difference]: Without dead ends: 2263 [2021-12-06 22:21:17,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:21:17,374 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 431 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:17,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [431 Valid, 1207 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:21:17,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2021-12-06 22:21:17,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 1911. [2021-12-06 22:21:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1911 states, 1486 states have (on average 1.3243606998654105) internal successors, (1968), 1505 states have internal predecessors, (1968), 272 states have call successors, (272), 152 states have call predecessors, (272), 152 states have return successors, (272), 253 states have call predecessors, (272), 272 states have call successors, (272) [2021-12-06 22:21:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 2512 transitions. [2021-12-06 22:21:17,467 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 2512 transitions. Word has length 110 [2021-12-06 22:21:17,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:17,467 INFO L470 AbstractCegarLoop]: Abstraction has 1911 states and 2512 transitions. [2021-12-06 22:21:17,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 22:21:17,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2512 transitions. [2021-12-06 22:21:17,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-12-06 22:21:17,468 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:17,469 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:17,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-06 22:21:17,469 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:17,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:17,469 INFO L85 PathProgramCache]: Analyzing trace with hash -310161198, now seen corresponding path program 1 times [2021-12-06 22:21:17,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:17,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450102205] [2021-12-06 22:21:17,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:17,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:17,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:17,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 22:21:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:17,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 22:21:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:17,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 22:21:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:17,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 22:21:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:17,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 22:21:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:17,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-06 22:21:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:17,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 22:21:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:17,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 22:21:17,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:17,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450102205] [2021-12-06 22:21:17,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450102205] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:17,570 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:17,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 22:21:17,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942231449] [2021-12-06 22:21:17,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:17,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 22:21:17,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:17,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 22:21:17,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:21:17,571 INFO L87 Difference]: Start difference. First operand 1911 states and 2512 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 22:21:18,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:18,050 INFO L93 Difference]: Finished difference Result 4338 states and 5834 transitions. [2021-12-06 22:21:18,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 22:21:18,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 112 [2021-12-06 22:21:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:18,066 INFO L225 Difference]: With dead ends: 4338 [2021-12-06 22:21:18,067 INFO L226 Difference]: Without dead ends: 2764 [2021-12-06 22:21:18,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-12-06 22:21:18,071 INFO L933 BasicCegarLoop]: 567 mSDtfsCounter, 784 mSDsluCounter, 1902 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 2469 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:18,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [787 Valid, 2469 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 22:21:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2021-12-06 22:21:18,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 1932. [2021-12-06 22:21:18,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1932 states, 1494 states have (on average 1.319946452476573) internal successors, (1972), 1514 states have internal predecessors, (1972), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2021-12-06 22:21:18,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2532 transitions. [2021-12-06 22:21:18,175 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 2532 transitions. Word has length 112 [2021-12-06 22:21:18,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:18,175 INFO L470 AbstractCegarLoop]: Abstraction has 1932 states and 2532 transitions. [2021-12-06 22:21:18,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 22:21:18,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2532 transitions. [2021-12-06 22:21:18,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-12-06 22:21:18,177 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:18,177 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:18,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-06 22:21:18,177 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:18,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:18,178 INFO L85 PathProgramCache]: Analyzing trace with hash 567569707, now seen corresponding path program 1 times [2021-12-06 22:21:18,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:18,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878494361] [2021-12-06 22:21:18,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:18,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:18,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:18,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-06 22:21:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:18,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-06 22:21:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:18,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 22:21:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:18,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-06 22:21:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:18,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-06 22:21:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:18,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-06 22:21:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:18,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-06 22:21:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:18,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 22:21:18,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:18,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878494361] [2021-12-06 22:21:18,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878494361] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:18,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:18,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:21:18,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418446758] [2021-12-06 22:21:18,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:18,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:21:18,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:18,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:21:18,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:21:18,232 INFO L87 Difference]: Start difference. First operand 1932 states and 2532 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 22:21:18,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:18,463 INFO L93 Difference]: Finished difference Result 5108 states and 6773 transitions. [2021-12-06 22:21:18,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:21:18,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 113 [2021-12-06 22:21:18,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:18,481 INFO L225 Difference]: With dead ends: 5108 [2021-12-06 22:21:18,481 INFO L226 Difference]: Without dead ends: 3550 [2021-12-06 22:21:18,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:21:18,486 INFO L933 BasicCegarLoop]: 518 mSDtfsCounter, 478 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:18,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [478 Valid, 1271 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:21:18,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3550 states. [2021-12-06 22:21:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3550 to 2983. [2021-12-06 22:21:18,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2983 states, 2270 states have (on average 1.3158590308370044) internal successors, (2987), 2301 states have internal predecessors, (2987), 460 states have call successors, (460), 252 states have call predecessors, (460), 252 states have return successors, (460), 429 states have call predecessors, (460), 460 states have call successors, (460) [2021-12-06 22:21:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 3907 transitions. [2021-12-06 22:21:18,679 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 3907 transitions. Word has length 113 [2021-12-06 22:21:18,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:18,679 INFO L470 AbstractCegarLoop]: Abstraction has 2983 states and 3907 transitions. [2021-12-06 22:21:18,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 22:21:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 3907 transitions. [2021-12-06 22:21:18,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-12-06 22:21:18,681 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:18,682 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:18,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-06 22:21:18,682 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:18,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:18,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2081657829, now seen corresponding path program 1 times [2021-12-06 22:21:18,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:18,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267758675] [2021-12-06 22:21:18,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:18,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:18,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:18,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-06 22:21:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:18,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-06 22:21:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:18,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 22:21:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:18,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 22:21:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:18,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 22:21:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:18,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-06 22:21:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:18,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-06 22:21:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 22:21:18,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:18,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267758675] [2021-12-06 22:21:18,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267758675] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:18,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:18,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:21:18,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773943214] [2021-12-06 22:21:18,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:18,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:21:18,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:18,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:21:18,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:21:18,735 INFO L87 Difference]: Start difference. First operand 2983 states and 3907 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 22:21:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:18,998 INFO L93 Difference]: Finished difference Result 7065 states and 9320 transitions. [2021-12-06 22:21:18,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:21:18,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 113 [2021-12-06 22:21:18,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:19,014 INFO L225 Difference]: With dead ends: 7065 [2021-12-06 22:21:19,014 INFO L226 Difference]: Without dead ends: 4582 [2021-12-06 22:21:19,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:21:19,019 INFO L933 BasicCegarLoop]: 541 mSDtfsCounter, 425 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:19,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 1267 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:21:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4582 states. [2021-12-06 22:21:19,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4582 to 4250. [2021-12-06 22:21:19,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4250 states, 3213 states have (on average 1.3137254901960784) internal successors, (4221), 3257 states have internal predecessors, (4221), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2021-12-06 22:21:19,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 5565 transitions. [2021-12-06 22:21:19,219 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 5565 transitions. Word has length 113 [2021-12-06 22:21:19,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:19,219 INFO L470 AbstractCegarLoop]: Abstraction has 4250 states and 5565 transitions. [2021-12-06 22:21:19,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 22:21:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 5565 transitions. [2021-12-06 22:21:19,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-12-06 22:21:19,221 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:19,222 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:19,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-06 22:21:19,222 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:19,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:19,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1903646935, now seen corresponding path program 1 times [2021-12-06 22:21:19,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:19,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506782852] [2021-12-06 22:21:19,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:19,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:19,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:19,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 22:21:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:19,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 22:21:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:19,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-06 22:21:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:19,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-06 22:21:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:19,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 22:21:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:19,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-06 22:21:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:19,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-06 22:21:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 22:21:19,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:19,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506782852] [2021-12-06 22:21:19,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506782852] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:19,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:19,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:21:19,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058905295] [2021-12-06 22:21:19,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:19,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:21:19,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:19,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:21:19,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:21:19,260 INFO L87 Difference]: Start difference. First operand 4250 states and 5565 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 22:21:19,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:19,555 INFO L93 Difference]: Finished difference Result 9611 states and 13025 transitions. [2021-12-06 22:21:19,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:21:19,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 114 [2021-12-06 22:21:19,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:19,569 INFO L225 Difference]: With dead ends: 9611 [2021-12-06 22:21:19,569 INFO L226 Difference]: Without dead ends: 5754 [2021-12-06 22:21:19,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:21:19,576 INFO L933 BasicCegarLoop]: 451 mSDtfsCounter, 147 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:19,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 695 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:21:19,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5754 states. [2021-12-06 22:21:19,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5754 to 4256. [2021-12-06 22:21:19,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4256 states, 3219 states have (on average 1.3131407269338304) internal successors, (4227), 3263 states have internal predecessors, (4227), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2021-12-06 22:21:19,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4256 states to 4256 states and 5571 transitions. [2021-12-06 22:21:19,831 INFO L78 Accepts]: Start accepts. Automaton has 4256 states and 5571 transitions. Word has length 114 [2021-12-06 22:21:19,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:19,831 INFO L470 AbstractCegarLoop]: Abstraction has 4256 states and 5571 transitions. [2021-12-06 22:21:19,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 22:21:19,831 INFO L276 IsEmpty]: Start isEmpty. Operand 4256 states and 5571 transitions. [2021-12-06 22:21:19,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-06 22:21:19,833 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:19,833 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:19,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-06 22:21:19,833 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:19,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:19,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1189787434, now seen corresponding path program 1 times [2021-12-06 22:21:19,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:19,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501458501] [2021-12-06 22:21:19,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:19,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:19,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:19,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-06 22:21:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:19,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-06 22:21:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:19,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 22:21:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:19,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 22:21:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:19,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 22:21:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:19,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-06 22:21:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:19,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-06 22:21:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 22:21:19,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:19,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501458501] [2021-12-06 22:21:19,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501458501] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:19,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:19,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:21:19,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631285563] [2021-12-06 22:21:19,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:19,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:21:19,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:19,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:21:19,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:21:19,889 INFO L87 Difference]: Start difference. First operand 4256 states and 5571 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 22:21:20,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:20,132 INFO L93 Difference]: Finished difference Result 8925 states and 11935 transitions. [2021-12-06 22:21:20,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:21:20,132 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 115 [2021-12-06 22:21:20,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:20,143 INFO L225 Difference]: With dead ends: 8925 [2021-12-06 22:21:20,144 INFO L226 Difference]: Without dead ends: 4762 [2021-12-06 22:21:20,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:21:20,151 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 355 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:20,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 868 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:21:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4762 states. [2021-12-06 22:21:20,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4762 to 3831. [2021-12-06 22:21:20,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3831 states, 2877 states have (on average 1.3183872088981579) internal successors, (3793), 2911 states have internal predecessors, (3793), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2021-12-06 22:21:20,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3831 states to 3831 states and 5033 transitions. [2021-12-06 22:21:20,343 INFO L78 Accepts]: Start accepts. Automaton has 3831 states and 5033 transitions. Word has length 115 [2021-12-06 22:21:20,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:20,343 INFO L470 AbstractCegarLoop]: Abstraction has 3831 states and 5033 transitions. [2021-12-06 22:21:20,343 INFO L471 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 22:21:20,343 INFO L276 IsEmpty]: Start isEmpty. Operand 3831 states and 5033 transitions. [2021-12-06 22:21:20,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-06 22:21:20,344 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:20,344 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:20,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-06 22:21:20,345 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:20,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:20,345 INFO L85 PathProgramCache]: Analyzing trace with hash 2125702498, now seen corresponding path program 1 times [2021-12-06 22:21:20,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:20,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174854912] [2021-12-06 22:21:20,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:20,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:20,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:20,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 22:21:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:20,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 22:21:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:20,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-06 22:21:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:20,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-06 22:21:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:20,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 22:21:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:20,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-06 22:21:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:20,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-06 22:21:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:20,384 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 22:21:20,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:20,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174854912] [2021-12-06 22:21:20,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174854912] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:20,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:20,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:21:20,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370386999] [2021-12-06 22:21:20,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:20,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:21:20,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:20,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:21:20,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:21:20,385 INFO L87 Difference]: Start difference. First operand 3831 states and 5033 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 22:21:20,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:20,678 INFO L93 Difference]: Finished difference Result 8429 states and 11367 transitions. [2021-12-06 22:21:20,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:21:20,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 116 [2021-12-06 22:21:20,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:20,689 INFO L225 Difference]: With dead ends: 8429 [2021-12-06 22:21:20,689 INFO L226 Difference]: Without dead ends: 4805 [2021-12-06 22:21:20,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:21:20,696 INFO L933 BasicCegarLoop]: 430 mSDtfsCounter, 147 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:20,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 671 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:21:20,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4805 states. [2021-12-06 22:21:20,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4805 to 3841. [2021-12-06 22:21:20,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3841 states, 2887 states have (on average 1.3172843782473156) internal successors, (3803), 2921 states have internal predecessors, (3803), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2021-12-06 22:21:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 5043 transitions. [2021-12-06 22:21:20,934 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 5043 transitions. Word has length 116 [2021-12-06 22:21:20,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:20,934 INFO L470 AbstractCegarLoop]: Abstraction has 3841 states and 5043 transitions. [2021-12-06 22:21:20,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 22:21:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 5043 transitions. [2021-12-06 22:21:20,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-06 22:21:20,935 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:20,935 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:20,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-06 22:21:20,935 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:20,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:20,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1886314147, now seen corresponding path program 1 times [2021-12-06 22:21:20,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:20,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297518390] [2021-12-06 22:21:20,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:20,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:20,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:20,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 22:21:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:20,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 22:21:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:20,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-06 22:21:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:20,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-06 22:21:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:20,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 22:21:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:20,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-06 22:21:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:20,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-06 22:21:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 22:21:20,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:20,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297518390] [2021-12-06 22:21:20,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297518390] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:20,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:20,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:21:20,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964624490] [2021-12-06 22:21:20,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:20,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:21:20,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:20,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:21:20,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:21:20,990 INFO L87 Difference]: Start difference. First operand 3841 states and 5043 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 22:21:21,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:21,250 INFO L93 Difference]: Finished difference Result 8381 states and 11288 transitions. [2021-12-06 22:21:21,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:21:21,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 116 [2021-12-06 22:21:21,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:21,264 INFO L225 Difference]: With dead ends: 8381 [2021-12-06 22:21:21,264 INFO L226 Difference]: Without dead ends: 4682 [2021-12-06 22:21:21,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:21:21,270 INFO L933 BasicCegarLoop]: 353 mSDtfsCounter, 270 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:21,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 899 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:21:21,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2021-12-06 22:21:21,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 2893. [2021-12-06 22:21:21,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2893 states, 2173 states have (on average 1.3069489185457892) internal successors, (2840), 2192 states have internal predecessors, (2840), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2021-12-06 22:21:21,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 3778 transitions. [2021-12-06 22:21:21,438 INFO L78 Accepts]: Start accepts. Automaton has 2893 states and 3778 transitions. Word has length 116 [2021-12-06 22:21:21,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:21,438 INFO L470 AbstractCegarLoop]: Abstraction has 2893 states and 3778 transitions. [2021-12-06 22:21:21,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 22:21:21,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 3778 transitions. [2021-12-06 22:21:21,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-12-06 22:21:21,442 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:21,442 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:21,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-06 22:21:21,442 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:21,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash -819225012, now seen corresponding path program 1 times [2021-12-06 22:21:21,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:21,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819137291] [2021-12-06 22:21:21,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:21,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:21,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:21,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 22:21:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:21,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 22:21:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:21,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 22:21:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:21,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 22:21:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:21,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 22:21:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:21,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-06 22:21:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:21,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-06 22:21:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:21,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-06 22:21:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:21,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-06 22:21:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:21,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-06 22:21:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:21,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-06 22:21:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:21,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-12-06 22:21:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:21,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-06 22:21:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-06 22:21:21,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:21,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819137291] [2021-12-06 22:21:21,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819137291] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:21:21,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861034357] [2021-12-06 22:21:21,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:21,571 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:21:21,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:21:21,572 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:21:21,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 22:21:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:21,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 22:21:21,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:21:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 77 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 22:21:21,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:21:22,198 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-06 22:21:22,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861034357] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:21:22,198 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:21:22,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2021-12-06 22:21:22,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198620815] [2021-12-06 22:21:22,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:21:22,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 22:21:22,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:22,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 22:21:22,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-12-06 22:21:22,200 INFO L87 Difference]: Start difference. First operand 2893 states and 3778 transitions. Second operand has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 13 states have internal predecessors, (258), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2021-12-06 22:21:24,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:24,426 INFO L93 Difference]: Finished difference Result 9910 states and 13836 transitions. [2021-12-06 22:21:24,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-12-06 22:21:24,427 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 13 states have internal predecessors, (258), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 183 [2021-12-06 22:21:24,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:24,440 INFO L225 Difference]: With dead ends: 9910 [2021-12-06 22:21:24,440 INFO L226 Difference]: Without dead ends: 7296 [2021-12-06 22:21:24,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 398 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=749, Invalid=3411, Unknown=0, NotChecked=0, Total=4160 [2021-12-06 22:21:24,446 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 3784 mSDsluCounter, 2615 mSDsCounter, 0 mSdLazyCounter, 1777 mSolverCounterSat, 1020 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3784 SdHoareTripleChecker+Valid, 2948 SdHoareTripleChecker+Invalid, 2797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1020 IncrementalHoareTripleChecker+Valid, 1777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:24,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3784 Valid, 2948 Invalid, 2797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1020 Valid, 1777 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-06 22:21:24,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7296 states. [2021-12-06 22:21:24,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7296 to 3417. [2021-12-06 22:21:24,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3417 states, 2590 states have (on average 1.303861003861004) internal successors, (3377), 2610 states have internal predecessors, (3377), 531 states have call successors, (531), 295 states have call predecessors, (531), 295 states have return successors, (531), 511 states have call predecessors, (531), 531 states have call successors, (531) [2021-12-06 22:21:24,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 3417 states and 4439 transitions. [2021-12-06 22:21:24,726 INFO L78 Accepts]: Start accepts. Automaton has 3417 states and 4439 transitions. Word has length 183 [2021-12-06 22:21:24,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:24,726 INFO L470 AbstractCegarLoop]: Abstraction has 3417 states and 4439 transitions. [2021-12-06 22:21:24,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 13 states have internal predecessors, (258), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2021-12-06 22:21:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 4439 transitions. [2021-12-06 22:21:24,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-12-06 22:21:24,731 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:24,731 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:24,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 22:21:24,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:21:24,932 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:24,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:24,932 INFO L85 PathProgramCache]: Analyzing trace with hash -3113841, now seen corresponding path program 1 times [2021-12-06 22:21:24,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:24,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718645136] [2021-12-06 22:21:24,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:24,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:25,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:25,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 22:21:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:25,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 22:21:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:25,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 22:21:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:25,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 22:21:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:25,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 22:21:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:25,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-06 22:21:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:25,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-06 22:21:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:25,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-06 22:21:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:25,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-06 22:21:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:25,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-06 22:21:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:25,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-06 22:21:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:25,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-12-06 22:21:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:25,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-06 22:21:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:25,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2021-12-06 22:21:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-12-06 22:21:25,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:25,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718645136] [2021-12-06 22:21:25,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718645136] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:21:25,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908310270] [2021-12-06 22:21:25,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:25,102 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:21:25,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:21:25,103 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:21:25,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 22:21:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:25,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-06 22:21:25,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:21:25,473 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 36 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 22:21:25,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:21:25,703 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-06 22:21:25,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908310270] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:21:25,703 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:21:25,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2021-12-06 22:21:25,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527255600] [2021-12-06 22:21:25,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:21:25,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-06 22:21:25,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:25,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-06 22:21:25,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-12-06 22:21:25,705 INFO L87 Difference]: Start difference. First operand 3417 states and 4439 transitions. Second operand has 16 states, 16 states have (on average 16.25) internal successors, (260), 14 states have internal predecessors, (260), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2021-12-06 22:21:31,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:31,732 INFO L93 Difference]: Finished difference Result 17179 states and 23292 transitions. [2021-12-06 22:21:31,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2021-12-06 22:21:31,733 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 16.25) internal successors, (260), 14 states have internal predecessors, (260), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) Word has length 191 [2021-12-06 22:21:31,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:31,759 INFO L225 Difference]: With dead ends: 17179 [2021-12-06 22:21:31,759 INFO L226 Difference]: Without dead ends: 14050 [2021-12-06 22:21:31,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 470 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5045 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1835, Invalid=12207, Unknown=0, NotChecked=0, Total=14042 [2021-12-06 22:21:31,769 INFO L933 BasicCegarLoop]: 1778 mSDtfsCounter, 5625 mSDsluCounter, 14948 mSDsCounter, 0 mSdLazyCounter, 6199 mSolverCounterSat, 3508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5625 SdHoareTripleChecker+Valid, 16726 SdHoareTripleChecker+Invalid, 9707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3508 IncrementalHoareTripleChecker+Valid, 6199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:31,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5625 Valid, 16726 Invalid, 9707 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3508 Valid, 6199 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2021-12-06 22:21:31,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14050 states. [2021-12-06 22:21:32,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14050 to 6239. [2021-12-06 22:21:32,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6239 states, 4695 states have (on average 1.3020234291799786) internal successors, (6113), 4733 states have internal predecessors, (6113), 992 states have call successors, (992), 551 states have call predecessors, (992), 551 states have return successors, (992), 954 states have call predecessors, (992), 992 states have call successors, (992) [2021-12-06 22:21:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6239 states to 6239 states and 8097 transitions. [2021-12-06 22:21:32,253 INFO L78 Accepts]: Start accepts. Automaton has 6239 states and 8097 transitions. Word has length 191 [2021-12-06 22:21:32,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:32,254 INFO L470 AbstractCegarLoop]: Abstraction has 6239 states and 8097 transitions. [2021-12-06 22:21:32,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.25) internal successors, (260), 14 states have internal predecessors, (260), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2021-12-06 22:21:32,254 INFO L276 IsEmpty]: Start isEmpty. Operand 6239 states and 8097 transitions. [2021-12-06 22:21:32,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-12-06 22:21:32,261 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:32,261 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:32,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 22:21:32,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-06 22:21:32,462 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:32,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:32,462 INFO L85 PathProgramCache]: Analyzing trace with hash 443099026, now seen corresponding path program 1 times [2021-12-06 22:21:32,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:32,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7792627] [2021-12-06 22:21:32,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:32,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:32,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:32,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 22:21:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:32,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-06 22:21:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:32,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 22:21:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:32,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-06 22:21:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:32,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-06 22:21:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:32,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 22:21:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:32,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 22:21:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:32,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-06 22:21:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:32,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-06 22:21:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:32,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-06 22:21:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:32,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-06 22:21:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:32,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-12-06 22:21:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:32,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-06 22:21:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:32,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-12-06 22:21:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-06 22:21:32,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:32,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7792627] [2021-12-06 22:21:32,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7792627] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:32,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:32,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 22:21:32,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432051045] [2021-12-06 22:21:32,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:32,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 22:21:32,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:32,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 22:21:32,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:21:32,549 INFO L87 Difference]: Start difference. First operand 6239 states and 8097 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 6 states have internal predecessors, (114), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-06 22:21:33,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:33,762 INFO L93 Difference]: Finished difference Result 20975 states and 27883 transitions. [2021-12-06 22:21:33,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 22:21:33,762 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 6 states have internal predecessors, (114), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 193 [2021-12-06 22:21:33,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:33,789 INFO L225 Difference]: With dead ends: 20975 [2021-12-06 22:21:33,789 INFO L226 Difference]: Without dead ends: 15086 [2021-12-06 22:21:33,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-12-06 22:21:33,800 INFO L933 BasicCegarLoop]: 564 mSDtfsCounter, 795 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 3036 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:33,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [814 Valid, 3036 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:21:33,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15086 states. [2021-12-06 22:21:34,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15086 to 8081. [2021-12-06 22:21:34,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8081 states, 6025 states have (on average 1.3014107883817427) internal successors, (7841), 6076 states have internal predecessors, (7841), 1335 states have call successors, (1335), 720 states have call predecessors, (1335), 720 states have return successors, (1335), 1284 states have call predecessors, (1335), 1335 states have call successors, (1335) [2021-12-06 22:21:34,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8081 states to 8081 states and 10511 transitions. [2021-12-06 22:21:34,497 INFO L78 Accepts]: Start accepts. Automaton has 8081 states and 10511 transitions. Word has length 193 [2021-12-06 22:21:34,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:34,498 INFO L470 AbstractCegarLoop]: Abstraction has 8081 states and 10511 transitions. [2021-12-06 22:21:34,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 6 states have internal predecessors, (114), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-06 22:21:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 8081 states and 10511 transitions. [2021-12-06 22:21:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-12-06 22:21:34,505 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:34,505 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:34,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-06 22:21:34,506 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:34,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:34,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1247019034, now seen corresponding path program 1 times [2021-12-06 22:21:34,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:34,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960986812] [2021-12-06 22:21:34,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:34,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:34,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:34,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 22:21:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:34,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-06 22:21:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:34,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 22:21:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:34,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-06 22:21:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:34,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-06 22:21:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:34,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 22:21:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:34,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 22:21:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:34,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-06 22:21:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:34,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-06 22:21:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:34,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-12-06 22:21:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:34,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-12-06 22:21:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:34,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-06 22:21:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:34,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-06 22:21:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:34,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-12-06 22:21:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:34,621 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-06 22:21:34,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:34,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960986812] [2021-12-06 22:21:34,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960986812] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:21:34,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552005325] [2021-12-06 22:21:34,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:34,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:21:34,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:21:34,622 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:21:34,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 22:21:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:34,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-06 22:21:34,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:21:34,872 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 49 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-06 22:21:34,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:21:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-12-06 22:21:35,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552005325] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 22:21:35,021 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-06 22:21:35,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 7] total 13 [2021-12-06 22:21:35,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453131406] [2021-12-06 22:21:35,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:35,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:21:35,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:35,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:21:35,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-06 22:21:35,022 INFO L87 Difference]: Start difference. First operand 8081 states and 10511 transitions. Second operand has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-06 22:21:35,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:35,386 INFO L93 Difference]: Finished difference Result 13315 states and 17370 transitions. [2021-12-06 22:21:35,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:21:35,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 194 [2021-12-06 22:21:35,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:35,397 INFO L225 Difference]: With dead ends: 13315 [2021-12-06 22:21:35,397 INFO L226 Difference]: Without dead ends: 5438 [2021-12-06 22:21:35,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-06 22:21:35,405 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 2 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:35,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1140 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:21:35,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5438 states. [2021-12-06 22:21:35,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5438 to 5438. [2021-12-06 22:21:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5438 states, 4056 states have (on average 1.3015285996055226) internal successors, (5279), 4090 states have internal predecessors, (5279), 901 states have call successors, (901), 480 states have call predecessors, (901), 480 states have return successors, (901), 867 states have call predecessors, (901), 901 states have call successors, (901) [2021-12-06 22:21:35,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5438 states to 5438 states and 7081 transitions. [2021-12-06 22:21:35,789 INFO L78 Accepts]: Start accepts. Automaton has 5438 states and 7081 transitions. Word has length 194 [2021-12-06 22:21:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:35,789 INFO L470 AbstractCegarLoop]: Abstraction has 5438 states and 7081 transitions. [2021-12-06 22:21:35,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-06 22:21:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 5438 states and 7081 transitions. [2021-12-06 22:21:35,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-12-06 22:21:35,795 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:35,795 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:35,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 22:21:35,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:21:35,996 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:35,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:35,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1409082137, now seen corresponding path program 1 times [2021-12-06 22:21:35,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:35,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796123616] [2021-12-06 22:21:35,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:35,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:36,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:36,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 22:21:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:36,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-06 22:21:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:36,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 22:21:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:36,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-06 22:21:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:36,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-06 22:21:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:36,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 22:21:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:36,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 22:21:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:36,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-06 22:21:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:36,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-06 22:21:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:36,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-12-06 22:21:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:36,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-12-06 22:21:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:36,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-06 22:21:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:36,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-06 22:21:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:36,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-12-06 22:21:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-06 22:21:36,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:36,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796123616] [2021-12-06 22:21:36,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796123616] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:21:36,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895616517] [2021-12-06 22:21:36,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:36,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:21:36,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:21:36,161 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:21:36,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 22:21:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:36,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 22:21:36,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:21:36,494 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-06 22:21:36,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:21:36,672 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-06 22:21:36,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895616517] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:21:36,673 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:21:36,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2021-12-06 22:21:36,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248260495] [2021-12-06 22:21:36,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:21:36,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-06 22:21:36,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:36,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-06 22:21:36,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-12-06 22:21:36,675 INFO L87 Difference]: Start difference. First operand 5438 states and 7081 transitions. Second operand has 17 states, 17 states have (on average 14.235294117647058) internal successors, (242), 16 states have internal predecessors, (242), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2021-12-06 22:21:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:39,767 INFO L93 Difference]: Finished difference Result 15325 states and 20984 transitions. [2021-12-06 22:21:39,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-12-06 22:21:39,768 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 14.235294117647058) internal successors, (242), 16 states have internal predecessors, (242), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 194 [2021-12-06 22:21:39,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:39,787 INFO L225 Difference]: With dead ends: 15325 [2021-12-06 22:21:39,787 INFO L226 Difference]: Without dead ends: 10092 [2021-12-06 22:21:39,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1413 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=662, Invalid=4168, Unknown=0, NotChecked=0, Total=4830 [2021-12-06 22:21:39,795 INFO L933 BasicCegarLoop]: 559 mSDtfsCounter, 3890 mSDsluCounter, 5371 mSDsCounter, 0 mSdLazyCounter, 3831 mSolverCounterSat, 1541 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3890 SdHoareTripleChecker+Valid, 5930 SdHoareTripleChecker+Invalid, 5372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1541 IncrementalHoareTripleChecker+Valid, 3831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:39,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3890 Valid, 5930 Invalid, 5372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1541 Valid, 3831 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-06 22:21:39,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10092 states. [2021-12-06 22:21:40,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10092 to 6035. [2021-12-06 22:21:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6035 states, 4499 states have (on average 1.2973994220937985) internal successors, (5837), 4537 states have internal predecessors, (5837), 998 states have call successors, (998), 537 states have call predecessors, (998), 537 states have return successors, (998), 960 states have call predecessors, (998), 998 states have call successors, (998) [2021-12-06 22:21:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6035 states to 6035 states and 7833 transitions. [2021-12-06 22:21:40,338 INFO L78 Accepts]: Start accepts. Automaton has 6035 states and 7833 transitions. Word has length 194 [2021-12-06 22:21:40,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:40,339 INFO L470 AbstractCegarLoop]: Abstraction has 6035 states and 7833 transitions. [2021-12-06 22:21:40,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.235294117647058) internal successors, (242), 16 states have internal predecessors, (242), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2021-12-06 22:21:40,339 INFO L276 IsEmpty]: Start isEmpty. Operand 6035 states and 7833 transitions. [2021-12-06 22:21:40,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2021-12-06 22:21:40,345 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:40,345 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:40,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 22:21:40,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:21:40,547 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:40,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:40,548 INFO L85 PathProgramCache]: Analyzing trace with hash 982964359, now seen corresponding path program 1 times [2021-12-06 22:21:40,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:40,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29786347] [2021-12-06 22:21:40,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:40,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:40,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:40,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 22:21:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:40,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-06 22:21:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:40,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 22:21:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:40,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-06 22:21:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:40,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-06 22:21:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:40,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 22:21:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:40,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 22:21:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:40,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-06 22:21:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:40,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-06 22:21:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:40,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-06 22:21:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:40,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-06 22:21:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:40,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-06 22:21:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:40,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-06 22:21:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:40,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-12-06 22:21:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:40,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2021-12-06 22:21:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-12-06 22:21:40,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:40,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29786347] [2021-12-06 22:21:40,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29786347] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:40,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:40,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 22:21:40,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63267070] [2021-12-06 22:21:40,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:40,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:21:40,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:40,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:21:40,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:21:40,666 INFO L87 Difference]: Start difference. First operand 6035 states and 7833 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-06 22:21:41,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:41,171 INFO L93 Difference]: Finished difference Result 11515 states and 15000 transitions. [2021-12-06 22:21:41,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:21:41,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (13), 2 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 202 [2021-12-06 22:21:41,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:41,182 INFO L225 Difference]: With dead ends: 11515 [2021-12-06 22:21:41,183 INFO L226 Difference]: Without dead ends: 5674 [2021-12-06 22:21:41,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:21:41,190 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 445 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:41,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [445 Valid, 469 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:21:41,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5674 states. [2021-12-06 22:21:41,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5674 to 5674. [2021-12-06 22:21:41,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5674 states, 4232 states have (on average 1.2984404536862004) internal successors, (5495), 4268 states have internal predecessors, (5495), 938 states have call successors, (938), 503 states have call predecessors, (938), 503 states have return successors, (938), 902 states have call predecessors, (938), 938 states have call successors, (938) [2021-12-06 22:21:41,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5674 states to 5674 states and 7371 transitions. [2021-12-06 22:21:41,645 INFO L78 Accepts]: Start accepts. Automaton has 5674 states and 7371 transitions. Word has length 202 [2021-12-06 22:21:41,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:41,645 INFO L470 AbstractCegarLoop]: Abstraction has 5674 states and 7371 transitions. [2021-12-06 22:21:41,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-06 22:21:41,645 INFO L276 IsEmpty]: Start isEmpty. Operand 5674 states and 7371 transitions. [2021-12-06 22:21:41,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-12-06 22:21:41,650 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:41,651 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:41,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-06 22:21:41,651 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:41,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:41,651 INFO L85 PathProgramCache]: Analyzing trace with hash -36943327, now seen corresponding path program 1 times [2021-12-06 22:21:41,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:41,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926882853] [2021-12-06 22:21:41,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:41,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:41,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:41,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 22:21:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:41,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-06 22:21:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:41,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 22:21:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:41,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-06 22:21:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:41,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-06 22:21:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:41,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 22:21:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:41,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 22:21:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:41,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-06 22:21:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:41,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-06 22:21:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:41,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-06 22:21:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:41,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-12-06 22:21:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:41,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-12-06 22:21:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:41,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-12-06 22:21:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:41,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-12-06 22:21:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:41,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2021-12-06 22:21:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-06 22:21:41,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:41,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926882853] [2021-12-06 22:21:41,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926882853] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:21:41,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224859613] [2021-12-06 22:21:41,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:41,805 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:21:41,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:21:41,806 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:21:41,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 22:21:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:41,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 22:21:41,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:21:42,149 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 80 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-06 22:21:42,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:21:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-12-06 22:21:42,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224859613] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:21:42,370 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:21:42,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2021-12-06 22:21:42,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668113666] [2021-12-06 22:21:42,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:21:42,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-06 22:21:42,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:42,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-06 22:21:42,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-12-06 22:21:42,372 INFO L87 Difference]: Start difference. First operand 5674 states and 7371 transitions. Second operand has 17 states, 17 states have (on average 15.294117647058824) internal successors, (260), 16 states have internal predecessors, (260), 6 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 7 states have call predecessors, (40), 6 states have call successors, (40) [2021-12-06 22:21:46,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:46,466 INFO L93 Difference]: Finished difference Result 16824 states and 23110 transitions. [2021-12-06 22:21:46,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-12-06 22:21:46,467 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 15.294117647058824) internal successors, (260), 16 states have internal predecessors, (260), 6 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 7 states have call predecessors, (40), 6 states have call successors, (40) Word has length 203 [2021-12-06 22:21:46,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:46,487 INFO L225 Difference]: With dead ends: 16824 [2021-12-06 22:21:46,487 INFO L226 Difference]: Without dead ends: 11355 [2021-12-06 22:21:46,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 439 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2055 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=886, Invalid=5594, Unknown=0, NotChecked=0, Total=6480 [2021-12-06 22:21:46,496 INFO L933 BasicCegarLoop]: 626 mSDtfsCounter, 3274 mSDsluCounter, 6051 mSDsCounter, 0 mSdLazyCounter, 5075 mSolverCounterSat, 1645 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3274 SdHoareTripleChecker+Valid, 6677 SdHoareTripleChecker+Invalid, 6720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1645 IncrementalHoareTripleChecker+Valid, 5075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:46,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3274 Valid, 6677 Invalid, 6720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1645 Valid, 5075 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-06 22:21:46,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11355 states. [2021-12-06 22:21:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11355 to 6317. [2021-12-06 22:21:47,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6317 states, 4719 states have (on average 1.2947658402203857) internal successors, (6110), 4759 states have internal predecessors, (6110), 1036 states have call successors, (1036), 561 states have call predecessors, (1036), 561 states have return successors, (1036), 996 states have call predecessors, (1036), 1036 states have call successors, (1036) [2021-12-06 22:21:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6317 states to 6317 states and 8182 transitions. [2021-12-06 22:21:47,178 INFO L78 Accepts]: Start accepts. Automaton has 6317 states and 8182 transitions. Word has length 203 [2021-12-06 22:21:47,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:47,178 INFO L470 AbstractCegarLoop]: Abstraction has 6317 states and 8182 transitions. [2021-12-06 22:21:47,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.294117647058824) internal successors, (260), 16 states have internal predecessors, (260), 6 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 7 states have call predecessors, (40), 6 states have call successors, (40) [2021-12-06 22:21:47,178 INFO L276 IsEmpty]: Start isEmpty. Operand 6317 states and 8182 transitions. [2021-12-06 22:21:47,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-12-06 22:21:47,185 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:47,185 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:47,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-06 22:21:47,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-12-06 22:21:47,387 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:47,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:47,388 INFO L85 PathProgramCache]: Analyzing trace with hash -431921951, now seen corresponding path program 1 times [2021-12-06 22:21:47,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:47,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558173786] [2021-12-06 22:21:47,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:47,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:47,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 22:21:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:47,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 22:21:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:47,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-06 22:21:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:47,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 22:21:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:47,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-06 22:21:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:47,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-06 22:21:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:47,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-06 22:21:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:47,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-06 22:21:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:47,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-06 22:21:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:47,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-12-06 22:21:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:47,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-06 22:21:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:47,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-06 22:21:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:47,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-06 22:21:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:47,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-06 22:21:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:47,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-12-06 22:21:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:47,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2021-12-06 22:21:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:47,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2021-12-06 22:21:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:47,478 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-12-06 22:21:47,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:47,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558173786] [2021-12-06 22:21:47,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558173786] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:47,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:47,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:21:47,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870446500] [2021-12-06 22:21:47,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:47,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:21:47,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:47,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:21:47,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:21:47,480 INFO L87 Difference]: Start difference. First operand 6317 states and 8182 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-06 22:21:48,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:21:48,022 INFO L93 Difference]: Finished difference Result 11872 states and 15440 transitions. [2021-12-06 22:21:48,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:21:48,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 210 [2021-12-06 22:21:48,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:21:48,031 INFO L225 Difference]: With dead ends: 11872 [2021-12-06 22:21:48,031 INFO L226 Difference]: Without dead ends: 5751 [2021-12-06 22:21:48,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:21:48,038 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 232 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:21:48,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 482 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:21:48,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5751 states. [2021-12-06 22:21:48,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5751 to 5743. [2021-12-06 22:21:48,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5743 states, 4299 states have (on average 1.2949523144917423) internal successors, (5567), 4335 states have internal predecessors, (5567), 939 states have call successors, (939), 504 states have call predecessors, (939), 504 states have return successors, (939), 903 states have call predecessors, (939), 939 states have call successors, (939) [2021-12-06 22:21:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5743 states to 5743 states and 7445 transitions. [2021-12-06 22:21:48,514 INFO L78 Accepts]: Start accepts. Automaton has 5743 states and 7445 transitions. Word has length 210 [2021-12-06 22:21:48,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:21:48,514 INFO L470 AbstractCegarLoop]: Abstraction has 5743 states and 7445 transitions. [2021-12-06 22:21:48,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-06 22:21:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 5743 states and 7445 transitions. [2021-12-06 22:21:48,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-12-06 22:21:48,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:21:48,520 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:48,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-06 22:21:48,520 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:21:48,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:48,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1543464084, now seen corresponding path program 1 times [2021-12-06 22:21:48,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:48,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153900856] [2021-12-06 22:21:48,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:48,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:21:48,560 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 22:21:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:21:48,697 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 22:21:48,697 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 22:21:48,698 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 22:21:48,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-06 22:21:48,701 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:48,704 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 22:21:48,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 10:21:48 BoogieIcfgContainer [2021-12-06 22:21:48,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 22:21:48,855 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 22:21:48,855 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 22:21:48,855 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 22:21:48,855 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:21:11" (3/4) ... [2021-12-06 22:21:48,857 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 22:21:49,005 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 22:21:49,005 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 22:21:49,005 INFO L158 Benchmark]: Toolchain (without parser) took 37933.80ms. Allocated memory was 123.7MB in the beginning and 1.1GB in the end (delta: 941.6MB). Free memory was 88.4MB in the beginning and 819.6MB in the end (delta: -731.2MB). Peak memory consumption was 211.3MB. Max. memory is 16.1GB. [2021-12-06 22:21:49,005 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 123.7MB. Free memory was 105.5MB in the beginning and 105.4MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 22:21:49,005 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.65ms. Allocated memory is still 123.7MB. Free memory was 88.2MB in the beginning and 95.2MB in the end (delta: -7.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-06 22:21:49,006 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.86ms. Allocated memory is still 123.7MB. Free memory was 95.2MB in the beginning and 91.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 22:21:49,006 INFO L158 Benchmark]: Boogie Preprocessor took 35.50ms. Allocated memory is still 123.7MB. Free memory was 91.6MB in the beginning and 89.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 22:21:49,006 INFO L158 Benchmark]: RCFGBuilder took 497.79ms. Allocated memory is still 123.7MB. Free memory was 89.5MB in the beginning and 62.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-12-06 22:21:49,006 INFO L158 Benchmark]: TraceAbstraction took 36882.22ms. Allocated memory was 123.7MB in the beginning and 1.1GB in the end (delta: 941.6MB). Free memory was 61.6MB in the beginning and 871.9MB in the end (delta: -810.3MB). Peak memory consumption was 696.0MB. Max. memory is 16.1GB. [2021-12-06 22:21:49,006 INFO L158 Benchmark]: Witness Printer took 150.11ms. Allocated memory is still 1.1GB. Free memory was 871.9MB in the beginning and 819.6MB in the end (delta: 52.3MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2021-12-06 22:21:49,007 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.13ms. Allocated memory is still 123.7MB. Free memory was 105.5MB in the beginning and 105.4MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.65ms. Allocated memory is still 123.7MB. Free memory was 88.2MB in the beginning and 95.2MB in the end (delta: -7.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.86ms. Allocated memory is still 123.7MB. Free memory was 95.2MB in the beginning and 91.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.50ms. Allocated memory is still 123.7MB. Free memory was 91.6MB in the beginning and 89.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 497.79ms. Allocated memory is still 123.7MB. Free memory was 89.5MB in the beginning and 62.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 36882.22ms. Allocated memory was 123.7MB in the beginning and 1.1GB in the end (delta: 941.6MB). Free memory was 61.6MB in the beginning and 871.9MB in the end (delta: -810.3MB). Peak memory consumption was 696.0MB. Max. memory is 16.1GB. * Witness Printer took 150.11ms. Allocated memory is still 1.1GB. Free memory was 871.9MB in the beginning and 819.6MB in the end (delta: 52.3MB). Peak memory consumption was 52.4MB. 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: 610]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L534] int c1 ; [L535] int i2 ; [L538] c1 = 0 [L539] side1Failed = __VERIFIER_nondet_bool() [L540] side2Failed = __VERIFIER_nondet_bool() [L541] side1_written = __VERIFIER_nondet_char() [L542] side2_written = __VERIFIER_nondet_char() [L543] side1Failed_History_0 = __VERIFIER_nondet_bool() [L544] side1Failed_History_1 = __VERIFIER_nondet_bool() [L545] side1Failed_History_2 = __VERIFIER_nondet_bool() [L546] side2Failed_History_0 = __VERIFIER_nondet_bool() [L547] side2Failed_History_1 = __VERIFIER_nondet_bool() [L548] side2Failed_History_2 = __VERIFIER_nondet_bool() [L549] active_side_History_0 = __VERIFIER_nondet_char() [L550] active_side_History_1 = __VERIFIER_nondet_char() [L551] active_side_History_2 = __VERIFIER_nondet_char() [L552] manual_selection_History_0 = __VERIFIER_nondet_char() [L553] manual_selection_History_1 = __VERIFIER_nondet_char() [L554] manual_selection_History_2 = __VERIFIER_nondet_char() [L555] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0] [L200] COND FALSE !((int )side2Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L203] COND FALSE !((int )active_side_History_0 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L206] COND FALSE !((int )manual_selection_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L209] COND FALSE !((int )side1Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0] [L212] COND FALSE !((int )side2Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L215] COND FALSE !((int )active_side_History_1 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L218] COND FALSE !((int )manual_selection_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L221] COND FALSE !((int )side1Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L224] COND FALSE !((int )side2Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L227] COND FALSE !((int )active_side_History_2 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); VAL [\result=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L555] RET, EXPR init() [L555] i2 = init() [L556] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L556] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L557] cs1_old = nomsg [L558] cs1_new = nomsg [L559] cs2_old = nomsg [L560] cs2_new = nomsg [L561] s1s2_old = nomsg [L562] s1s2_new = nomsg [L563] s1s1_old = nomsg [L564] s1s1_new = nomsg [L565] s2s1_old = nomsg [L566] s2s1_new = nomsg [L567] s2s2_old = nomsg [L568] s2s2_new = nomsg [L569] s1p_old = nomsg [L570] s1p_new = nomsg [L571] s2p_old = nomsg [L572] s2p_new = nomsg [L573] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L574] COND TRUE 1 [L576] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=-127, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-127] [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-127, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-127] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-127, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-127] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-127] [L576] RET Console_task_each_pals_period() [L577] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=-255, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-255] [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L577] RET Side1_activestandby_task_each_pals_period() [L578] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L578] RET Side2_activestandby_task_each_pals_period() [L579] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, index=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=-2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L409] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L439] COND FALSE !(! side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L442] COND TRUE ! side2Failed [L443] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L447] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L448] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L450] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L450] tmp___1 = read_side1_failed_history((unsigned char)1) [L451] COND TRUE ! tmp___1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L452] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=-255, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L452] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=-255, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L452] tmp___2 = read_side1_failed_history((unsigned char)0) [L453] COND FALSE !(! tmp___2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L478] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L478] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L494] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L494] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L494] tmp___11 = read_side1_failed_history((unsigned char)1) [L495] COND TRUE ! tmp___11 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L496] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L496] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L496] tmp___12 = read_side2_failed_history((unsigned char)1) [L497] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L510] CALL, EXPR read_active_side_history((unsigned char)2) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND FALSE !((int )index == 0) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=2, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L151] COND FALSE !((int )index == 1) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=2, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [\old(index)=2, \result=-2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=2, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L510] RET, EXPR read_active_side_history((unsigned char)2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)2)=-2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L510] tmp___20 = read_active_side_history((unsigned char)2) [L511] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L529] return (1); VAL [\result=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L596] RET, EXPR check() [L596] c1 = check() [L597] CALL assert(c1) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L608] COND FALSE !(! arg) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=1, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L597] RET assert(c1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, i2=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L574] COND TRUE 1 [L576] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=-128, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-128] [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection=-128, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection=-128, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L576] RET Console_task_each_pals_period() [L577] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L276] RET write_side1_failed_history(side1Failed) [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L290] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L293] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L294] COND TRUE (int )side2 != (int )nomsg [L295] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, next_state=0, next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, next_state=0, next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, next_state=0, next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L577] RET Side1_activestandby_task_each_pals_period() [L578] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=257, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, val=257] [L333] RET write_side2_failed_history(side2Failed) [L334] COND TRUE \read(side2Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L335] EXPR nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L335] s2s1_new = nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L336] EXPR nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L336] s2s2_new = nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L337] EXPR nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L337] s2p_new = nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L338] side2_written = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L578] RET Side2_activestandby_task_each_pals_period() [L579] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, index=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L409] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L439] COND TRUE ! side1Failed [L440] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L447] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L447] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=-127, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L448] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=-127, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND FALSE !(! tmp___0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-127] [L478] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=-255, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L478] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-255, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-127] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND TRUE \read(tmp___7) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-127, tmp___7=1] [L480] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L480] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-127, tmp___7=1] [L480] tmp___8 = read_side2_failed_history((unsigned char)1) [L481] COND TRUE ! tmp___8 VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-127, tmp___7=1, tmp___8=0] [L482] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L482] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-127, tmp___7=1, tmp___8=0] [L482] tmp___5 = read_active_side_history((unsigned char)0) [L483] COND TRUE ! ((int )tmp___5 == 2) [L484] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-127, tmp___5=0, tmp___7=1, tmp___8=0] [L596] RET, EXPR check() [L596] c1 = check() [L597] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L608] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L610] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 204 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.7s, OverallIterations: 35, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 23.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26056 SdHoareTripleChecker+Valid, 10.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25841 mSDsluCounter, 68281 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53797 mSDsCounter, 8721 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19825 IncrementalHoareTripleChecker+Invalid, 28546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8721 mSolverCounterUnsat, 14484 mSDtfsCounter, 19825 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3090 GetRequests, 2620 SyntacticMatches, 3 SemanticMatches, 467 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9937 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8081occurred in iteration=29, InterpolantAutomatonStates: 450, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 38220 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 5156 NumberOfCodeBlocks, 5156 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 5866 ConstructedInterpolants, 0 QuantifiedInterpolants, 13935 SizeOfPredicates, 12 NumberOfNonLiveVariables, 3962 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 44 InterpolantComputations, 30 PerfectInterpolantSequences, 1923/2111 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-06 22:21:49,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60ffbc7e-7330-48dc-a077-3f2a5e67ed81/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE