./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 15:44:56,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 15:44:56,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 15:44:56,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 15:44:56,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 15:44:56,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 15:44:56,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 15:44:56,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 15:44:56,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 15:44:56,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 15:44:56,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 15:44:56,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 15:44:56,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 15:44:56,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 15:44:56,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 15:44:56,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 15:44:56,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 15:44:56,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 15:44:56,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 15:44:56,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 15:44:56,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 15:44:56,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 15:44:56,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 15:44:56,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 15:44:56,889 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 15:44:56,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 15:44:56,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 15:44:56,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 15:44:56,891 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 15:44:56,892 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 15:44:56,892 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 15:44:56,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 15:44:56,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 15:44:56,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 15:44:56,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 15:44:56,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 15:44:56,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 15:44:56,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 15:44:56,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 15:44:56,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 15:44:56,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 15:44:56,899 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 15:44:56,930 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 15:44:56,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 15:44:56,930 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 15:44:56,931 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 15:44:56,931 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 15:44:56,932 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 15:44:56,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 15:44:56,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 15:44:56,932 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 15:44:56,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 15:44:56,933 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 15:44:56,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 15:44:56,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 15:44:56,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 15:44:56,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 15:44:56,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 15:44:56,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 15:44:56,934 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 15:44:56,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 15:44:56,934 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 15:44:56,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 15:44:56,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 15:44:56,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 15:44:56,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 15:44:56,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 15:44:56,935 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 15:44:56,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 15:44:56,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 15:44:56,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 15:44:56,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 15:44:56,937 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 15:44:56,937 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 15:44:56,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 15:44:56,938 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 15:44:56,938 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 [2021-12-17 15:44:57,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 15:44:57,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 15:44:57,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 15:44:57,158 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 15:44:57,158 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 15:44:57,159 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2021-12-17 15:44:57,205 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88f4564e9/9c4ecea970114e68ab8aee4b9534bc14/FLAGf476e6c8e [2021-12-17 15:44:57,543 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 15:44:57,544 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2021-12-17 15:44:57,550 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88f4564e9/9c4ecea970114e68ab8aee4b9534bc14/FLAGf476e6c8e [2021-12-17 15:44:57,935 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88f4564e9/9c4ecea970114e68ab8aee4b9534bc14 [2021-12-17 15:44:57,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 15:44:57,938 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 15:44:57,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 15:44:57,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 15:44:57,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 15:44:57,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 03:44:57" (1/1) ... [2021-12-17 15:44:57,949 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18cf8d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:44:57, skipping insertion in model container [2021-12-17 15:44:57,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 03:44:57" (1/1) ... [2021-12-17 15:44:57,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 15:44:57,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 15:44:58,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2021-12-17 15:44:58,200 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 15:44:58,209 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 15:44:58,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2021-12-17 15:44:58,260 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 15:44:58,270 INFO L208 MainTranslator]: Completed translation [2021-12-17 15:44:58,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:44:58 WrapperNode [2021-12-17 15:44:58,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 15:44:58,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 15:44:58,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 15:44:58,272 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 15:44:58,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:44:58" (1/1) ... [2021-12-17 15:44:58,284 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:44:58" (1/1) ... [2021-12-17 15:44:58,306 INFO L137 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 413 [2021-12-17 15:44:58,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 15:44:58,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 15:44:58,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 15:44:58,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 15:44:58,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:44:58" (1/1) ... [2021-12-17 15:44:58,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:44:58" (1/1) ... [2021-12-17 15:44:58,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:44:58" (1/1) ... [2021-12-17 15:44:58,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:44:58" (1/1) ... [2021-12-17 15:44:58,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:44:58" (1/1) ... [2021-12-17 15:44:58,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:44:58" (1/1) ... [2021-12-17 15:44:58,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:44:58" (1/1) ... [2021-12-17 15:44:58,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 15:44:58,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 15:44:58,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 15:44:58,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 15:44:58,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:44:58" (1/1) ... [2021-12-17 15:44:58,351 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 15:44:58,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:44:58,391 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 15:44:58,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 15:44:58,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 15:44:58,420 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2021-12-17 15:44:58,421 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2021-12-17 15:44:58,421 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2021-12-17 15:44:58,421 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2021-12-17 15:44:58,421 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2021-12-17 15:44:58,424 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2021-12-17 15:44:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2021-12-17 15:44:58,424 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2021-12-17 15:44:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2021-12-17 15:44:58,424 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2021-12-17 15:44:58,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 15:44:58,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 15:44:58,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 15:44:58,499 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 15:44:58,500 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 15:44:58,913 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 15:44:58,921 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 15:44:58,921 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-17 15:44:58,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:44:58 BoogieIcfgContainer [2021-12-17 15:44:58,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 15:44:58,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 15:44:58,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 15:44:58,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 15:44:58,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 03:44:57" (1/3) ... [2021-12-17 15:44:58,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4385422e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 03:44:58, skipping insertion in model container [2021-12-17 15:44:58,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:44:58" (2/3) ... [2021-12-17 15:44:58,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4385422e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 03:44:58, skipping insertion in model container [2021-12-17 15:44:58,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:44:58" (3/3) ... [2021-12-17 15:44:58,928 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2021-12-17 15:44:58,933 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 15:44:58,933 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 15:44:58,965 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 15:44:58,970 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-17 15:44:58,970 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 15:44:58,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 184 states, 145 states have (on average 1.606896551724138) internal successors, (233), 149 states have internal predecessors, (233), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-17 15:44:58,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-17 15:44:58,992 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:44:58,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:44:58,993 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:44:58,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:44:58,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1605485676, now seen corresponding path program 1 times [2021-12-17 15:44:59,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:44:59,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968988201] [2021-12-17 15:44:59,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:44:59,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:44:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:44:59,150 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-17 15:44:59,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:44:59,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968988201] [2021-12-17 15:44:59,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968988201] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:44:59,151 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:44:59,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 15:44:59,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332229082] [2021-12-17 15:44:59,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:44:59,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:44:59,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:44:59,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:44:59,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:44:59,184 INFO L87 Difference]: Start difference. First operand has 184 states, 145 states have (on average 1.606896551724138) internal successors, (233), 149 states have internal predecessors, (233), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 15:44:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:44:59,285 INFO L93 Difference]: Finished difference Result 373 states and 637 transitions. [2021-12-17 15:44:59,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:44:59,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-17 15:44:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:44:59,300 INFO L225 Difference]: With dead ends: 373 [2021-12-17 15:44:59,300 INFO L226 Difference]: Without dead ends: 188 [2021-12-17 15:44:59,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:44:59,308 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 18 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:44:59,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 826 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:44:59,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-17 15:44:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2021-12-17 15:44:59,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 147 states have (on average 1.530612244897959) internal successors, (225), 150 states have internal predecessors, (225), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-17 15:44:59,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 289 transitions. [2021-12-17 15:44:59,368 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 289 transitions. Word has length 15 [2021-12-17 15:44:59,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:44:59,368 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 289 transitions. [2021-12-17 15:44:59,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 15:44:59,369 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2021-12-17 15:44:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-17 15:44:59,370 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:44:59,371 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:44:59,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 15:44:59,371 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:44:59,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:44:59,374 INFO L85 PathProgramCache]: Analyzing trace with hash -621436427, now seen corresponding path program 1 times [2021-12-17 15:44:59,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:44:59,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022158461] [2021-12-17 15:44:59,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:44:59,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:44:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:44:59,444 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-17 15:44:59,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:44:59,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022158461] [2021-12-17 15:44:59,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022158461] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:44:59,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:44:59,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 15:44:59,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118082454] [2021-12-17 15:44:59,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:44:59,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:44:59,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:44:59,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:44:59,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:44:59,449 INFO L87 Difference]: Start difference. First operand 186 states and 289 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 15:44:59,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:44:59,482 INFO L93 Difference]: Finished difference Result 385 states and 601 transitions. [2021-12-17 15:44:59,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:44:59,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-17 15:44:59,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:44:59,484 INFO L225 Difference]: With dead ends: 385 [2021-12-17 15:44:59,484 INFO L226 Difference]: Without dead ends: 202 [2021-12-17 15:44:59,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:44:59,485 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 25 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:44:59,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 835 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:44:59,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-12-17 15:44:59,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2021-12-17 15:44:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 158 states have (on average 1.5126582278481013) internal successors, (239), 161 states have internal predecessors, (239), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2021-12-17 15:44:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 305 transitions. [2021-12-17 15:44:59,496 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 305 transitions. Word has length 16 [2021-12-17 15:44:59,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:44:59,496 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 305 transitions. [2021-12-17 15:44:59,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 15:44:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 305 transitions. [2021-12-17 15:44:59,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-17 15:44:59,498 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:44:59,498 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:44:59,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 15:44:59,498 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:44:59,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:44:59,499 INFO L85 PathProgramCache]: Analyzing trace with hash -741910715, now seen corresponding path program 1 times [2021-12-17 15:44:59,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:44:59,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123287229] [2021-12-17 15:44:59,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:44:59,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:44:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:44:59,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:44:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:44:59,528 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-17 15:44:59,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:44:59,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123287229] [2021-12-17 15:44:59,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123287229] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:44:59,529 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:44:59,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 15:44:59,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035418695] [2021-12-17 15:44:59,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:44:59,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:44:59,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:44:59,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:44:59,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 15:44:59,531 INFO L87 Difference]: Start difference. First operand 199 states and 305 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 15:44:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:44:59,544 INFO L93 Difference]: Finished difference Result 417 states and 647 transitions. [2021-12-17 15:44:59,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:44:59,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-12-17 15:44:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:44:59,546 INFO L225 Difference]: With dead ends: 417 [2021-12-17 15:44:59,547 INFO L226 Difference]: Without dead ends: 228 [2021-12-17 15:44:59,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 15:44:59,548 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 22 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:44:59,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 564 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:44:59,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-12-17 15:44:59,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 201. [2021-12-17 15:44:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 160 states have (on average 1.50625) internal successors, (241), 163 states have internal predecessors, (241), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2021-12-17 15:44:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 307 transitions. [2021-12-17 15:44:59,559 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 307 transitions. Word has length 23 [2021-12-17 15:44:59,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:44:59,560 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 307 transitions. [2021-12-17 15:44:59,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 15:44:59,560 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 307 transitions. [2021-12-17 15:44:59,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-17 15:44:59,561 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:44:59,561 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:44:59,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 15:44:59,562 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:44:59,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:44:59,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1197019830, now seen corresponding path program 1 times [2021-12-17 15:44:59,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:44:59,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985017931] [2021-12-17 15:44:59,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:44:59,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:44:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:44:59,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:44:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:44:59,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:44:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:44:59,601 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-17 15:44:59,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:44:59,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985017931] [2021-12-17 15:44:59,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985017931] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:44:59,602 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:44:59,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 15:44:59,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921347229] [2021-12-17 15:44:59,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:44:59,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:44:59,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:44:59,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:44:59,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:44:59,604 INFO L87 Difference]: Start difference. First operand 201 states and 307 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 15:44:59,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:44:59,629 INFO L93 Difference]: Finished difference Result 457 states and 714 transitions. [2021-12-17 15:44:59,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:44:59,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2021-12-17 15:44:59,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:44:59,631 INFO L225 Difference]: With dead ends: 457 [2021-12-17 15:44:59,631 INFO L226 Difference]: Without dead ends: 307 [2021-12-17 15:44:59,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:44:59,632 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 132 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:44:59,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 870 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:44:59,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-12-17 15:44:59,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 201. [2021-12-17 15:44:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 160 states have (on average 1.48125) internal successors, (237), 163 states have internal predecessors, (237), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2021-12-17 15:44:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 303 transitions. [2021-12-17 15:44:59,653 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 303 transitions. Word has length 31 [2021-12-17 15:44:59,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:44:59,653 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 303 transitions. [2021-12-17 15:44:59,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 15:44:59,653 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 303 transitions. [2021-12-17 15:44:59,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-17 15:44:59,654 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:44:59,654 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:44:59,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 15:44:59,655 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:44:59,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:44:59,655 INFO L85 PathProgramCache]: Analyzing trace with hash -422396736, now seen corresponding path program 1 times [2021-12-17 15:44:59,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:44:59,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778724504] [2021-12-17 15:44:59,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:44:59,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:44:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:44:59,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:44:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:44:59,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:44:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:44:59,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:44:59,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:44:59,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778724504] [2021-12-17 15:44:59,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778724504] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:44:59,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:44:59,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:44:59,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47650952] [2021-12-17 15:44:59,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:44:59,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:44:59,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:44:59,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:44:59,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:44:59,714 INFO L87 Difference]: Start difference. First operand 201 states and 303 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 15:44:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:44:59,730 INFO L93 Difference]: Finished difference Result 392 states and 595 transitions. [2021-12-17 15:44:59,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:44:59,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-12-17 15:44:59,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:44:59,732 INFO L225 Difference]: With dead ends: 392 [2021-12-17 15:44:59,732 INFO L226 Difference]: Without dead ends: 203 [2021-12-17 15:44:59,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:44:59,733 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 0 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:44:59,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1104 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:44:59,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-12-17 15:44:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2021-12-17 15:44:59,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 160 states have (on average 1.475) internal successors, (236), 163 states have internal predecessors, (236), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2021-12-17 15:44:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 302 transitions. [2021-12-17 15:44:59,740 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 302 transitions. Word has length 32 [2021-12-17 15:44:59,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:44:59,740 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 302 transitions. [2021-12-17 15:44:59,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 15:44:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 302 transitions. [2021-12-17 15:44:59,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-17 15:44:59,741 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:44:59,741 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:44:59,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 15:44:59,742 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:44:59,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:44:59,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1664815819, now seen corresponding path program 1 times [2021-12-17 15:44:59,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:44:59,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327103817] [2021-12-17 15:44:59,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:44:59,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:44:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:44:59,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:44:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:44:59,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:44:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:44:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:44:59,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:44:59,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327103817] [2021-12-17 15:44:59,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327103817] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:44:59,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898548608] [2021-12-17 15:44:59,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:44:59,788 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:44:59,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:44:59,790 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:44:59,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 15:44:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:44:59,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 15:44:59,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:44:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:44:59,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:45:00,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:45:00,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898548608] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 15:45:00,017 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 15:45:00,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-17 15:45:00,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686343734] [2021-12-17 15:45:00,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 15:45:00,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:45:00,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:00,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:45:00,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:00,018 INFO L87 Difference]: Start difference. First operand 201 states and 302 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 15:45:00,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:00,046 INFO L93 Difference]: Finished difference Result 450 states and 691 transitions. [2021-12-17 15:45:00,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:45:00,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2021-12-17 15:45:00,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:00,048 INFO L225 Difference]: With dead ends: 450 [2021-12-17 15:45:00,048 INFO L226 Difference]: Without dead ends: 260 [2021-12-17 15:45:00,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:00,049 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 66 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:00,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 1084 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:45:00,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-12-17 15:45:00,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 254. [2021-12-17 15:45:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 203 states have (on average 1.4532019704433496) internal successors, (295), 206 states have internal predecessors, (295), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2021-12-17 15:45:00,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2021-12-17 15:45:00,061 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 35 [2021-12-17 15:45:00,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:00,061 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2021-12-17 15:45:00,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 15:45:00,061 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2021-12-17 15:45:00,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-17 15:45:00,062 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:00,062 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:00,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 15:45:00,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-17 15:45:00,280 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:00,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:00,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1225495307, now seen corresponding path program 2 times [2021-12-17 15:45:00,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:00,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793591634] [2021-12-17 15:45:00,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:00,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,318 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-17 15:45:00,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:00,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793591634] [2021-12-17 15:45:00,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793591634] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:00,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:00,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 15:45:00,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559565280] [2021-12-17 15:45:00,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:00,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:45:00,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:00,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:45:00,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:45:00,320 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 15:45:00,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:00,346 INFO L93 Difference]: Finished difference Result 518 states and 788 transitions. [2021-12-17 15:45:00,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:45:00,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2021-12-17 15:45:00,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:00,349 INFO L225 Difference]: With dead ends: 518 [2021-12-17 15:45:00,349 INFO L226 Difference]: Without dead ends: 293 [2021-12-17 15:45:00,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:00,350 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 24 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:00,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 827 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:45:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-12-17 15:45:00,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2021-12-17 15:45:00,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 235 states have (on average 1.4127659574468086) internal successors, (332), 238 states have internal predecessors, (332), 46 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2021-12-17 15:45:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 424 transitions. [2021-12-17 15:45:00,358 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 424 transitions. Word has length 57 [2021-12-17 15:45:00,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:00,359 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 424 transitions. [2021-12-17 15:45:00,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 15:45:00,359 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 424 transitions. [2021-12-17 15:45:00,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-17 15:45:00,360 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:00,360 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:00,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 15:45:00,360 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:00,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:00,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1867707356, now seen corresponding path program 1 times [2021-12-17 15:45:00,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:00,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313439187] [2021-12-17 15:45:00,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:00,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-17 15:45:00,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:00,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313439187] [2021-12-17 15:45:00,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313439187] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:00,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:00,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 15:45:00,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990117757] [2021-12-17 15:45:00,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:00,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:45:00,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:00,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:45:00,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:45:00,430 INFO L87 Difference]: Start difference. First operand 290 states and 424 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 15:45:00,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:00,468 INFO L93 Difference]: Finished difference Result 555 states and 835 transitions. [2021-12-17 15:45:00,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:45:00,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2021-12-17 15:45:00,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:00,471 INFO L225 Difference]: With dead ends: 555 [2021-12-17 15:45:00,471 INFO L226 Difference]: Without dead ends: 299 [2021-12-17 15:45:00,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:00,473 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 19 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:00,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 813 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:45:00,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-12-17 15:45:00,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2021-12-17 15:45:00,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 241 states have (on average 1.4107883817427387) internal successors, (340), 244 states have internal predecessors, (340), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2021-12-17 15:45:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 432 transitions. [2021-12-17 15:45:00,497 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 432 transitions. Word has length 57 [2021-12-17 15:45:00,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:00,498 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 432 transitions. [2021-12-17 15:45:00,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 15:45:00,498 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 432 transitions. [2021-12-17 15:45:00,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-17 15:45:00,499 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:00,500 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:00,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 15:45:00,500 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:00,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:00,501 INFO L85 PathProgramCache]: Analyzing trace with hash -917641064, now seen corresponding path program 1 times [2021-12-17 15:45:00,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:00,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146481038] [2021-12-17 15:45:00,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:00,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,559 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-17 15:45:00,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:00,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146481038] [2021-12-17 15:45:00,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146481038] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:00,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:00,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:45:00,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693005125] [2021-12-17 15:45:00,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:00,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:45:00,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:00,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:45:00,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:00,561 INFO L87 Difference]: Start difference. First operand 297 states and 432 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 15:45:00,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:00,577 INFO L93 Difference]: Finished difference Result 543 states and 803 transitions. [2021-12-17 15:45:00,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:45:00,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2021-12-17 15:45:00,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:00,579 INFO L225 Difference]: With dead ends: 543 [2021-12-17 15:45:00,579 INFO L226 Difference]: Without dead ends: 299 [2021-12-17 15:45:00,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:00,580 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 0 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:00,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1103 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:45:00,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-12-17 15:45:00,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2021-12-17 15:45:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 241 states have (on average 1.3983402489626555) internal successors, (337), 244 states have internal predecessors, (337), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2021-12-17 15:45:00,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 429 transitions. [2021-12-17 15:45:00,588 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 429 transitions. Word has length 75 [2021-12-17 15:45:00,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:00,588 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 429 transitions. [2021-12-17 15:45:00,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 15:45:00,588 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 429 transitions. [2021-12-17 15:45:00,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-12-17 15:45:00,589 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:00,589 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:00,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-17 15:45:00,589 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:00,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:00,590 INFO L85 PathProgramCache]: Analyzing trace with hash -276575053, now seen corresponding path program 1 times [2021-12-17 15:45:00,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:00,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323738150] [2021-12-17 15:45:00,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:00,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-12-17 15:45:00,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:00,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323738150] [2021-12-17 15:45:00,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323738150] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:00,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:00,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 15:45:00,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70590616] [2021-12-17 15:45:00,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:00,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:45:00,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:00,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:45:00,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:45:00,642 INFO L87 Difference]: Start difference. First operand 297 states and 429 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 15:45:00,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:00,683 INFO L93 Difference]: Finished difference Result 580 states and 859 transitions. [2021-12-17 15:45:00,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:45:00,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2021-12-17 15:45:00,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:00,685 INFO L225 Difference]: With dead ends: 580 [2021-12-17 15:45:00,685 INFO L226 Difference]: Without dead ends: 341 [2021-12-17 15:45:00,686 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-17 15:45:00,686 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 25 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:00,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 827 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:45:00,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-12-17 15:45:00,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 338. [2021-12-17 15:45:00,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 278 states have (on average 1.3633093525179856) internal successors, (379), 281 states have internal predecessors, (379), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2021-12-17 15:45:00,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 477 transitions. [2021-12-17 15:45:00,694 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 477 transitions. Word has length 104 [2021-12-17 15:45:00,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:00,694 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 477 transitions. [2021-12-17 15:45:00,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 15:45:00,695 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 477 transitions. [2021-12-17 15:45:00,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-17 15:45:00,695 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:00,695 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:00,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-17 15:45:00,696 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:00,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:00,696 INFO L85 PathProgramCache]: Analyzing trace with hash -92526865, now seen corresponding path program 1 times [2021-12-17 15:45:00,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:00,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695078260] [2021-12-17 15:45:00,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:00,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-12-17 15:45:00,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:00,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695078260] [2021-12-17 15:45:00,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695078260] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:00,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:00,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 15:45:00,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331815413] [2021-12-17 15:45:00,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:00,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:45:00,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:00,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:45:00,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:45:00,743 INFO L87 Difference]: Start difference. First operand 338 states and 477 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 15:45:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:00,768 INFO L93 Difference]: Finished difference Result 606 states and 879 transitions. [2021-12-17 15:45:00,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 15:45:00,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 105 [2021-12-17 15:45:00,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:00,771 INFO L225 Difference]: With dead ends: 606 [2021-12-17 15:45:00,771 INFO L226 Difference]: Without dead ends: 332 [2021-12-17 15:45:00,771 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-17 15:45:00,772 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 15 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:00,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 786 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:45:00,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-12-17 15:45:00,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2021-12-17 15:45:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 273 states have (on average 1.3443223443223444) internal successors, (367), 276 states have internal predecessors, (367), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2021-12-17 15:45:00,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 463 transitions. [2021-12-17 15:45:00,779 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 463 transitions. Word has length 105 [2021-12-17 15:45:00,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:00,779 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 463 transitions. [2021-12-17 15:45:00,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 15:45:00,780 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 463 transitions. [2021-12-17 15:45:00,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-12-17 15:45:00,780 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:00,781 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:00,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-17 15:45:00,781 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:00,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:00,781 INFO L85 PathProgramCache]: Analyzing trace with hash -440553643, now seen corresponding path program 1 times [2021-12-17 15:45:00,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:00,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473827486] [2021-12-17 15:45:00,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:00,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,837 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2021-12-17 15:45:00,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:00,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473827486] [2021-12-17 15:45:00,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473827486] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:00,837 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:00,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:45:00,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969982812] [2021-12-17 15:45:00,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:00,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:45:00,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:00,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:45:00,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:00,839 INFO L87 Difference]: Start difference. First operand 332 states and 463 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-17 15:45:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:00,853 INFO L93 Difference]: Finished difference Result 581 states and 828 transitions. [2021-12-17 15:45:00,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:45:00,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 124 [2021-12-17 15:45:00,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:00,855 INFO L225 Difference]: With dead ends: 581 [2021-12-17 15:45:00,855 INFO L226 Difference]: Without dead ends: 334 [2021-12-17 15:45:00,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:00,856 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:00,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1087 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:45:00,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-12-17 15:45:00,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2021-12-17 15:45:00,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 273 states have (on average 1.3333333333333333) internal successors, (364), 276 states have internal predecessors, (364), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2021-12-17 15:45:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 460 transitions. [2021-12-17 15:45:00,864 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 460 transitions. Word has length 124 [2021-12-17 15:45:00,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:00,864 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 460 transitions. [2021-12-17 15:45:00,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-17 15:45:00,865 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 460 transitions. [2021-12-17 15:45:00,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-12-17 15:45:00,866 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:00,866 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:00,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-17 15:45:00,866 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:00,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:00,867 INFO L85 PathProgramCache]: Analyzing trace with hash -37757066, now seen corresponding path program 1 times [2021-12-17 15:45:00,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:00,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219083291] [2021-12-17 15:45:00,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:00,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2021-12-17 15:45:00,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:00,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219083291] [2021-12-17 15:45:00,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219083291] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:00,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:00,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 15:45:00,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772982231] [2021-12-17 15:45:00,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:00,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:45:00,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:00,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:45:00,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:45:00,936 INFO L87 Difference]: Start difference. First operand 332 states and 460 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-17 15:45:00,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:00,968 INFO L93 Difference]: Finished difference Result 544 states and 788 transitions. [2021-12-17 15:45:00,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 15:45:00,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 157 [2021-12-17 15:45:00,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:00,970 INFO L225 Difference]: With dead ends: 544 [2021-12-17 15:45:00,970 INFO L226 Difference]: Without dead ends: 330 [2021-12-17 15:45:00,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:00,971 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 13 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:00,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 754 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:45:00,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-12-17 15:45:00,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2021-12-17 15:45:00,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 272 states have (on average 1.3308823529411764) internal successors, (362), 275 states have internal predecessors, (362), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2021-12-17 15:45:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 456 transitions. [2021-12-17 15:45:00,978 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 456 transitions. Word has length 157 [2021-12-17 15:45:00,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:00,979 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 456 transitions. [2021-12-17 15:45:00,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-17 15:45:00,979 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 456 transitions. [2021-12-17 15:45:00,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-12-17 15:45:00,980 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:00,980 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:00,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-17 15:45:00,981 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:00,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:00,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1460013805, now seen corresponding path program 1 times [2021-12-17 15:45:00,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:00,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17419917] [2021-12-17 15:45:00,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:00,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2021-12-17 15:45:01,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:01,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17419917] [2021-12-17 15:45:01,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17419917] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:01,049 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:01,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 15:45:01,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392984707] [2021-12-17 15:45:01,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:01,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:45:01,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:01,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:45:01,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:45:01,051 INFO L87 Difference]: Start difference. First operand 330 states and 456 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 15:45:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:01,081 INFO L93 Difference]: Finished difference Result 484 states and 684 transitions. [2021-12-17 15:45:01,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:45:01,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 172 [2021-12-17 15:45:01,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:01,083 INFO L225 Difference]: With dead ends: 484 [2021-12-17 15:45:01,083 INFO L226 Difference]: Without dead ends: 313 [2021-12-17 15:45:01,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:01,084 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 35 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:01,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 735 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:45:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-12-17 15:45:01,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2021-12-17 15:45:01,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 258 states have (on average 1.321705426356589) internal successors, (341), 261 states have internal predecessors, (341), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2021-12-17 15:45:01,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 429 transitions. [2021-12-17 15:45:01,091 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 429 transitions. Word has length 172 [2021-12-17 15:45:01,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:01,091 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 429 transitions. [2021-12-17 15:45:01,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 15:45:01,092 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 429 transitions. [2021-12-17 15:45:01,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-12-17 15:45:01,093 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:01,093 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:01,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-17 15:45:01,093 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:01,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:01,094 INFO L85 PathProgramCache]: Analyzing trace with hash 409048779, now seen corresponding path program 1 times [2021-12-17 15:45:01,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:01,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043407361] [2021-12-17 15:45:01,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:01,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2021-12-17 15:45:01,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:01,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043407361] [2021-12-17 15:45:01,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043407361] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:01,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:01,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 15:45:01,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950258308] [2021-12-17 15:45:01,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:01,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:45:01,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:01,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:45:01,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:45:01,171 INFO L87 Difference]: Start difference. First operand 313 states and 429 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 15:45:01,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:01,202 INFO L93 Difference]: Finished difference Result 467 states and 657 transitions. [2021-12-17 15:45:01,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:45:01,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 174 [2021-12-17 15:45:01,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:01,204 INFO L225 Difference]: With dead ends: 467 [2021-12-17 15:45:01,204 INFO L226 Difference]: Without dead ends: 294 [2021-12-17 15:45:01,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:01,205 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 30 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:01,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 739 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:45:01,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-12-17 15:45:01,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2021-12-17 15:45:01,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 242 states have (on average 1.3140495867768596) internal successors, (318), 245 states have internal predecessors, (318), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2021-12-17 15:45:01,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 400 transitions. [2021-12-17 15:45:01,212 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 400 transitions. Word has length 174 [2021-12-17 15:45:01,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:01,212 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 400 transitions. [2021-12-17 15:45:01,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 15:45:01,213 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 400 transitions. [2021-12-17 15:45:01,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-12-17 15:45:01,214 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:01,214 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:01,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-17 15:45:01,215 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:01,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:01,215 INFO L85 PathProgramCache]: Analyzing trace with hash 222848508, now seen corresponding path program 1 times [2021-12-17 15:45:01,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:01,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342092970] [2021-12-17 15:45:01,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:01,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,280 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2021-12-17 15:45:01,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:01,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342092970] [2021-12-17 15:45:01,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342092970] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:01,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:01,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:45:01,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123485793] [2021-12-17 15:45:01,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:01,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:45:01,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:01,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:45:01,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:01,282 INFO L87 Difference]: Start difference. First operand 294 states and 400 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-12-17 15:45:01,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:01,293 INFO L93 Difference]: Finished difference Result 447 states and 627 transitions. [2021-12-17 15:45:01,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:45:01,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 175 [2021-12-17 15:45:01,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:01,294 INFO L225 Difference]: With dead ends: 447 [2021-12-17 15:45:01,295 INFO L226 Difference]: Without dead ends: 294 [2021-12-17 15:45:01,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:01,295 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 0 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:01,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1065 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:45:01,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-12-17 15:45:01,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2021-12-17 15:45:01,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 242 states have (on average 1.2892561983471074) internal successors, (312), 245 states have internal predecessors, (312), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2021-12-17 15:45:01,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 394 transitions. [2021-12-17 15:45:01,302 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 394 transitions. Word has length 175 [2021-12-17 15:45:01,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:01,302 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 394 transitions. [2021-12-17 15:45:01,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-12-17 15:45:01,302 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 394 transitions. [2021-12-17 15:45:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-12-17 15:45:01,303 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:01,304 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:01,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-17 15:45:01,304 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:01,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:01,304 INFO L85 PathProgramCache]: Analyzing trace with hash 312728436, now seen corresponding path program 1 times [2021-12-17 15:45:01,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:01,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933691447] [2021-12-17 15:45:01,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:01,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,385 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-12-17 15:45:01,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:01,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933691447] [2021-12-17 15:45:01,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933691447] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:45:01,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518904503] [2021-12-17 15:45:01,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:01,386 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:45:01,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:45:01,400 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:45:01,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 15:45:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:01,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 15:45:01,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:45:01,730 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-12-17 15:45:01,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:45:01,974 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-12-17 15:45:01,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518904503] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-17 15:45:01,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-17 15:45:01,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2021-12-17 15:45:01,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609570206] [2021-12-17 15:45:01,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:01,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:45:01,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:01,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:45:01,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:01,975 INFO L87 Difference]: Start difference. First operand 294 states and 394 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-17 15:45:02,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:02,004 INFO L93 Difference]: Finished difference Result 468 states and 649 transitions. [2021-12-17 15:45:02,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 15:45:02,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 182 [2021-12-17 15:45:02,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:02,006 INFO L225 Difference]: With dead ends: 468 [2021-12-17 15:45:02,006 INFO L226 Difference]: Without dead ends: 273 [2021-12-17 15:45:02,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 386 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:02,020 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 35 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:02,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 505 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:45:02,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-12-17 15:45:02,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-12-17 15:45:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 224 states have (on average 1.28125) internal successors, (287), 227 states have internal predecessors, (287), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-12-17 15:45:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 363 transitions. [2021-12-17 15:45:02,025 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 363 transitions. Word has length 182 [2021-12-17 15:45:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:02,026 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 363 transitions. [2021-12-17 15:45:02,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-17 15:45:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 363 transitions. [2021-12-17 15:45:02,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-12-17 15:45:02,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:02,028 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:02,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 15:45:02,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-17 15:45:02,229 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:02,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:02,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1687421607, now seen corresponding path program 1 times [2021-12-17 15:45:02,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:02,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918047493] [2021-12-17 15:45:02,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:02,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,291 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2021-12-17 15:45:02,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:02,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918047493] [2021-12-17 15:45:02,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918047493] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:02,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:02,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 15:45:02,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858721827] [2021-12-17 15:45:02,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:02,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:45:02,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:02,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:45:02,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:45:02,293 INFO L87 Difference]: Start difference. First operand 273 states and 363 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2021-12-17 15:45:02,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:02,311 INFO L93 Difference]: Finished difference Result 425 states and 591 transitions. [2021-12-17 15:45:02,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:45:02,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 206 [2021-12-17 15:45:02,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:02,312 INFO L225 Difference]: With dead ends: 425 [2021-12-17 15:45:02,312 INFO L226 Difference]: Without dead ends: 279 [2021-12-17 15:45:02,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:02,313 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 6 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:02,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 779 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:45:02,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-12-17 15:45:02,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2021-12-17 15:45:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 227 states have (on average 1.277533039647577) internal successors, (290), 230 states have internal predecessors, (290), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-12-17 15:45:02,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 366 transitions. [2021-12-17 15:45:02,319 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 366 transitions. Word has length 206 [2021-12-17 15:45:02,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:02,319 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 366 transitions. [2021-12-17 15:45:02,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2021-12-17 15:45:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 366 transitions. [2021-12-17 15:45:02,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-12-17 15:45:02,320 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:02,320 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:02,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-17 15:45:02,320 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:02,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:02,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1286095815, now seen corresponding path program 1 times [2021-12-17 15:45:02,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:02,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572815821] [2021-12-17 15:45:02,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:02,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,397 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2021-12-17 15:45:02,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:02,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572815821] [2021-12-17 15:45:02,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572815821] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:45:02,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986714685] [2021-12-17 15:45:02,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:02,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:45:02,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:45:02,399 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:45:02,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 15:45:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:02,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 15:45:02,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:45:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2021-12-17 15:45:02,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:45:02,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986714685] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:02,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:45:02,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-17 15:45:02,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655879609] [2021-12-17 15:45:02,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:02,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:45:02,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:02,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:45:02,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:02,810 INFO L87 Difference]: Start difference. First operand 277 states and 366 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2021-12-17 15:45:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:02,830 INFO L93 Difference]: Finished difference Result 434 states and 598 transitions. [2021-12-17 15:45:02,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:45:02,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 215 [2021-12-17 15:45:02,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:02,831 INFO L225 Difference]: With dead ends: 434 [2021-12-17 15:45:02,831 INFO L226 Difference]: Without dead ends: 284 [2021-12-17 15:45:02,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:45:02,832 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 7 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:02,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 784 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:45:02,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-12-17 15:45:02,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2021-12-17 15:45:02,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 231 states have (on average 1.2727272727272727) internal successors, (294), 234 states have internal predecessors, (294), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-12-17 15:45:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 370 transitions. [2021-12-17 15:45:02,838 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 370 transitions. Word has length 215 [2021-12-17 15:45:02,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:02,839 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 370 transitions. [2021-12-17 15:45:02,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2021-12-17 15:45:02,839 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 370 transitions. [2021-12-17 15:45:02,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-12-17 15:45:02,840 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:02,840 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:02,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-17 15:45:03,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:45:03,055 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:03,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:03,056 INFO L85 PathProgramCache]: Analyzing trace with hash -690820591, now seen corresponding path program 1 times [2021-12-17 15:45:03,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:03,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694086263] [2021-12-17 15:45:03,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:03,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-17 15:45:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2021-12-17 15:45:03,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:03,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694086263] [2021-12-17 15:45:03,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694086263] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:45:03,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125152449] [2021-12-17 15:45:03,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:03,137 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:45:03,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:45:03,152 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:45:03,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 15:45:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 15:45:03,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:45:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2021-12-17 15:45:03,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:45:03,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125152449] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:03,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:45:03,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-17 15:45:03,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411355348] [2021-12-17 15:45:03,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:03,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:45:03,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:03,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:45:03,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:03,556 INFO L87 Difference]: Start difference. First operand 282 states and 370 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2021-12-17 15:45:03,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:03,574 INFO L93 Difference]: Finished difference Result 436 states and 596 transitions. [2021-12-17 15:45:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 15:45:03,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 225 [2021-12-17 15:45:03,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:03,576 INFO L225 Difference]: With dead ends: 436 [2021-12-17 15:45:03,576 INFO L226 Difference]: Without dead ends: 281 [2021-12-17 15:45:03,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:45:03,577 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 7 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:03,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 770 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:45:03,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-12-17 15:45:03,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2021-12-17 15:45:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 231 states have (on average 1.2597402597402598) internal successors, (291), 233 states have internal predecessors, (291), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2021-12-17 15:45:03,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 365 transitions. [2021-12-17 15:45:03,583 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 365 transitions. Word has length 225 [2021-12-17 15:45:03,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:03,583 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 365 transitions. [2021-12-17 15:45:03,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2021-12-17 15:45:03,583 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 365 transitions. [2021-12-17 15:45:03,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-12-17 15:45:03,585 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:03,585 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:03,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 15:45:03,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:45:03,803 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:03,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:03,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1815976528, now seen corresponding path program 1 times [2021-12-17 15:45:03,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:03,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887254631] [2021-12-17 15:45:03,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:03,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-17 15:45:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-17 15:45:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2021-12-17 15:45:03,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:03,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887254631] [2021-12-17 15:45:03,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887254631] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:03,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:03,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 15:45:03,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433817776] [2021-12-17 15:45:03,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:03,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:45:03,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:03,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:45:03,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:45:03,885 INFO L87 Difference]: Start difference. First operand 281 states and 365 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-17 15:45:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:04,022 INFO L93 Difference]: Finished difference Result 478 states and 656 transitions. [2021-12-17 15:45:04,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 15:45:04,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 234 [2021-12-17 15:45:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:04,024 INFO L225 Difference]: With dead ends: 478 [2021-12-17 15:45:04,024 INFO L226 Difference]: Without dead ends: 324 [2021-12-17 15:45:04,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:45:04,025 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 185 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:04,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 643 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 15:45:04,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-12-17 15:45:04,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 280. [2021-12-17 15:45:04,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 231 states have (on average 1.2554112554112553) internal successors, (290), 232 states have internal predecessors, (290), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2021-12-17 15:45:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 362 transitions. [2021-12-17 15:45:04,057 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 362 transitions. Word has length 234 [2021-12-17 15:45:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:04,057 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 362 transitions. [2021-12-17 15:45:04,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-17 15:45:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 362 transitions. [2021-12-17 15:45:04,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-12-17 15:45:04,059 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:04,059 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:04,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-17 15:45:04,059 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:04,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:04,060 INFO L85 PathProgramCache]: Analyzing trace with hash 869606888, now seen corresponding path program 1 times [2021-12-17 15:45:04,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:04,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030354105] [2021-12-17 15:45:04,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:04,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-17 15:45:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-17 15:45:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2021-12-17 15:45:04,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:04,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030354105] [2021-12-17 15:45:04,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030354105] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:04,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:04,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:45:04,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154474433] [2021-12-17 15:45:04,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:04,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:45:04,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:04,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:45:04,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:04,179 INFO L87 Difference]: Start difference. First operand 280 states and 362 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-17 15:45:04,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:04,519 INFO L93 Difference]: Finished difference Result 657 states and 878 transitions. [2021-12-17 15:45:04,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 15:45:04,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 237 [2021-12-17 15:45:04,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:04,523 INFO L225 Difference]: With dead ends: 657 [2021-12-17 15:45:04,523 INFO L226 Difference]: Without dead ends: 504 [2021-12-17 15:45:04,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:45:04,524 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 419 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:04,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [440 Valid, 851 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 15:45:04,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2021-12-17 15:45:04,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 441. [2021-12-17 15:45:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 362 states have (on average 1.3011049723756907) internal successors, (471), 364 states have internal predecessors, (471), 54 states have call successors, (54), 24 states have call predecessors, (54), 24 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2021-12-17 15:45:04,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 579 transitions. [2021-12-17 15:45:04,535 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 579 transitions. Word has length 237 [2021-12-17 15:45:04,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:04,536 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 579 transitions. [2021-12-17 15:45:04,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-17 15:45:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 579 transitions. [2021-12-17 15:45:04,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2021-12-17 15:45:04,537 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:04,537 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:04,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-17 15:45:04,537 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:04,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:04,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1758726155, now seen corresponding path program 1 times [2021-12-17 15:45:04,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:04,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145548918] [2021-12-17 15:45:04,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:04,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-17 15:45:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-17 15:45:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2021-12-17 15:45:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-12-17 15:45:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-12-17 15:45:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,669 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2021-12-17 15:45:04,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:04,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145548918] [2021-12-17 15:45:04,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145548918] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:04,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:04,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 15:45:04,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795385670] [2021-12-17 15:45:04,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:04,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:45:04,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:04,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:45:04,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:45:04,671 INFO L87 Difference]: Start difference. First operand 441 states and 579 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-17 15:45:04,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:04,885 INFO L93 Difference]: Finished difference Result 932 states and 1277 transitions. [2021-12-17 15:45:04,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:45:04,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 264 [2021-12-17 15:45:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:04,888 INFO L225 Difference]: With dead ends: 932 [2021-12-17 15:45:04,889 INFO L226 Difference]: Without dead ends: 695 [2021-12-17 15:45:04,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:04,890 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 217 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:04,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 617 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:45:04,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2021-12-17 15:45:04,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 533. [2021-12-17 15:45:04,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 444 states have (on average 1.3108108108108107) internal successors, (582), 447 states have internal predecessors, (582), 59 states have call successors, (59), 29 states have call predecessors, (59), 29 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2021-12-17 15:45:04,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 700 transitions. [2021-12-17 15:45:04,906 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 700 transitions. Word has length 264 [2021-12-17 15:45:04,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:04,906 INFO L470 AbstractCegarLoop]: Abstraction has 533 states and 700 transitions. [2021-12-17 15:45:04,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-17 15:45:04,907 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 700 transitions. [2021-12-17 15:45:04,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2021-12-17 15:45:04,908 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:04,908 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:04,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-17 15:45:04,909 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:04,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:04,909 INFO L85 PathProgramCache]: Analyzing trace with hash -378112666, now seen corresponding path program 1 times [2021-12-17 15:45:04,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:04,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214322466] [2021-12-17 15:45:04,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:04,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:04,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-17 15:45:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-17 15:45:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2021-12-17 15:45:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2021-12-17 15:45:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2021-12-17 15:45:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2021-12-17 15:45:05,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:05,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214322466] [2021-12-17 15:45:05,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214322466] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:05,020 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:05,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 15:45:05,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781229610] [2021-12-17 15:45:05,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:05,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:45:05,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:05,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:45:05,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:45:05,022 INFO L87 Difference]: Start difference. First operand 533 states and 700 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-17 15:45:05,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:05,255 INFO L93 Difference]: Finished difference Result 1127 states and 1536 transitions. [2021-12-17 15:45:05,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:45:05,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 265 [2021-12-17 15:45:05,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:05,259 INFO L225 Difference]: With dead ends: 1127 [2021-12-17 15:45:05,259 INFO L226 Difference]: Without dead ends: 833 [2021-12-17 15:45:05,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:05,260 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 220 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:05,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 651 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:45:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2021-12-17 15:45:05,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 655. [2021-12-17 15:45:05,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 554 states have (on average 1.3212996389891696) internal successors, (732), 559 states have internal predecessors, (732), 65 states have call successors, (65), 35 states have call predecessors, (65), 35 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2021-12-17 15:45:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 862 transitions. [2021-12-17 15:45:05,279 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 862 transitions. Word has length 265 [2021-12-17 15:45:05,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:05,279 INFO L470 AbstractCegarLoop]: Abstraction has 655 states and 862 transitions. [2021-12-17 15:45:05,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-17 15:45:05,279 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 862 transitions. [2021-12-17 15:45:05,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2021-12-17 15:45:05,281 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:05,281 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:05,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-17 15:45:05,281 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:05,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:05,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1594763960, now seen corresponding path program 1 times [2021-12-17 15:45:05,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:05,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44341180] [2021-12-17 15:45:05,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:05,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-17 15:45:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-17 15:45:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-17 15:45:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-17 15:45:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2021-12-17 15:45:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,392 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2021-12-17 15:45:05,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:05,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44341180] [2021-12-17 15:45:05,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44341180] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:45:05,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89543294] [2021-12-17 15:45:05,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:05,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:45:05,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:45:05,416 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:45:05,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 15:45:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:05,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 15:45:05,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:45:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2021-12-17 15:45:05,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:45:05,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89543294] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:05,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:45:05,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2021-12-17 15:45:05,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269287649] [2021-12-17 15:45:05,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:05,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:45:05,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:05,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:45:05,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-17 15:45:05,870 INFO L87 Difference]: Start difference. First operand 655 states and 862 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-17 15:45:05,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:05,951 INFO L93 Difference]: Finished difference Result 1045 states and 1410 transitions. [2021-12-17 15:45:05,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:45:05,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 266 [2021-12-17 15:45:05,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:05,954 INFO L225 Difference]: With dead ends: 1045 [2021-12-17 15:45:05,955 INFO L226 Difference]: Without dead ends: 655 [2021-12-17 15:45:05,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-17 15:45:05,970 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 51 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:05,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 687 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 15:45:05,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2021-12-17 15:45:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2021-12-17 15:45:06,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 554 states have (on average 1.3104693140794224) internal successors, (726), 559 states have internal predecessors, (726), 65 states have call successors, (65), 35 states have call predecessors, (65), 35 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2021-12-17 15:45:06,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 856 transitions. [2021-12-17 15:45:06,014 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 856 transitions. Word has length 266 [2021-12-17 15:45:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:06,015 INFO L470 AbstractCegarLoop]: Abstraction has 655 states and 856 transitions. [2021-12-17 15:45:06,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-17 15:45:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 856 transitions. [2021-12-17 15:45:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2021-12-17 15:45:06,017 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:06,018 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:06,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-17 15:45:06,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-17 15:45:06,232 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:06,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:06,232 INFO L85 PathProgramCache]: Analyzing trace with hash 723082873, now seen corresponding path program 1 times [2021-12-17 15:45:06,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:06,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040629934] [2021-12-17 15:45:06,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:06,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-17 15:45:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-17 15:45:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-17 15:45:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-17 15:45:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-12-17 15:45:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,341 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2021-12-17 15:45:06,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:06,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040629934] [2021-12-17 15:45:06,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040629934] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:45:06,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429929615] [2021-12-17 15:45:06,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:06,342 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:45:06,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:45:06,343 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:45:06,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 15:45:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:06,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 15:45:06,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:45:06,802 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2021-12-17 15:45:06,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:45:06,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429929615] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:06,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:45:06,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2021-12-17 15:45:06,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169375921] [2021-12-17 15:45:06,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:06,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:45:06,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:06,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:45:06,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-17 15:45:06,803 INFO L87 Difference]: Start difference. First operand 655 states and 856 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-17 15:45:06,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:06,859 INFO L93 Difference]: Finished difference Result 1045 states and 1396 transitions. [2021-12-17 15:45:06,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:45:06,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 267 [2021-12-17 15:45:06,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:06,861 INFO L225 Difference]: With dead ends: 1045 [2021-12-17 15:45:06,861 INFO L226 Difference]: Without dead ends: 667 [2021-12-17 15:45:06,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-17 15:45:06,862 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 15 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:06,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 710 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:45:06,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2021-12-17 15:45:06,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2021-12-17 15:45:06,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 564 states have (on average 1.3120567375886525) internal successors, (740), 569 states have internal predecessors, (740), 65 states have call successors, (65), 37 states have call predecessors, (65), 37 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2021-12-17 15:45:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 870 transitions. [2021-12-17 15:45:06,904 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 870 transitions. Word has length 267 [2021-12-17 15:45:06,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:06,904 INFO L470 AbstractCegarLoop]: Abstraction has 667 states and 870 transitions. [2021-12-17 15:45:06,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-17 15:45:06,904 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 870 transitions. [2021-12-17 15:45:06,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-12-17 15:45:06,906 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:06,906 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:06,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 15:45:07,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-17 15:45:07,123 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:07,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:07,124 INFO L85 PathProgramCache]: Analyzing trace with hash -185468270, now seen corresponding path program 1 times [2021-12-17 15:45:07,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:07,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686041580] [2021-12-17 15:45:07,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:07,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-17 15:45:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-17 15:45:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-17 15:45:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-17 15:45:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-17 15:45:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2021-12-17 15:45:07,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:07,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686041580] [2021-12-17 15:45:07,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686041580] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:07,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:07,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:45:07,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935897783] [2021-12-17 15:45:07,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:07,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:45:07,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:07,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:45:07,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:45:07,274 INFO L87 Difference]: Start difference. First operand 667 states and 870 transitions. Second operand has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2021-12-17 15:45:07,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:07,557 INFO L93 Difference]: Finished difference Result 939 states and 1293 transitions. [2021-12-17 15:45:07,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 15:45:07,557 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 268 [2021-12-17 15:45:07,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:07,560 INFO L225 Difference]: With dead ends: 939 [2021-12-17 15:45:07,560 INFO L226 Difference]: Without dead ends: 937 [2021-12-17 15:45:07,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-17 15:45:07,561 INFO L933 BasicCegarLoop]: 384 mSDtfsCounter, 260 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:07,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 1813 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:45:07,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2021-12-17 15:45:07,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 673. [2021-12-17 15:45:07,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 568 states have (on average 1.3098591549295775) internal successors, (744), 574 states have internal predecessors, (744), 66 states have call successors, (66), 38 states have call predecessors, (66), 38 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2021-12-17 15:45:07,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 876 transitions. [2021-12-17 15:45:07,579 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 876 transitions. Word has length 268 [2021-12-17 15:45:07,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:07,579 INFO L470 AbstractCegarLoop]: Abstraction has 673 states and 876 transitions. [2021-12-17 15:45:07,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2021-12-17 15:45:07,580 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 876 transitions. [2021-12-17 15:45:07,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2021-12-17 15:45:07,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:07,581 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:07,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-17 15:45:07,581 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:07,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:07,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1915412215, now seen corresponding path program 1 times [2021-12-17 15:45:07,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:07,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220744122] [2021-12-17 15:45:07,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:07,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-17 15:45:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-17 15:45:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-17 15:45:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-17 15:45:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-17 15:45:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-12-17 15:45:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2021-12-17 15:45:07,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:07,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220744122] [2021-12-17 15:45:07,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220744122] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:45:07,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539463875] [2021-12-17 15:45:07,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:07,740 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:45:07,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:45:07,740 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:45:07,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 15:45:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:07,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 15:45:07,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:45:08,223 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 251 proven. 33 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2021-12-17 15:45:08,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:45:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2021-12-17 15:45:08,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539463875] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 15:45:08,619 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 15:45:08,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2021-12-17 15:45:08,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144498047] [2021-12-17 15:45:08,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 15:45:08,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-17 15:45:08,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:08,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-17 15:45:08,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-12-17 15:45:08,621 INFO L87 Difference]: Start difference. First operand 673 states and 876 transitions. Second operand has 19 states, 19 states have (on average 7.894736842105263) internal successors, (150), 14 states have internal predecessors, (150), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2021-12-17 15:45:09,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:09,750 INFO L93 Difference]: Finished difference Result 1913 states and 2671 transitions. [2021-12-17 15:45:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-17 15:45:09,750 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.894736842105263) internal successors, (150), 14 states have internal predecessors, (150), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) Word has length 276 [2021-12-17 15:45:09,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:09,755 INFO L225 Difference]: With dead ends: 1913 [2021-12-17 15:45:09,755 INFO L226 Difference]: Without dead ends: 1517 [2021-12-17 15:45:09,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2021-12-17 15:45:09,757 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 705 mSDsluCounter, 3085 mSDsCounter, 0 mSdLazyCounter, 1601 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 3467 SdHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:09,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [753 Valid, 3467 Invalid, 1807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1601 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-17 15:45:09,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2021-12-17 15:45:09,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 940. [2021-12-17 15:45:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 795 states have (on average 1.3018867924528301) internal successors, (1035), 802 states have internal predecessors, (1035), 90 states have call successors, (90), 51 states have call predecessors, (90), 54 states have return successors, (95), 90 states have call predecessors, (95), 90 states have call successors, (95) [2021-12-17 15:45:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1220 transitions. [2021-12-17 15:45:09,789 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1220 transitions. Word has length 276 [2021-12-17 15:45:09,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:09,789 INFO L470 AbstractCegarLoop]: Abstraction has 940 states and 1220 transitions. [2021-12-17 15:45:09,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.894736842105263) internal successors, (150), 14 states have internal predecessors, (150), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2021-12-17 15:45:09,789 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1220 transitions. [2021-12-17 15:45:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2021-12-17 15:45:09,791 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:09,791 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:09,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-17 15:45:10,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:45:10,009 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:10,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:10,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1417941064, now seen corresponding path program 1 times [2021-12-17 15:45:10,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:10,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031737832] [2021-12-17 15:45:10,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:10,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-17 15:45:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-17 15:45:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-17 15:45:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-17 15:45:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-17 15:45:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-12-17 15:45:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,165 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2021-12-17 15:45:10,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:10,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031737832] [2021-12-17 15:45:10,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031737832] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:45:10,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376648498] [2021-12-17 15:45:10,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:10,166 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:45:10,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:45:10,192 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:45:10,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 15:45:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 15:45:10,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:45:10,588 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2021-12-17 15:45:10,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:45:10,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376648498] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:10,588 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:45:10,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-17 15:45:10,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916840703] [2021-12-17 15:45:10,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:10,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:45:10,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:10,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:45:10,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:10,590 INFO L87 Difference]: Start difference. First operand 940 states and 1220 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-17 15:45:10,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:10,642 INFO L93 Difference]: Finished difference Result 1743 states and 2304 transitions. [2021-12-17 15:45:10,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:45:10,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 276 [2021-12-17 15:45:10,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:10,646 INFO L225 Difference]: With dead ends: 1743 [2021-12-17 15:45:10,646 INFO L226 Difference]: Without dead ends: 924 [2021-12-17 15:45:10,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 321 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:45:10,648 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 11 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:10,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 710 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:45:10,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2021-12-17 15:45:10,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 924. [2021-12-17 15:45:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 784 states have (on average 1.2895408163265305) internal successors, (1011), 791 states have internal predecessors, (1011), 86 states have call successors, (86), 51 states have call predecessors, (86), 53 states have return successors, (90), 85 states have call predecessors, (90), 86 states have call successors, (90) [2021-12-17 15:45:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1187 transitions. [2021-12-17 15:45:10,671 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1187 transitions. Word has length 276 [2021-12-17 15:45:10,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:10,671 INFO L470 AbstractCegarLoop]: Abstraction has 924 states and 1187 transitions. [2021-12-17 15:45:10,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-17 15:45:10,671 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1187 transitions. [2021-12-17 15:45:10,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-12-17 15:45:10,673 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:10,673 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:10,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-17 15:45:10,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-17 15:45:10,891 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:10,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:10,892 INFO L85 PathProgramCache]: Analyzing trace with hash -818721709, now seen corresponding path program 1 times [2021-12-17 15:45:10,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:10,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56722867] [2021-12-17 15:45:10,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:10,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:10,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 15:45:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-17 15:45:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-17 15:45:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2021-12-17 15:45:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2021-12-17 15:45:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-17 15:45:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-17 15:45:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-17 15:45:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-12-17 15:45:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2021-12-17 15:45:11,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:11,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56722867] [2021-12-17 15:45:11,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56722867] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:45:11,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174915165] [2021-12-17 15:45:11,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:11,041 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:45:11,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:45:11,056 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:45:11,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-17 15:45:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 15:45:11,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:45:11,464 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2021-12-17 15:45:11,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:45:11,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174915165] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:11,465 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:45:11,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-17 15:45:11,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229961658] [2021-12-17 15:45:11,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:11,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:45:11,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:11,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:45:11,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:11,466 INFO L87 Difference]: Start difference. First operand 924 states and 1187 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-17 15:45:11,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:11,517 INFO L93 Difference]: Finished difference Result 1576 states and 2065 transitions. [2021-12-17 15:45:11,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:45:11,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 279 [2021-12-17 15:45:11,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:11,520 INFO L225 Difference]: With dead ends: 1576 [2021-12-17 15:45:11,520 INFO L226 Difference]: Without dead ends: 764 [2021-12-17 15:45:11,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 324 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:45:11,522 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 8 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:11,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 713 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:45:11,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2021-12-17 15:45:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2021-12-17 15:45:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 642 states have (on average 1.2850467289719627) internal successors, (825), 649 states have internal predecessors, (825), 77 states have call successors, (77), 44 states have call predecessors, (77), 44 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) [2021-12-17 15:45:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 979 transitions. [2021-12-17 15:45:11,541 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 979 transitions. Word has length 279 [2021-12-17 15:45:11,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:11,541 INFO L470 AbstractCegarLoop]: Abstraction has 764 states and 979 transitions. [2021-12-17 15:45:11,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-17 15:45:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 979 transitions. [2021-12-17 15:45:11,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2021-12-17 15:45:11,542 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:11,543 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:11,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-17 15:45:11,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:45:11,758 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:11,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:11,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2031857474, now seen corresponding path program 1 times [2021-12-17 15:45:11,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:11,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017323484] [2021-12-17 15:45:11,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:11,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:11,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:12,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-17 15:45:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:12,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-17 15:45:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:12,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-17 15:45:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:12,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-17 15:45:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:12,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-17 15:45:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:12,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-12-17 15:45:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:12,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2021-12-17 15:45:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:12,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-12-17 15:45:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 16 proven. 146 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2021-12-17 15:45:12,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:12,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017323484] [2021-12-17 15:45:12,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017323484] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:45:12,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685961378] [2021-12-17 15:45:12,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:12,044 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:45:12,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:45:12,045 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:45:12,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-17 15:45:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:12,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-17 15:45:12,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:45:12,618 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2021-12-17 15:45:12,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:45:12,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685961378] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:12,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:45:12,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2021-12-17 15:45:12,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135427025] [2021-12-17 15:45:12,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:12,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 15:45:12,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:12,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 15:45:12,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2021-12-17 15:45:12,621 INFO L87 Difference]: Start difference. First operand 764 states and 979 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 9 states have internal predecessors, (109), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-17 15:45:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:13,422 INFO L93 Difference]: Finished difference Result 2253 states and 3006 transitions. [2021-12-17 15:45:13,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-17 15:45:13,423 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 9 states have internal predecessors, (109), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 291 [2021-12-17 15:45:13,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:13,429 INFO L225 Difference]: With dead ends: 2253 [2021-12-17 15:45:13,429 INFO L226 Difference]: Without dead ends: 1847 [2021-12-17 15:45:13,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=311, Invalid=2139, Unknown=0, NotChecked=0, Total=2450 [2021-12-17 15:45:13,431 INFO L933 BasicCegarLoop]: 373 mSDtfsCounter, 1103 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:13,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1107 Valid, 2987 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 15:45:13,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2021-12-17 15:45:13,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1063. [2021-12-17 15:45:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 882 states have (on average 1.2834467120181405) internal successors, (1132), 888 states have internal predecessors, (1132), 116 states have call successors, (116), 64 states have call predecessors, (116), 64 states have return successors, (116), 110 states have call predecessors, (116), 116 states have call successors, (116) [2021-12-17 15:45:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1364 transitions. [2021-12-17 15:45:13,466 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1364 transitions. Word has length 291 [2021-12-17 15:45:13,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:13,466 INFO L470 AbstractCegarLoop]: Abstraction has 1063 states and 1364 transitions. [2021-12-17 15:45:13,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 9 states have internal predecessors, (109), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-17 15:45:13,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1364 transitions. [2021-12-17 15:45:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2021-12-17 15:45:13,468 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:13,468 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:13,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-17 15:45:13,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-12-17 15:45:13,687 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:13,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:13,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1472400859, now seen corresponding path program 1 times [2021-12-17 15:45:13,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:13,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518193672] [2021-12-17 15:45:13,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:13,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-17 15:45:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-17 15:45:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-17 15:45:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-17 15:45:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-17 15:45:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-17 15:45:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2021-12-17 15:45:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-17 15:45:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:13,809 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2021-12-17 15:45:13,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:13,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518193672] [2021-12-17 15:45:13,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518193672] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:13,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:13,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:45:13,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627424255] [2021-12-17 15:45:13,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:13,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:45:13,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:13,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:45:13,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:45:13,811 INFO L87 Difference]: Start difference. First operand 1063 states and 1364 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-17 15:45:14,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:14,123 INFO L93 Difference]: Finished difference Result 2942 states and 4085 transitions. [2021-12-17 15:45:14,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 15:45:14,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 297 [2021-12-17 15:45:14,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:14,131 INFO L225 Difference]: With dead ends: 2942 [2021-12-17 15:45:14,131 INFO L226 Difference]: Without dead ends: 2225 [2021-12-17 15:45:14,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:45:14,133 INFO L933 BasicCegarLoop]: 562 mSDtfsCounter, 547 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 1873 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:14,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [601 Valid, 1873 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 15:45:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2225 states. [2021-12-17 15:45:14,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2225 to 1132. [2021-12-17 15:45:14,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 936 states have (on average 1.295940170940171) internal successors, (1213), 942 states have internal predecessors, (1213), 131 states have call successors, (131), 64 states have call predecessors, (131), 64 states have return successors, (131), 125 states have call predecessors, (131), 131 states have call successors, (131) [2021-12-17 15:45:14,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1475 transitions. [2021-12-17 15:45:14,180 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1475 transitions. Word has length 297 [2021-12-17 15:45:14,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:14,181 INFO L470 AbstractCegarLoop]: Abstraction has 1132 states and 1475 transitions. [2021-12-17 15:45:14,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-17 15:45:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1475 transitions. [2021-12-17 15:45:14,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2021-12-17 15:45:14,182 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:14,182 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:14,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-17 15:45:14,183 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:14,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:14,183 INFO L85 PathProgramCache]: Analyzing trace with hash -358014121, now seen corresponding path program 1 times [2021-12-17 15:45:14,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:14,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996635708] [2021-12-17 15:45:14,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:14,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-17 15:45:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-17 15:45:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-17 15:45:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-17 15:45:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-17 15:45:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-17 15:45:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2021-12-17 15:45:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-17 15:45:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2021-12-17 15:45:14,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:14,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996635708] [2021-12-17 15:45:14,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996635708] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:45:14,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022763718] [2021-12-17 15:45:14,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:14,409 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:45:14,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:45:14,428 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:45:14,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-17 15:45:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:14,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-17 15:45:14,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:45:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2021-12-17 15:45:15,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:45:15,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022763718] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:15,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:45:15,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2021-12-17 15:45:15,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514390910] [2021-12-17 15:45:15,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:15,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 15:45:15,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:15,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 15:45:15,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2021-12-17 15:45:15,040 INFO L87 Difference]: Start difference. First operand 1132 states and 1475 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2021-12-17 15:45:15,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:15,907 INFO L93 Difference]: Finished difference Result 3709 states and 5052 transitions. [2021-12-17 15:45:15,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-17 15:45:15,907 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 297 [2021-12-17 15:45:15,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:15,916 INFO L225 Difference]: With dead ends: 3709 [2021-12-17 15:45:15,916 INFO L226 Difference]: Without dead ends: 2930 [2021-12-17 15:45:15,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=1164, Unknown=0, NotChecked=0, Total=1332 [2021-12-17 15:45:15,917 INFO L933 BasicCegarLoop]: 522 mSDtfsCounter, 1307 mSDsluCounter, 3258 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 3780 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:15,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1320 Valid, 3780 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-17 15:45:15,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2021-12-17 15:45:15,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1470. [2021-12-17 15:45:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 1208 states have (on average 1.2938741721854305) internal successors, (1563), 1217 states have internal predecessors, (1563), 182 states have call successors, (182), 79 states have call predecessors, (182), 79 states have return successors, (182), 173 states have call predecessors, (182), 182 states have call successors, (182) [2021-12-17 15:45:15,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 1927 transitions. [2021-12-17 15:45:15,978 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 1927 transitions. Word has length 297 [2021-12-17 15:45:15,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:15,979 INFO L470 AbstractCegarLoop]: Abstraction has 1470 states and 1927 transitions. [2021-12-17 15:45:15,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2021-12-17 15:45:15,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 1927 transitions. [2021-12-17 15:45:15,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2021-12-17 15:45:15,980 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:15,980 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:16,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-17 15:45:16,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-12-17 15:45:16,196 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:16,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:16,196 INFO L85 PathProgramCache]: Analyzing trace with hash 317318999, now seen corresponding path program 1 times [2021-12-17 15:45:16,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:16,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730905167] [2021-12-17 15:45:16,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:16,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-17 15:45:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-17 15:45:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-17 15:45:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-17 15:45:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-17 15:45:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-17 15:45:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2021-12-17 15:45:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-17 15:45:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,427 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2021-12-17 15:45:16,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:16,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730905167] [2021-12-17 15:45:16,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730905167] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:45:16,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370668897] [2021-12-17 15:45:16,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:16,427 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:45:16,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:45:16,428 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:45:16,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-17 15:45:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:16,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-17 15:45:16,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:45:17,012 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2021-12-17 15:45:17,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:45:17,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370668897] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:17,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:45:17,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2021-12-17 15:45:17,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203309792] [2021-12-17 15:45:17,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:17,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 15:45:17,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:17,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 15:45:17,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2021-12-17 15:45:17,014 INFO L87 Difference]: Start difference. First operand 1470 states and 1927 transitions. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 7 states have internal predecessors, (116), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2021-12-17 15:45:17,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:17,347 INFO L93 Difference]: Finished difference Result 3446 states and 4699 transitions. [2021-12-17 15:45:17,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 15:45:17,347 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 7 states have internal predecessors, (116), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 297 [2021-12-17 15:45:17,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:17,355 INFO L225 Difference]: With dead ends: 3446 [2021-12-17 15:45:17,355 INFO L226 Difference]: Without dead ends: 2317 [2021-12-17 15:45:17,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2021-12-17 15:45:17,358 INFO L933 BasicCegarLoop]: 459 mSDtfsCounter, 520 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 2307 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:17,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [535 Valid, 2307 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:45:17,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2021-12-17 15:45:17,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 1557. [2021-12-17 15:45:17,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1280 states have (on average 1.2921875) internal successors, (1654), 1290 states have internal predecessors, (1654), 192 states have call successors, (192), 84 states have call predecessors, (192), 84 states have return successors, (192), 182 states have call predecessors, (192), 192 states have call successors, (192) [2021-12-17 15:45:17,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2038 transitions. [2021-12-17 15:45:17,422 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2038 transitions. Word has length 297 [2021-12-17 15:45:17,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:17,422 INFO L470 AbstractCegarLoop]: Abstraction has 1557 states and 2038 transitions. [2021-12-17 15:45:17,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 7 states have internal predecessors, (116), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2021-12-17 15:45:17,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2038 transitions. [2021-12-17 15:45:17,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2021-12-17 15:45:17,424 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:17,424 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:17,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-17 15:45:17,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-12-17 15:45:17,642 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:17,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:17,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1597737013, now seen corresponding path program 1 times [2021-12-17 15:45:17,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:17,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22805140] [2021-12-17 15:45:17,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:17,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-17 15:45:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-17 15:45:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-17 15:45:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-17 15:45:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-17 15:45:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-12-17 15:45:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-17 15:45:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2021-12-17 15:45:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2021-12-17 15:45:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2021-12-17 15:45:17,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:17,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22805140] [2021-12-17 15:45:17,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22805140] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:17,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:17,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:45:17,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323377161] [2021-12-17 15:45:17,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:17,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:45:17,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:17,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:45:17,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:17,763 INFO L87 Difference]: Start difference. First operand 1557 states and 2038 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2021-12-17 15:45:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:18,141 INFO L93 Difference]: Finished difference Result 2791 states and 3677 transitions. [2021-12-17 15:45:18,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 15:45:18,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 311 [2021-12-17 15:45:18,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:18,146 INFO L225 Difference]: With dead ends: 2791 [2021-12-17 15:45:18,146 INFO L226 Difference]: Without dead ends: 1595 [2021-12-17 15:45:18,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:45:18,149 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 509 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:18,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [529 Valid, 1020 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 15:45:18,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2021-12-17 15:45:18,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1261. [2021-12-17 15:45:18,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1045 states have (on average 1.2717703349282297) internal successors, (1329), 1052 states have internal predecessors, (1329), 150 states have call successors, (150), 65 states have call predecessors, (150), 65 states have return successors, (150), 143 states have call predecessors, (150), 150 states have call successors, (150) [2021-12-17 15:45:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1629 transitions. [2021-12-17 15:45:18,195 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1629 transitions. Word has length 311 [2021-12-17 15:45:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:18,196 INFO L470 AbstractCegarLoop]: Abstraction has 1261 states and 1629 transitions. [2021-12-17 15:45:18,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2021-12-17 15:45:18,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1629 transitions. [2021-12-17 15:45:18,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2021-12-17 15:45:18,198 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:18,199 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:18,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-17 15:45:18,199 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:18,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:18,200 INFO L85 PathProgramCache]: Analyzing trace with hash 522126260, now seen corresponding path program 1 times [2021-12-17 15:45:18,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:18,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076093664] [2021-12-17 15:45:18,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:18,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-17 15:45:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-17 15:45:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-17 15:45:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-17 15:45:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-17 15:45:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-12-17 15:45:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-17 15:45:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-17 15:45:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-12-17 15:45:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-12-17 15:45:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-12-17 15:45:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2021-12-17 15:45:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-12-17 15:45:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 22 proven. 33 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2021-12-17 15:45:18,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:18,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076093664] [2021-12-17 15:45:18,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076093664] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:45:18,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96666851] [2021-12-17 15:45:18,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:18,524 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:45:18,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:45:18,525 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:45:18,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-17 15:45:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:18,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-17 15:45:18,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:45:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 151 proven. 33 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2021-12-17 15:45:19,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:45:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 49 proven. 2 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [2021-12-17 15:45:19,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96666851] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 15:45:19,751 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 15:45:19,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 12, 9] total 37 [2021-12-17 15:45:19,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596913135] [2021-12-17 15:45:19,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 15:45:19,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-17 15:45:19,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:19,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-17 15:45:19,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1244, Unknown=0, NotChecked=0, Total=1332 [2021-12-17 15:45:19,753 INFO L87 Difference]: Start difference. First operand 1261 states and 1629 transitions. Second operand has 37 states, 37 states have (on average 5.8108108108108105) internal successors, (215), 31 states have internal predecessors, (215), 9 states have call successors, (45), 6 states have call predecessors, (45), 10 states have return successors, (46), 14 states have call predecessors, (46), 9 states have call successors, (46) [2021-12-17 15:45:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:29,403 INFO L93 Difference]: Finished difference Result 5944 states and 8258 transitions. [2021-12-17 15:45:29,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2021-12-17 15:45:29,404 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 5.8108108108108105) internal successors, (215), 31 states have internal predecessors, (215), 9 states have call successors, (45), 6 states have call predecessors, (45), 10 states have return successors, (46), 14 states have call predecessors, (46), 9 states have call successors, (46) Word has length 350 [2021-12-17 15:45:29,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:29,425 INFO L225 Difference]: With dead ends: 5944 [2021-12-17 15:45:29,428 INFO L226 Difference]: Without dead ends: 5046 [2021-12-17 15:45:29,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 980 GetRequests, 800 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10426 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2145, Invalid=30435, Unknown=0, NotChecked=0, Total=32580 [2021-12-17 15:45:29,437 INFO L933 BasicCegarLoop]: 661 mSDtfsCounter, 3936 mSDsluCounter, 13282 mSDsCounter, 0 mSdLazyCounter, 15495 mSolverCounterSat, 2399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3950 SdHoareTripleChecker+Valid, 13943 SdHoareTripleChecker+Invalid, 17894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2399 IncrementalHoareTripleChecker+Valid, 15495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:29,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3950 Valid, 13943 Invalid, 17894 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2399 Valid, 15495 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2021-12-17 15:45:29,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5046 states. [2021-12-17 15:45:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5046 to 1761. [2021-12-17 15:45:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1463 states have (on average 1.2665755297334245) internal successors, (1853), 1475 states have internal predecessors, (1853), 190 states have call successors, (190), 97 states have call predecessors, (190), 107 states have return successors, (203), 188 states have call predecessors, (203), 190 states have call successors, (203) [2021-12-17 15:45:29,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2246 transitions. [2021-12-17 15:45:29,559 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2246 transitions. Word has length 350 [2021-12-17 15:45:29,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:29,559 INFO L470 AbstractCegarLoop]: Abstraction has 1761 states and 2246 transitions. [2021-12-17 15:45:29,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.8108108108108105) internal successors, (215), 31 states have internal predecessors, (215), 9 states have call successors, (45), 6 states have call predecessors, (45), 10 states have return successors, (46), 14 states have call predecessors, (46), 9 states have call successors, (46) [2021-12-17 15:45:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2246 transitions. [2021-12-17 15:45:29,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2021-12-17 15:45:29,565 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:29,567 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:29,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-17 15:45:29,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-12-17 15:45:29,784 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:29,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:29,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2072375083, now seen corresponding path program 1 times [2021-12-17 15:45:29,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:29,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453807322] [2021-12-17 15:45:29,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:29,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-17 15:45:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-17 15:45:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-17 15:45:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-17 15:45:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-17 15:45:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-12-17 15:45:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-17 15:45:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-17 15:45:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-12-17 15:45:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-12-17 15:45:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-12-17 15:45:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2021-12-17 15:45:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-12-17 15:45:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:29,922 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2021-12-17 15:45:29,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:29,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453807322] [2021-12-17 15:45:29,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453807322] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:29,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:29,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 15:45:29,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369126831] [2021-12-17 15:45:29,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:29,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:45:29,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:29,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:45:29,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:45:29,927 INFO L87 Difference]: Start difference. First operand 1761 states and 2246 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2021-12-17 15:45:30,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:30,275 INFO L93 Difference]: Finished difference Result 3051 states and 3928 transitions. [2021-12-17 15:45:30,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 15:45:30,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 350 [2021-12-17 15:45:30,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:30,280 INFO L225 Difference]: With dead ends: 3051 [2021-12-17 15:45:30,280 INFO L226 Difference]: Without dead ends: 1770 [2021-12-17 15:45:30,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-17 15:45:30,282 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 377 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:30,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 515 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:45:30,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2021-12-17 15:45:30,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1767. [2021-12-17 15:45:30,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1469 states have (on average 1.2648059904697073) internal successors, (1858), 1481 states have internal predecessors, (1858), 190 states have call successors, (190), 97 states have call predecessors, (190), 107 states have return successors, (203), 188 states have call predecessors, (203), 190 states have call successors, (203) [2021-12-17 15:45:30,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2251 transitions. [2021-12-17 15:45:30,352 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2251 transitions. Word has length 350 [2021-12-17 15:45:30,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:30,353 INFO L470 AbstractCegarLoop]: Abstraction has 1767 states and 2251 transitions. [2021-12-17 15:45:30,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2021-12-17 15:45:30,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2251 transitions. [2021-12-17 15:45:30,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2021-12-17 15:45:30,357 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:30,357 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:30,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-12-17 15:45:30,357 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:30,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:30,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1816454027, now seen corresponding path program 1 times [2021-12-17 15:45:30,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:30,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693941838] [2021-12-17 15:45:30,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:30,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-17 15:45:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-17 15:45:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-17 15:45:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-17 15:45:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-17 15:45:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-12-17 15:45:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-17 15:45:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-17 15:45:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-12-17 15:45:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-12-17 15:45:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-12-17 15:45:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2021-12-17 15:45:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-12-17 15:45:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2021-12-17 15:45:30,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:30,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693941838] [2021-12-17 15:45:30,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693941838] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:30,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:30,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 15:45:30,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835951115] [2021-12-17 15:45:30,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:30,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:45:30,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:30,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:45:30,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:45:30,451 INFO L87 Difference]: Start difference. First operand 1767 states and 2251 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-17 15:45:30,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:30,768 INFO L93 Difference]: Finished difference Result 4469 states and 5739 transitions. [2021-12-17 15:45:30,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:45:30,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 350 [2021-12-17 15:45:30,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:30,777 INFO L225 Difference]: With dead ends: 4469 [2021-12-17 15:45:30,777 INFO L226 Difference]: Without dead ends: 3078 [2021-12-17 15:45:30,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:30,782 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 215 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:30,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 666 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 15:45:30,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3078 states. [2021-12-17 15:45:30,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3078 to 2036. [2021-12-17 15:45:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2036 states, 1738 states have (on average 1.2623705408515535) internal successors, (2194), 1750 states have internal predecessors, (2194), 190 states have call successors, (190), 97 states have call predecessors, (190), 107 states have return successors, (203), 188 states have call predecessors, (203), 190 states have call successors, (203) [2021-12-17 15:45:30,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 2587 transitions. [2021-12-17 15:45:30,877 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 2587 transitions. Word has length 350 [2021-12-17 15:45:30,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:30,878 INFO L470 AbstractCegarLoop]: Abstraction has 2036 states and 2587 transitions. [2021-12-17 15:45:30,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-17 15:45:30,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2587 transitions. [2021-12-17 15:45:30,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2021-12-17 15:45:30,882 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:30,882 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:30,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-17 15:45:30,883 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:30,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:30,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1483810889, now seen corresponding path program 1 times [2021-12-17 15:45:30,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:30,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533886603] [2021-12-17 15:45:30,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:30,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-17 15:45:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-17 15:45:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-17 15:45:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-17 15:45:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-17 15:45:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-12-17 15:45:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-17 15:45:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-17 15:45:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-12-17 15:45:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-12-17 15:45:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-12-17 15:45:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2021-12-17 15:45:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-12-17 15:45:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2021-12-17 15:45:30,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:30,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533886603] [2021-12-17 15:45:30,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533886603] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:30,980 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:30,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:45:30,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757050754] [2021-12-17 15:45:30,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:30,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:45:30,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:30,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:45:30,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:45:30,981 INFO L87 Difference]: Start difference. First operand 2036 states and 2587 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2021-12-17 15:45:31,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:31,238 INFO L93 Difference]: Finished difference Result 4091 states and 5199 transitions. [2021-12-17 15:45:31,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 15:45:31,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 350 [2021-12-17 15:45:31,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:31,244 INFO L225 Difference]: With dead ends: 4091 [2021-12-17 15:45:31,244 INFO L226 Difference]: Without dead ends: 1996 [2021-12-17 15:45:31,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:45:31,246 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 107 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:31,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 730 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 15:45:31,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2021-12-17 15:45:31,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1996. [2021-12-17 15:45:31,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1996 states, 1708 states have (on average 1.240046838407494) internal successors, (2118), 1720 states have internal predecessors, (2118), 190 states have call successors, (190), 97 states have call predecessors, (190), 97 states have return successors, (190), 178 states have call predecessors, (190), 190 states have call successors, (190) [2021-12-17 15:45:31,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 2498 transitions. [2021-12-17 15:45:31,350 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 2498 transitions. Word has length 350 [2021-12-17 15:45:31,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:31,351 INFO L470 AbstractCegarLoop]: Abstraction has 1996 states and 2498 transitions. [2021-12-17 15:45:31,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2021-12-17 15:45:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2498 transitions. [2021-12-17 15:45:31,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2021-12-17 15:45:31,355 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:31,355 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:31,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-12-17 15:45:31,355 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:31,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:31,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1962062639, now seen corresponding path program 1 times [2021-12-17 15:45:31,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:31,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881648000] [2021-12-17 15:45:31,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:31,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-17 15:45:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-17 15:45:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-17 15:45:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-17 15:45:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-17 15:45:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-12-17 15:45:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-17 15:45:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-17 15:45:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-12-17 15:45:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-12-17 15:45:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-12-17 15:45:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2021-12-17 15:45:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-12-17 15:45:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2021-12-17 15:45:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 910 trivial. 0 not checked. [2021-12-17 15:45:31,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:31,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881648000] [2021-12-17 15:45:31,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881648000] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:45:31,458 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:45:31,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 15:45:31,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863884061] [2021-12-17 15:45:31,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:45:31,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:45:31,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:31,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:45:31,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:45:31,460 INFO L87 Difference]: Start difference. First operand 1996 states and 2498 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-17 15:45:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:31,628 INFO L93 Difference]: Finished difference Result 3575 states and 4501 transitions. [2021-12-17 15:45:31,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 15:45:31,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 360 [2021-12-17 15:45:31,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:31,632 INFO L225 Difference]: With dead ends: 3575 [2021-12-17 15:45:31,633 INFO L226 Difference]: Without dead ends: 1915 [2021-12-17 15:45:31,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:45:31,637 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 54 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:31,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 569 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 15:45:31,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2021-12-17 15:45:31,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1915. [2021-12-17 15:45:31,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1915 states, 1627 states have (on average 1.2274124154886294) internal successors, (1997), 1639 states have internal predecessors, (1997), 190 states have call successors, (190), 97 states have call predecessors, (190), 97 states have return successors, (190), 178 states have call predecessors, (190), 190 states have call successors, (190) [2021-12-17 15:45:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 2377 transitions. [2021-12-17 15:45:31,770 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 2377 transitions. Word has length 360 [2021-12-17 15:45:31,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:31,770 INFO L470 AbstractCegarLoop]: Abstraction has 1915 states and 2377 transitions. [2021-12-17 15:45:31,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-17 15:45:31,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2377 transitions. [2021-12-17 15:45:31,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2021-12-17 15:45:31,774 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:31,774 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:31,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-12-17 15:45:31,774 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:31,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:31,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1339907605, now seen corresponding path program 1 times [2021-12-17 15:45:31,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:31,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900555385] [2021-12-17 15:45:31,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:31,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:32,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:32,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:32,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:32,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:32,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-12-17 15:45:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:32,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-12-17 15:45:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:32,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-17 15:45:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:32,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-17 15:45:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:32,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-17 15:45:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:32,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-12-17 15:45:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:32,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-12-17 15:45:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:32,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-17 15:45:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:32,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-17 15:45:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:32,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2021-12-17 15:45:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:32,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2021-12-17 15:45:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:32,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2021-12-17 15:45:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:32,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2021-12-17 15:45:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:32,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2021-12-17 15:45:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:32,074 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 22 proven. 33 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2021-12-17 15:45:32,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:32,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900555385] [2021-12-17 15:45:32,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900555385] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:45:32,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809860845] [2021-12-17 15:45:32,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:32,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:45:32,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:45:32,075 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:45:32,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-17 15:45:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:32,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-17 15:45:32,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:45:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 277 proven. 80 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2021-12-17 15:45:32,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:45:33,633 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 34 proven. 78 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2021-12-17 15:45:33,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809860845] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 15:45:33,633 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 15:45:33,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 41 [2021-12-17 15:45:33,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232098278] [2021-12-17 15:45:33,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 15:45:33,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-17 15:45:33,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:33,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-17 15:45:33,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1540, Unknown=0, NotChecked=0, Total=1640 [2021-12-17 15:45:33,635 INFO L87 Difference]: Start difference. First operand 1915 states and 2377 transitions. Second operand has 41 states, 41 states have (on average 6.780487804878049) internal successors, (278), 35 states have internal predecessors, (278), 10 states have call successors, (55), 9 states have call predecessors, (55), 14 states have return successors, (55), 15 states have call predecessors, (55), 10 states have call successors, (55) [2021-12-17 15:45:55,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:45:55,797 INFO L93 Difference]: Finished difference Result 12999 states and 17064 transitions. [2021-12-17 15:45:55,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 465 states. [2021-12-17 15:45:55,797 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 6.780487804878049) internal successors, (278), 35 states have internal predecessors, (278), 10 states have call successors, (55), 9 states have call predecessors, (55), 14 states have return successors, (55), 15 states have call predecessors, (55), 10 states have call successors, (55) Word has length 361 [2021-12-17 15:45:55,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:45:55,863 INFO L225 Difference]: With dead ends: 12999 [2021-12-17 15:45:55,863 INFO L226 Difference]: Without dead ends: 11487 [2021-12-17 15:45:55,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1280 GetRequests, 778 SyntacticMatches, 1 SemanticMatches, 501 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105068 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=15719, Invalid=236787, Unknown=0, NotChecked=0, Total=252506 [2021-12-17 15:45:55,883 INFO L933 BasicCegarLoop]: 1272 mSDtfsCounter, 7033 mSDsluCounter, 25293 mSDsCounter, 0 mSdLazyCounter, 25120 mSolverCounterSat, 4911 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7034 SdHoareTripleChecker+Valid, 26565 SdHoareTripleChecker+Invalid, 30031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4911 IncrementalHoareTripleChecker+Valid, 25120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2021-12-17 15:45:55,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7034 Valid, 26565 Invalid, 30031 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4911 Valid, 25120 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2021-12-17 15:45:55,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11487 states. [2021-12-17 15:45:56,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11487 to 3321. [2021-12-17 15:45:56,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3321 states, 2692 states have (on average 1.2173105497771173) internal successors, (3277), 2721 states have internal predecessors, (3277), 437 states have call successors, (437), 191 states have call predecessors, (437), 191 states have return successors, (437), 408 states have call predecessors, (437), 437 states have call successors, (437) [2021-12-17 15:45:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 4151 transitions. [2021-12-17 15:45:56,143 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 4151 transitions. Word has length 361 [2021-12-17 15:45:56,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:45:56,143 INFO L470 AbstractCegarLoop]: Abstraction has 3321 states and 4151 transitions. [2021-12-17 15:45:56,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.780487804878049) internal successors, (278), 35 states have internal predecessors, (278), 10 states have call successors, (55), 9 states have call predecessors, (55), 14 states have return successors, (55), 15 states have call predecessors, (55), 10 states have call successors, (55) [2021-12-17 15:45:56,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 4151 transitions. [2021-12-17 15:45:56,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2021-12-17 15:45:56,150 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:45:56,150 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:45:56,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-17 15:45:56,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:45:56,369 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:45:56,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:45:56,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1734178564, now seen corresponding path program 1 times [2021-12-17 15:45:56,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:45:56,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432026514] [2021-12-17 15:45:56,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:56,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:45:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:45:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:45:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:45:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:45:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:45:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:45:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:45:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:45:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:45:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:45:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:45:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:45:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:45:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:45:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:45:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:45:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-17 15:45:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-17 15:45:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-17 15:45:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-17 15:45:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-17 15:45:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-12-17 15:45:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-12-17 15:45:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-17 15:45:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-17 15:45:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2021-12-17 15:45:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2021-12-17 15:45:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2021-12-17 15:45:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2021-12-17 15:45:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2021-12-17 15:45:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2021-12-17 15:45:56,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:45:56,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432026514] [2021-12-17 15:45:56,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432026514] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:45:56,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030830459] [2021-12-17 15:45:56,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:45:56,667 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:45:56,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:45:56,671 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:45:56,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-17 15:45:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:45:56,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-17 15:45:56,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:45:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 286 proven. 92 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2021-12-17 15:45:57,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:45:58,473 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 44 proven. 199 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2021-12-17 15:45:58,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030830459] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 15:45:58,474 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 15:45:58,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 18] total 41 [2021-12-17 15:45:58,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686420888] [2021-12-17 15:45:58,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 15:45:58,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-17 15:45:58,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:45:58,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-17 15:45:58,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1533, Unknown=0, NotChecked=0, Total=1640 [2021-12-17 15:45:58,476 INFO L87 Difference]: Start difference. First operand 3321 states and 4151 transitions. Second operand has 41 states, 40 states have (on average 7.7) internal successors, (308), 35 states have internal predecessors, (308), 12 states have call successors, (64), 10 states have call predecessors, (64), 12 states have return successors, (63), 13 states have call predecessors, (63), 11 states have call successors, (63) [2021-12-17 15:46:23,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:46:23,809 INFO L93 Difference]: Finished difference Result 33090 states and 44533 transitions. [2021-12-17 15:46:23,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 397 states. [2021-12-17 15:46:23,809 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 7.7) internal successors, (308), 35 states have internal predecessors, (308), 12 states have call successors, (64), 10 states have call predecessors, (64), 12 states have return successors, (63), 13 states have call predecessors, (63), 11 states have call successors, (63) Word has length 361 [2021-12-17 15:46:23,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:46:23,876 INFO L225 Difference]: With dead ends: 33090 [2021-12-17 15:46:23,876 INFO L226 Difference]: Without dead ends: 30271 [2021-12-17 15:46:23,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1205 GetRequests, 769 SyntacticMatches, 3 SemanticMatches, 433 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79536 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=13868, Invalid=174922, Unknown=0, NotChecked=0, Total=188790 [2021-12-17 15:46:23,897 INFO L933 BasicCegarLoop]: 1228 mSDtfsCounter, 4965 mSDsluCounter, 22988 mSDsCounter, 0 mSdLazyCounter, 25242 mSolverCounterSat, 3162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4978 SdHoareTripleChecker+Valid, 24216 SdHoareTripleChecker+Invalid, 28404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3162 IncrementalHoareTripleChecker+Valid, 25242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:46:23,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4978 Valid, 24216 Invalid, 28404 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3162 Valid, 25242 Invalid, 0 Unknown, 0 Unchecked, 10.0s Time] [2021-12-17 15:46:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30271 states. [2021-12-17 15:46:24,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30271 to 5451. [2021-12-17 15:46:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5451 states, 4500 states have (on average 1.208888888888889) internal successors, (5440), 4541 states have internal predecessors, (5440), 634 states have call successors, (634), 314 states have call predecessors, (634), 316 states have return successors, (638), 595 states have call predecessors, (638), 634 states have call successors, (638) [2021-12-17 15:46:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5451 states to 5451 states and 6712 transitions. [2021-12-17 15:46:24,412 INFO L78 Accepts]: Start accepts. Automaton has 5451 states and 6712 transitions. Word has length 361 [2021-12-17 15:46:24,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:46:24,413 INFO L470 AbstractCegarLoop]: Abstraction has 5451 states and 6712 transitions. [2021-12-17 15:46:24,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 7.7) internal successors, (308), 35 states have internal predecessors, (308), 12 states have call successors, (64), 10 states have call predecessors, (64), 12 states have return successors, (63), 13 states have call predecessors, (63), 11 states have call successors, (63) [2021-12-17 15:46:24,413 INFO L276 IsEmpty]: Start isEmpty. Operand 5451 states and 6712 transitions. [2021-12-17 15:46:24,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2021-12-17 15:46:24,423 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:46:24,423 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:46:24,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-17 15:46:24,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:46:24,641 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:46:24,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:46:24,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1157638044, now seen corresponding path program 1 times [2021-12-17 15:46:24,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:46:24,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790231957] [2021-12-17 15:46:24,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:46:24,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:46:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:46:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:46:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-17 15:46:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-17 15:46:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-17 15:46:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:46:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:46:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:46:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-17 15:46:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:46:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:46:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:46:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-17 15:46:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:46:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:46:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:46:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-17 15:46:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-12-17 15:46:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2021-12-17 15:46:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2021-12-17 15:46:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-12-17 15:46:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-17 15:46:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-17 15:46:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-12-17 15:46:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2021-12-17 15:46:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2021-12-17 15:46:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2021-12-17 15:46:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2021-12-17 15:46:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2021-12-17 15:46:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2021-12-17 15:46:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2021-12-17 15:46:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 9 proven. 136 refuted. 0 times theorem prover too weak. 798 trivial. 0 not checked. [2021-12-17 15:46:24,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:46:24,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790231957] [2021-12-17 15:46:24,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790231957] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:46:24,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223967511] [2021-12-17 15:46:24,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:46:24,744 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:46:24,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:46:24,745 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:46:24,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-17 15:46:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:25,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 15:46:25,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:46:25,573 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2021-12-17 15:46:25,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:46:25,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223967511] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:46:25,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:46:25,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-17 15:46:25,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463501841] [2021-12-17 15:46:25,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:46:25,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:46:25,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:46:25,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:46:25,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:46:25,576 INFO L87 Difference]: Start difference. First operand 5451 states and 6712 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-17 15:46:25,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:46:25,943 INFO L93 Difference]: Finished difference Result 10388 states and 12841 transitions. [2021-12-17 15:46:25,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:46:25,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 364 [2021-12-17 15:46:25,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:46:25,953 INFO L225 Difference]: With dead ends: 10388 [2021-12-17 15:46:25,954 INFO L226 Difference]: Without dead ends: 4938 [2021-12-17 15:46:25,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 425 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:46:25,960 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 28 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:46:25,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 673 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:46:25,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2021-12-17 15:46:26,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4938. [2021-12-17 15:46:26,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4938 states, 4060 states have (on average 1.2147783251231528) internal successors, (4932), 4096 states have internal predecessors, (4932), 595 states have call successors, (595), 282 states have call predecessors, (595), 282 states have return successors, (595), 559 states have call predecessors, (595), 595 states have call successors, (595) [2021-12-17 15:46:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4938 states to 4938 states and 6122 transitions. [2021-12-17 15:46:26,282 INFO L78 Accepts]: Start accepts. Automaton has 4938 states and 6122 transitions. Word has length 364 [2021-12-17 15:46:26,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:46:26,282 INFO L470 AbstractCegarLoop]: Abstraction has 4938 states and 6122 transitions. [2021-12-17 15:46:26,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-17 15:46:26,282 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 6122 transitions. [2021-12-17 15:46:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2021-12-17 15:46:26,291 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:46:26,291 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:46:26,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-12-17 15:46:26,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:46:26,508 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:46:26,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:46:26,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1856237863, now seen corresponding path program 1 times [2021-12-17 15:46:26,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:46:26,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394194414] [2021-12-17 15:46:26,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:46:26,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:46:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:46:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:46:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:46:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:46:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:46:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:46:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:46:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:46:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:46:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:46:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:46:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:46:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:46:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:46:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:46:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:46:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:46:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-17 15:46:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-17 15:46:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-17 15:46:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-17 15:46:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-17 15:46:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-12-17 15:46:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-12-17 15:46:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-17 15:46:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-17 15:46:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2021-12-17 15:46:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2021-12-17 15:46:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-12-17 15:46:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2021-12-17 15:46:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2021-12-17 15:46:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2021-12-17 15:46:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 987 trivial. 0 not checked. [2021-12-17 15:46:26,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:46:26,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394194414] [2021-12-17 15:46:26,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394194414] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:46:26,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:46:26,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 15:46:26,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442312428] [2021-12-17 15:46:26,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:46:26,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:46:26,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:46:26,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:46:26,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:46:26,624 INFO L87 Difference]: Start difference. First operand 4938 states and 6122 transitions. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 5 states have internal predecessors, (120), 4 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2021-12-17 15:46:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:46:27,224 INFO L93 Difference]: Finished difference Result 9449 states and 11759 transitions. [2021-12-17 15:46:27,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 15:46:27,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 5 states have internal predecessors, (120), 4 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 371 [2021-12-17 15:46:27,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:46:27,234 INFO L225 Difference]: With dead ends: 9449 [2021-12-17 15:46:27,234 INFO L226 Difference]: Without dead ends: 4941 [2021-12-17 15:46:27,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:46:27,240 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 377 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:46:27,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 496 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:46:27,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4941 states. [2021-12-17 15:46:27,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4941 to 4940. [2021-12-17 15:46:27,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4940 states, 4062 states have (on average 1.2117183653372723) internal successors, (4922), 4098 states have internal predecessors, (4922), 595 states have call successors, (595), 282 states have call predecessors, (595), 282 states have return successors, (595), 559 states have call predecessors, (595), 595 states have call successors, (595) [2021-12-17 15:46:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4940 states to 4940 states and 6112 transitions. [2021-12-17 15:46:27,558 INFO L78 Accepts]: Start accepts. Automaton has 4940 states and 6112 transitions. Word has length 371 [2021-12-17 15:46:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:46:27,558 INFO L470 AbstractCegarLoop]: Abstraction has 4940 states and 6112 transitions. [2021-12-17 15:46:27,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 5 states have internal predecessors, (120), 4 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2021-12-17 15:46:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 4940 states and 6112 transitions. [2021-12-17 15:46:27,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2021-12-17 15:46:27,566 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:46:27,567 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:46:27,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-12-17 15:46:27,567 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:46:27,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:46:27,567 INFO L85 PathProgramCache]: Analyzing trace with hash -867693373, now seen corresponding path program 1 times [2021-12-17 15:46:27,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:46:27,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357587695] [2021-12-17 15:46:27,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:46:27,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:46:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:46:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:46:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:46:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:46:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:46:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:46:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:46:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:46:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:46:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:46:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:46:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:46:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:46:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:46:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:46:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:46:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:46:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-17 15:46:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-17 15:46:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-17 15:46:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-12-17 15:46:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-17 15:46:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-17 15:46:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-17 15:46:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-17 15:46:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-17 15:46:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-17 15:46:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2021-12-17 15:46:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2021-12-17 15:46:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2021-12-17 15:46:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2021-12-17 15:46:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2021-12-17 15:46:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 22 proven. 36 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2021-12-17 15:46:27,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:46:27,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357587695] [2021-12-17 15:46:27,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357587695] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:46:27,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894101298] [2021-12-17 15:46:27,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:46:27,870 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:46:27,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:46:27,871 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:46:27,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-17 15:46:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:28,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 1331 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-17 15:46:28,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:46:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 482 proven. 210 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2021-12-17 15:46:29,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:46:30,841 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-17 15:46:30,842 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:46:30,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2021-12-17 15:46:30,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466993403] [2021-12-17 15:46:30,842 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-17 15:46:30,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-17 15:46:30,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:46:30,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-17 15:46:30,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=3448, Unknown=0, NotChecked=0, Total=3660 [2021-12-17 15:46:30,843 INFO L87 Difference]: Start difference. First operand 4940 states and 6112 transitions. Second operand has 23 states, 23 states have (on average 5.956521739130435) internal successors, (137), 20 states have internal predecessors, (137), 8 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 10 states have call predecessors, (24), 8 states have call successors, (24) [2021-12-17 15:46:34,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:46:34,793 INFO L93 Difference]: Finished difference Result 15617 states and 20050 transitions. [2021-12-17 15:46:34,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-12-17 15:46:34,794 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.956521739130435) internal successors, (137), 20 states have internal predecessors, (137), 8 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 10 states have call predecessors, (24), 8 states have call successors, (24) Word has length 372 [2021-12-17 15:46:34,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:46:34,814 INFO L225 Difference]: With dead ends: 15617 [2021-12-17 15:46:34,814 INFO L226 Difference]: Without dead ends: 11559 [2021-12-17 15:46:34,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 713 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3305 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1086, Invalid=15426, Unknown=0, NotChecked=0, Total=16512 [2021-12-17 15:46:34,824 INFO L933 BasicCegarLoop]: 617 mSDtfsCounter, 2023 mSDsluCounter, 7413 mSDsCounter, 0 mSdLazyCounter, 5958 mSolverCounterSat, 635 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2039 SdHoareTripleChecker+Valid, 8030 SdHoareTripleChecker+Invalid, 6593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 635 IncrementalHoareTripleChecker+Valid, 5958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-17 15:46:34,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2039 Valid, 8030 Invalid, 6593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [635 Valid, 5958 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-17 15:46:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11559 states. [2021-12-17 15:46:35,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11559 to 4938. [2021-12-17 15:46:35,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4938 states, 4060 states have (on average 1.2118226600985222) internal successors, (4920), 4096 states have internal predecessors, (4920), 595 states have call successors, (595), 282 states have call predecessors, (595), 282 states have return successors, (595), 559 states have call predecessors, (595), 595 states have call successors, (595) [2021-12-17 15:46:35,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4938 states to 4938 states and 6110 transitions. [2021-12-17 15:46:35,402 INFO L78 Accepts]: Start accepts. Automaton has 4938 states and 6110 transitions. Word has length 372 [2021-12-17 15:46:35,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:46:35,402 INFO L470 AbstractCegarLoop]: Abstraction has 4938 states and 6110 transitions. [2021-12-17 15:46:35,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.956521739130435) internal successors, (137), 20 states have internal predecessors, (137), 8 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 10 states have call predecessors, (24), 8 states have call successors, (24) [2021-12-17 15:46:35,403 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 6110 transitions. [2021-12-17 15:46:35,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2021-12-17 15:46:35,411 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:46:35,411 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:46:35,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-17 15:46:35,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:46:35,629 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:46:35,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:46:35,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2019547973, now seen corresponding path program 1 times [2021-12-17 15:46:35,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:46:35,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210325649] [2021-12-17 15:46:35,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:46:35,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:46:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:46:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:46:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:46:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:46:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:46:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:46:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:46:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:46:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:46:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:46:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:46:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:46:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:46:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:46:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:46:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:46:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:46:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-17 15:46:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-17 15:46:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-17 15:46:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-12-17 15:46:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-17 15:46:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-17 15:46:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-17 15:46:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-17 15:46:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-17 15:46:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-17 15:46:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2021-12-17 15:46:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2021-12-17 15:46:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2021-12-17 15:46:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2021-12-17 15:46:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2021-12-17 15:46:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 997 trivial. 0 not checked. [2021-12-17 15:46:35,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:46:35,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210325649] [2021-12-17 15:46:35,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210325649] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:46:35,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:46:35,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 15:46:35,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724597527] [2021-12-17 15:46:35,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:46:35,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:46:35,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:46:35,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:46:35,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:46:35,727 INFO L87 Difference]: Start difference. First operand 4938 states and 6110 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-17 15:46:36,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:46:36,227 INFO L93 Difference]: Finished difference Result 9058 states and 11268 transitions. [2021-12-17 15:46:36,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 15:46:36,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 372 [2021-12-17 15:46:36,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:46:36,242 INFO L225 Difference]: With dead ends: 9058 [2021-12-17 15:46:36,243 INFO L226 Difference]: Without dead ends: 4740 [2021-12-17 15:46:36,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:46:36,250 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 51 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:46:36,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 563 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 15:46:36,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4740 states. [2021-12-17 15:46:36,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4740 to 4740. [2021-12-17 15:46:36,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4740 states, 3894 states have (on average 1.2123780174627632) internal successors, (4721), 3930 states have internal predecessors, (4721), 576 states have call successors, (576), 269 states have call predecessors, (576), 269 states have return successors, (576), 540 states have call predecessors, (576), 576 states have call successors, (576) [2021-12-17 15:46:36,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4740 states to 4740 states and 5873 transitions. [2021-12-17 15:46:36,690 INFO L78 Accepts]: Start accepts. Automaton has 4740 states and 5873 transitions. Word has length 372 [2021-12-17 15:46:36,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:46:36,691 INFO L470 AbstractCegarLoop]: Abstraction has 4740 states and 5873 transitions. [2021-12-17 15:46:36,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-17 15:46:36,691 INFO L276 IsEmpty]: Start isEmpty. Operand 4740 states and 5873 transitions. [2021-12-17 15:46:36,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2021-12-17 15:46:36,697 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:46:36,698 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:46:36,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-12-17 15:46:36,698 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:46:36,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:46:36,698 INFO L85 PathProgramCache]: Analyzing trace with hash -613566989, now seen corresponding path program 1 times [2021-12-17 15:46:36,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:46:36,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118218714] [2021-12-17 15:46:36,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:46:36,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:46:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:46:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:46:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:46:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:46:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:46:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:46:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:46:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:46:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:46:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:46:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:46:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:46:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:46:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:46:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:46:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:46:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:46:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-17 15:46:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-17 15:46:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-17 15:46:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-12-17 15:46:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-17 15:46:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-17 15:46:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-17 15:46:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-17 15:46:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-17 15:46:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-17 15:46:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2021-12-17 15:46:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2021-12-17 15:46:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2021-12-17 15:46:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2021-12-17 15:46:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2021-12-17 15:46:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 50 proven. 51 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2021-12-17 15:46:36,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:46:36,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118218714] [2021-12-17 15:46:36,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118218714] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:46:36,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568561921] [2021-12-17 15:46:36,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:46:36,908 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:46:36,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:46:36,909 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:46:36,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-17 15:46:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:37,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-17 15:46:37,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:46:38,414 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 473 proven. 210 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2021-12-17 15:46:38,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:46:39,244 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-17 15:46:39,245 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:46:39,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-12-17 15:46:39,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200980066] [2021-12-17 15:46:39,245 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-17 15:46:39,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 15:46:39,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:46:39,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 15:46:39,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2549, Unknown=0, NotChecked=0, Total=2756 [2021-12-17 15:46:39,247 INFO L87 Difference]: Start difference. First operand 4740 states and 5873 transitions. Second operand has 15 states, 15 states have (on average 10.0) internal successors, (150), 12 states have internal predecessors, (150), 5 states have call successors, (25), 3 states have call predecessors, (25), 6 states have return successors, (24), 6 states have call predecessors, (24), 4 states have call successors, (24) [2021-12-17 15:46:42,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:46:42,814 INFO L93 Difference]: Finished difference Result 20267 states and 25641 transitions. [2021-12-17 15:46:42,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-17 15:46:42,815 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.0) internal successors, (150), 12 states have internal predecessors, (150), 5 states have call successors, (25), 3 states have call predecessors, (25), 6 states have return successors, (24), 6 states have call predecessors, (24), 4 states have call successors, (24) Word has length 372 [2021-12-17 15:46:42,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:46:42,841 INFO L225 Difference]: With dead ends: 20267 [2021-12-17 15:46:42,841 INFO L226 Difference]: Without dead ends: 16217 [2021-12-17 15:46:42,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 727 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1786 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=749, Invalid=7441, Unknown=0, NotChecked=0, Total=8190 [2021-12-17 15:46:42,849 INFO L933 BasicCegarLoop]: 461 mSDtfsCounter, 991 mSDsluCounter, 3937 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 4398 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:46:42,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1026 Valid, 4398 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 2591 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-17 15:46:42,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16217 states. [2021-12-17 15:46:43,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16217 to 8170. [2021-12-17 15:46:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8170 states, 6587 states have (on average 1.2125398512221042) internal successors, (7987), 6659 states have internal predecessors, (7987), 1097 states have call successors, (1097), 485 states have call predecessors, (1097), 485 states have return successors, (1097), 1025 states have call predecessors, (1097), 1097 states have call successors, (1097) [2021-12-17 15:46:43,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8170 states to 8170 states and 10181 transitions. [2021-12-17 15:46:43,538 INFO L78 Accepts]: Start accepts. Automaton has 8170 states and 10181 transitions. Word has length 372 [2021-12-17 15:46:43,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:46:43,539 INFO L470 AbstractCegarLoop]: Abstraction has 8170 states and 10181 transitions. [2021-12-17 15:46:43,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.0) internal successors, (150), 12 states have internal predecessors, (150), 5 states have call successors, (25), 3 states have call predecessors, (25), 6 states have return successors, (24), 6 states have call predecessors, (24), 4 states have call successors, (24) [2021-12-17 15:46:43,539 INFO L276 IsEmpty]: Start isEmpty. Operand 8170 states and 10181 transitions. [2021-12-17 15:46:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2021-12-17 15:46:43,549 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:46:43,549 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:46:43,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-17 15:46:43,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:46:43,761 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:46:43,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:46:43,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1281003475, now seen corresponding path program 1 times [2021-12-17 15:46:43,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:46:43,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425102981] [2021-12-17 15:46:43,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:46:43,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:46:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:46:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:46:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:46:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:46:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:46:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:46:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:46:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:46:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:46:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:46:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:46:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:46:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:46:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:46:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:46:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:46:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:46:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-17 15:46:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-17 15:46:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-17 15:46:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-12-17 15:46:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-17 15:46:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-17 15:46:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-17 15:46:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-17 15:46:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-17 15:46:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-17 15:46:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2021-12-17 15:46:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2021-12-17 15:46:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2021-12-17 15:46:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2021-12-17 15:46:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2021-12-17 15:46:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:43,988 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 34 proven. 66 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2021-12-17 15:46:43,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:46:43,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425102981] [2021-12-17 15:46:43,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425102981] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:46:43,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866747455] [2021-12-17 15:46:43,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:46:43,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:46:43,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:46:43,990 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:46:43,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-17 15:46:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:44,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 1331 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-17 15:46:44,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:46:45,446 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 476 proven. 210 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2021-12-17 15:46:45,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:46:46,195 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-17 15:46:46,195 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:46:46,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-12-17 15:46:46,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084806181] [2021-12-17 15:46:46,195 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-17 15:46:46,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 15:46:46,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:46:46,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 15:46:46,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=2535, Unknown=0, NotChecked=0, Total=2756 [2021-12-17 15:46:46,197 INFO L87 Difference]: Start difference. First operand 8170 states and 10181 transitions. Second operand has 15 states, 15 states have (on average 9.8) internal successors, (147), 12 states have internal predecessors, (147), 5 states have call successors, (25), 3 states have call predecessors, (25), 6 states have return successors, (24), 7 states have call predecessors, (24), 5 states have call successors, (24) [2021-12-17 15:46:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:46:48,462 INFO L93 Difference]: Finished difference Result 16226 states and 20311 transitions. [2021-12-17 15:46:48,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-12-17 15:46:48,462 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.8) internal successors, (147), 12 states have internal predecessors, (147), 5 states have call successors, (25), 3 states have call predecessors, (25), 6 states have return successors, (24), 7 states have call predecessors, (24), 5 states have call successors, (24) Word has length 372 [2021-12-17 15:46:48,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:46:48,482 INFO L225 Difference]: With dead ends: 16226 [2021-12-17 15:46:48,482 INFO L226 Difference]: Without dead ends: 8828 [2021-12-17 15:46:48,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 707 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=863, Invalid=6793, Unknown=0, NotChecked=0, Total=7656 [2021-12-17 15:46:48,497 INFO L933 BasicCegarLoop]: 632 mSDtfsCounter, 928 mSDsluCounter, 4320 mSDsCounter, 0 mSdLazyCounter, 2222 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 4952 SdHoareTripleChecker+Invalid, 2519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 2222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-17 15:46:48,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [964 Valid, 4952 Invalid, 2519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 2222 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-17 15:46:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8828 states. [2021-12-17 15:46:49,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8828 to 6866. [2021-12-17 15:46:49,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6866 states, 5559 states have (on average 1.2137075013491636) internal successors, (6747), 5619 states have internal predecessors, (6747), 893 states have call successors, (893), 413 states have call predecessors, (893), 413 states have return successors, (893), 833 states have call predecessors, (893), 893 states have call successors, (893) [2021-12-17 15:46:49,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6866 states to 6866 states and 8533 transitions. [2021-12-17 15:46:49,193 INFO L78 Accepts]: Start accepts. Automaton has 6866 states and 8533 transitions. Word has length 372 [2021-12-17 15:46:49,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:46:49,194 INFO L470 AbstractCegarLoop]: Abstraction has 6866 states and 8533 transitions. [2021-12-17 15:46:49,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.8) internal successors, (147), 12 states have internal predecessors, (147), 5 states have call successors, (25), 3 states have call predecessors, (25), 6 states have return successors, (24), 7 states have call predecessors, (24), 5 states have call successors, (24) [2021-12-17 15:46:49,194 INFO L276 IsEmpty]: Start isEmpty. Operand 6866 states and 8533 transitions. [2021-12-17 15:46:49,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2021-12-17 15:46:49,200 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:46:49,200 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:46:49,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-12-17 15:46:49,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:46:49,417 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:46:49,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:46:49,418 INFO L85 PathProgramCache]: Analyzing trace with hash 128225979, now seen corresponding path program 1 times [2021-12-17 15:46:49,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:46:49,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744083267] [2021-12-17 15:46:49,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:46:49,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:46:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:46:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:46:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:46:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:46:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:46:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:46:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:46:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:46:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:46:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:46:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:46:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:46:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:46:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:46:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:46:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:46:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:46:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-17 15:46:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-12-17 15:46:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-17 15:46:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-12-17 15:46:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-17 15:46:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-17 15:46:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-17 15:46:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-17 15:46:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-17 15:46:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-17 15:46:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2021-12-17 15:46:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2021-12-17 15:46:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2021-12-17 15:46:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2021-12-17 15:46:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2021-12-17 15:46:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2021-12-17 15:46:49,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:46:49,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744083267] [2021-12-17 15:46:49,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744083267] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:46:49,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127244591] [2021-12-17 15:46:49,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:46:49,677 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:46:49,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:46:49,678 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:46:49,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-17 15:46:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:46:49,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-17 15:46:49,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:46:51,233 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 473 proven. 210 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2021-12-17 15:46:51,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:46:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 103 proven. 194 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2021-12-17 15:46:52,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127244591] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 15:46:52,608 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 15:46:52,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26, 21] total 57 [2021-12-17 15:46:52,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723671963] [2021-12-17 15:46:52,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 15:46:52,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2021-12-17 15:46:52,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:46:52,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-12-17 15:46:52,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2977, Unknown=0, NotChecked=0, Total=3192 [2021-12-17 15:46:52,610 INFO L87 Difference]: Start difference. First operand 6866 states and 8533 transitions. Second operand has 57 states, 57 states have (on average 6.9298245614035086) internal successors, (395), 49 states have internal predecessors, (395), 18 states have call successors, (67), 13 states have call predecessors, (67), 19 states have return successors, (70), 23 states have call predecessors, (70), 18 states have call successors, (70) [2021-12-17 15:47:24,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:47:24,318 INFO L93 Difference]: Finished difference Result 46381 states and 63115 transitions. [2021-12-17 15:47:24,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 259 states. [2021-12-17 15:47:24,319 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 6.9298245614035086) internal successors, (395), 49 states have internal predecessors, (395), 18 states have call successors, (67), 13 states have call predecessors, (67), 19 states have return successors, (70), 23 states have call predecessors, (70), 18 states have call successors, (70) Word has length 372 [2021-12-17 15:47:24,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:47:24,404 INFO L225 Difference]: With dead ends: 46381 [2021-12-17 15:47:24,405 INFO L226 Difference]: Without dead ends: 40010 [2021-12-17 15:47:24,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1092 GetRequests, 780 SyntacticMatches, 1 SemanticMatches, 311 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34839 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=6828, Invalid=90828, Unknown=0, NotChecked=0, Total=97656 [2021-12-17 15:47:24,423 INFO L933 BasicCegarLoop]: 1800 mSDtfsCounter, 3060 mSDsluCounter, 53647 mSDsCounter, 0 mSdLazyCounter, 45473 mSolverCounterSat, 2851 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3074 SdHoareTripleChecker+Valid, 55447 SdHoareTripleChecker+Invalid, 48324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 2851 IncrementalHoareTripleChecker+Valid, 45473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2021-12-17 15:47:24,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3074 Valid, 55447 Invalid, 48324 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [2851 Valid, 45473 Invalid, 0 Unknown, 0 Unchecked, 17.6s Time] [2021-12-17 15:47:24,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40010 states. [2021-12-17 15:47:25,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40010 to 6902. [2021-12-17 15:47:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6902 states, 5594 states have (on average 1.2143367894172328) internal successors, (6793), 5654 states have internal predecessors, (6793), 893 states have call successors, (893), 414 states have call predecessors, (893), 414 states have return successors, (893), 833 states have call predecessors, (893), 893 states have call successors, (893) [2021-12-17 15:47:25,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6902 states to 6902 states and 8579 transitions. [2021-12-17 15:47:25,376 INFO L78 Accepts]: Start accepts. Automaton has 6902 states and 8579 transitions. Word has length 372 [2021-12-17 15:47:25,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:47:25,377 INFO L470 AbstractCegarLoop]: Abstraction has 6902 states and 8579 transitions. [2021-12-17 15:47:25,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 6.9298245614035086) internal successors, (395), 49 states have internal predecessors, (395), 18 states have call successors, (67), 13 states have call predecessors, (67), 19 states have return successors, (70), 23 states have call predecessors, (70), 18 states have call successors, (70) [2021-12-17 15:47:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 6902 states and 8579 transitions. [2021-12-17 15:47:25,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2021-12-17 15:47:25,383 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:47:25,383 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:47:25,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-12-17 15:47:25,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-12-17 15:47:25,586 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:47:25,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:47:25,587 INFO L85 PathProgramCache]: Analyzing trace with hash 401651358, now seen corresponding path program 1 times [2021-12-17 15:47:25,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:47:25,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358553391] [2021-12-17 15:47:25,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:47:25,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:47:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:47:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:47:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:47:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:47:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:47:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:47:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:47:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:47:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:47:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:47:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:47:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:47:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:47:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:47:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:47:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:47:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:47:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-17 15:47:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-12-17 15:47:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-17 15:47:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-12-17 15:47:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-17 15:47:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-17 15:47:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-12-17 15:47:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-12-17 15:47:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-17 15:47:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-12-17 15:47:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-12-17 15:47:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-12-17 15:47:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-12-17 15:47:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2021-12-17 15:47:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2021-12-17 15:47:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2021-12-17 15:47:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:25,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [2021-12-17 15:47:25,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:47:25,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358553391] [2021-12-17 15:47:25,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358553391] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:47:25,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:47:25,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 15:47:25,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899642593] [2021-12-17 15:47:25,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:47:25,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:47:25,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:47:25,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:47:25,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:47:25,747 INFO L87 Difference]: Start difference. First operand 6902 states and 8579 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 4 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2021-12-17 15:47:26,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:47:26,647 INFO L93 Difference]: Finished difference Result 13488 states and 16805 transitions. [2021-12-17 15:47:26,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 15:47:26,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 4 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 383 [2021-12-17 15:47:26,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:47:26,661 INFO L225 Difference]: With dead ends: 13488 [2021-12-17 15:47:26,661 INFO L226 Difference]: Without dead ends: 6920 [2021-12-17 15:47:26,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:47:26,670 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 269 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:47:26,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 463 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:47:26,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6920 states. [2021-12-17 15:47:27,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6920 to 6872. [2021-12-17 15:47:27,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6872 states, 5564 states have (on average 1.2127965492451473) internal successors, (6748), 5624 states have internal predecessors, (6748), 893 states have call successors, (893), 414 states have call predecessors, (893), 414 states have return successors, (893), 833 states have call predecessors, (893), 893 states have call successors, (893) [2021-12-17 15:47:27,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6872 states to 6872 states and 8534 transitions. [2021-12-17 15:47:27,327 INFO L78 Accepts]: Start accepts. Automaton has 6872 states and 8534 transitions. Word has length 383 [2021-12-17 15:47:27,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:47:27,327 INFO L470 AbstractCegarLoop]: Abstraction has 6872 states and 8534 transitions. [2021-12-17 15:47:27,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 4 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2021-12-17 15:47:27,328 INFO L276 IsEmpty]: Start isEmpty. Operand 6872 states and 8534 transitions. [2021-12-17 15:47:27,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2021-12-17 15:47:27,336 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:47:27,336 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:47:27,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-12-17 15:47:27,337 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:47:27,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:47:27,337 INFO L85 PathProgramCache]: Analyzing trace with hash 872240243, now seen corresponding path program 1 times [2021-12-17 15:47:27,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:47:27,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118673530] [2021-12-17 15:47:27,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:47:27,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:47:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:47:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:47:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:47:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:47:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:47:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:47:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:47:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:47:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:47:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:47:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:47:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:47:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:47:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:47:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:47:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:47:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:47:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-17 15:47:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-17 15:47:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-17 15:47:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-17 15:47:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-17 15:47:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-17 15:47:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-12-17 15:47:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-17 15:47:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2021-12-17 15:47:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2021-12-17 15:47:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-12-17 15:47:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-12-17 15:47:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-12-17 15:47:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-12-17 15:47:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2021-12-17 15:47:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-12-17 15:47:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2021-12-17 15:47:27,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:47:27,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118673530] [2021-12-17 15:47:27,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118673530] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:47:27,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134725123] [2021-12-17 15:47:27,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:47:27,597 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:47:27,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:47:27,598 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:47:27,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-17 15:47:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:47:27,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-17 15:47:27,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:47:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 542 proven. 221 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-12-17 15:47:29,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:47:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 157 proven. 149 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2021-12-17 15:47:30,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134725123] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 15:47:30,440 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 15:47:30,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25, 20] total 55 [2021-12-17 15:47:30,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604080410] [2021-12-17 15:47:30,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 15:47:30,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-17 15:47:30,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:47:30,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-17 15:47:30,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2769, Unknown=0, NotChecked=0, Total=2970 [2021-12-17 15:47:30,442 INFO L87 Difference]: Start difference. First operand 6872 states and 8534 transitions. Second operand has 55 states, 55 states have (on average 7.345454545454546) internal successors, (404), 47 states have internal predecessors, (404), 18 states have call successors, (70), 11 states have call predecessors, (70), 20 states have return successors, (71), 22 states have call predecessors, (71), 18 states have call successors, (71) [2021-12-17 15:48:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:48:03,734 INFO L93 Difference]: Finished difference Result 46828 states and 63651 transitions. [2021-12-17 15:48:03,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 269 states. [2021-12-17 15:48:03,735 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 7.345454545454546) internal successors, (404), 47 states have internal predecessors, (404), 18 states have call successors, (70), 11 states have call predecessors, (70), 20 states have return successors, (71), 22 states have call predecessors, (71), 18 states have call successors, (71) Word has length 384 [2021-12-17 15:48:03,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:48:03,814 INFO L225 Difference]: With dead ends: 46828 [2021-12-17 15:48:03,815 INFO L226 Difference]: Without dead ends: 40457 [2021-12-17 15:48:03,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1130 GetRequests, 810 SyntacticMatches, 1 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37396 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=6871, Invalid=95849, Unknown=0, NotChecked=0, Total=102720 [2021-12-17 15:48:03,845 INFO L933 BasicCegarLoop]: 1710 mSDtfsCounter, 3091 mSDsluCounter, 50711 mSDsCounter, 0 mSdLazyCounter, 43800 mSolverCounterSat, 2509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3106 SdHoareTripleChecker+Valid, 52421 SdHoareTripleChecker+Invalid, 46309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 2509 IncrementalHoareTripleChecker+Valid, 43800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2021-12-17 15:48:03,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3106 Valid, 52421 Invalid, 46309 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [2509 Valid, 43800 Invalid, 0 Unknown, 0 Unchecked, 17.9s Time] [2021-12-17 15:48:03,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40457 states. [2021-12-17 15:48:05,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40457 to 6909. [2021-12-17 15:48:05,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6909 states, 5600 states have (on average 1.2133928571428572) internal successors, (6795), 5660 states have internal predecessors, (6795), 893 states have call successors, (893), 415 states have call predecessors, (893), 415 states have return successors, (893), 833 states have call predecessors, (893), 893 states have call successors, (893) [2021-12-17 15:48:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6909 states to 6909 states and 8581 transitions. [2021-12-17 15:48:05,045 INFO L78 Accepts]: Start accepts. Automaton has 6909 states and 8581 transitions. Word has length 384 [2021-12-17 15:48:05,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:48:05,045 INFO L470 AbstractCegarLoop]: Abstraction has 6909 states and 8581 transitions. [2021-12-17 15:48:05,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 7.345454545454546) internal successors, (404), 47 states have internal predecessors, (404), 18 states have call successors, (70), 11 states have call predecessors, (70), 20 states have return successors, (71), 22 states have call predecessors, (71), 18 states have call successors, (71) [2021-12-17 15:48:05,046 INFO L276 IsEmpty]: Start isEmpty. Operand 6909 states and 8581 transitions. [2021-12-17 15:48:05,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2021-12-17 15:48:05,053 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:48:05,053 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:48:05,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-12-17 15:48:05,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:48:05,272 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:48:05,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:48:05,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1134784194, now seen corresponding path program 1 times [2021-12-17 15:48:05,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:48:05,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781509585] [2021-12-17 15:48:05,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:48:05,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:48:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:48:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:48:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:48:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:48:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:48:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:48:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:48:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:48:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:48:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:48:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:48:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:48:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:48:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:48:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:48:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:48:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:48:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-17 15:48:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-17 15:48:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-17 15:48:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-17 15:48:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-17 15:48:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-17 15:48:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-12-17 15:48:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2021-12-17 15:48:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2021-12-17 15:48:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-17 15:48:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2021-12-17 15:48:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2021-12-17 15:48:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2021-12-17 15:48:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-12-17 15:48:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2021-12-17 15:48:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-12-17 15:48:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2021-12-17 15:48:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2021-12-17 15:48:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2021-12-17 15:48:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:05,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1185 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1177 trivial. 0 not checked. [2021-12-17 15:48:05,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:48:05,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781509585] [2021-12-17 15:48:05,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781509585] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:48:05,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:48:05,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 15:48:05,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869383868] [2021-12-17 15:48:05,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:48:05,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:48:05,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:48:05,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:48:05,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:48:05,400 INFO L87 Difference]: Start difference. First operand 6909 states and 8581 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 5 states have internal predecessors, (134), 4 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2021-12-17 15:48:06,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:48:06,454 INFO L93 Difference]: Finished difference Result 13495 states and 16804 transitions. [2021-12-17 15:48:06,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 15:48:06,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 5 states have internal predecessors, (134), 4 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 410 [2021-12-17 15:48:06,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:48:06,471 INFO L225 Difference]: With dead ends: 13495 [2021-12-17 15:48:06,471 INFO L226 Difference]: Without dead ends: 6927 [2021-12-17 15:48:06,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:48:06,482 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 368 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:48:06,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 497 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:48:06,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6927 states. [2021-12-17 15:48:07,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6927 to 6879. [2021-12-17 15:48:07,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6879 states, 5570 states have (on average 1.2118491921005385) internal successors, (6750), 5630 states have internal predecessors, (6750), 893 states have call successors, (893), 415 states have call predecessors, (893), 415 states have return successors, (893), 833 states have call predecessors, (893), 893 states have call successors, (893) [2021-12-17 15:48:07,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6879 states to 6879 states and 8536 transitions. [2021-12-17 15:48:07,377 INFO L78 Accepts]: Start accepts. Automaton has 6879 states and 8536 transitions. Word has length 410 [2021-12-17 15:48:07,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:48:07,377 INFO L470 AbstractCegarLoop]: Abstraction has 6879 states and 8536 transitions. [2021-12-17 15:48:07,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 5 states have internal predecessors, (134), 4 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2021-12-17 15:48:07,378 INFO L276 IsEmpty]: Start isEmpty. Operand 6879 states and 8536 transitions. [2021-12-17 15:48:07,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2021-12-17 15:48:07,386 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:48:07,386 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:48:07,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-12-17 15:48:07,386 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:48:07,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:48:07,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1335322434, now seen corresponding path program 1 times [2021-12-17 15:48:07,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:48:07,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362053099] [2021-12-17 15:48:07,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:48:07,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:48:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:48:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:48:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:48:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:48:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:48:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:48:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:48:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:48:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:48:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:48:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:48:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:48:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:48:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:48:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:48:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:48:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:48:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-17 15:48:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-17 15:48:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-17 15:48:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-17 15:48:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-17 15:48:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-17 15:48:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-12-17 15:48:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2021-12-17 15:48:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2021-12-17 15:48:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-17 15:48:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2021-12-17 15:48:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2021-12-17 15:48:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2021-12-17 15:48:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-12-17 15:48:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2021-12-17 15:48:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-12-17 15:48:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2021-12-17 15:48:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2021-12-17 15:48:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2021-12-17 15:48:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1185 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1177 trivial. 0 not checked. [2021-12-17 15:48:07,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:48:07,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362053099] [2021-12-17 15:48:07,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362053099] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:48:07,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:48:07,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 15:48:07,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066143265] [2021-12-17 15:48:07,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:48:07,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:48:07,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:48:07,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:48:07,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:48:07,499 INFO L87 Difference]: Start difference. First operand 6879 states and 8536 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-12-17 15:48:08,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:48:08,071 INFO L93 Difference]: Finished difference Result 10386 states and 12910 transitions. [2021-12-17 15:48:08,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 15:48:08,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 410 [2021-12-17 15:48:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:48:08,079 INFO L225 Difference]: With dead ends: 10386 [2021-12-17 15:48:08,080 INFO L226 Difference]: Without dead ends: 3832 [2021-12-17 15:48:08,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:48:08,088 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 51 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:48:08,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 554 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 15:48:08,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3832 states. [2021-12-17 15:48:08,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3832 to 3832. [2021-12-17 15:48:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3832 states, 3104 states have (on average 1.202319587628866) internal successors, (3732), 3136 states have internal predecessors, (3732), 494 states have call successors, (494), 233 states have call predecessors, (494), 233 states have return successors, (494), 462 states have call predecessors, (494), 494 states have call successors, (494) [2021-12-17 15:48:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3832 states to 3832 states and 4720 transitions. [2021-12-17 15:48:08,610 INFO L78 Accepts]: Start accepts. Automaton has 3832 states and 4720 transitions. Word has length 410 [2021-12-17 15:48:08,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:48:08,610 INFO L470 AbstractCegarLoop]: Abstraction has 3832 states and 4720 transitions. [2021-12-17 15:48:08,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-12-17 15:48:08,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3832 states and 4720 transitions. [2021-12-17 15:48:08,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2021-12-17 15:48:08,615 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:48:08,615 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 11, 9, 8, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-17 15:48:08,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-12-17 15:48:08,615 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:48:08,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:48:08,616 INFO L85 PathProgramCache]: Analyzing trace with hash -968340573, now seen corresponding path program 1 times [2021-12-17 15:48:08,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:48:08,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858954909] [2021-12-17 15:48:08,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:48:08,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:48:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:48:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:48:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:48:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:48:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:48:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:48:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:48:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:48:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:48:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:48:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:48:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:48:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:48:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:48:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:48:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:48:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:48:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-17 15:48:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-17 15:48:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-17 15:48:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-17 15:48:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-17 15:48:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2021-12-17 15:48:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-12-17 15:48:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-17 15:48:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-17 15:48:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2021-12-17 15:48:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2021-12-17 15:48:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-12-17 15:48:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-12-17 15:48:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2021-12-17 15:48:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2021-12-17 15:48:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2021-12-17 15:48:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-12-17 15:48:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2021-12-17 15:48:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2021-12-17 15:48:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2021-12-17 15:48:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 39 proven. 4 refuted. 0 times theorem prover too weak. 1182 trivial. 0 not checked. [2021-12-17 15:48:08,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:48:08,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858954909] [2021-12-17 15:48:08,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858954909] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:48:08,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5896390] [2021-12-17 15:48:08,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:48:08,755 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:48:08,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:48:08,772 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:48:08,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-17 15:48:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:08,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 1465 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 15:48:08,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:48:09,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 187 proven. 367 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2021-12-17 15:48:09,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:48:10,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 23 proven. 33 refuted. 0 times theorem prover too weak. 1169 trivial. 0 not checked. [2021-12-17 15:48:10,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5896390] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 15:48:10,227 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 15:48:10,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 20 [2021-12-17 15:48:10,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139783605] [2021-12-17 15:48:10,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 15:48:10,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-17 15:48:10,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:48:10,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-17 15:48:10,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2021-12-17 15:48:10,229 INFO L87 Difference]: Start difference. First operand 3832 states and 4720 transitions. Second operand has 20 states, 20 states have (on average 15.9) internal successors, (318), 17 states have internal predecessors, (318), 7 states have call successors, (79), 7 states have call predecessors, (79), 9 states have return successors, (78), 9 states have call predecessors, (78), 7 states have call successors, (78) [2021-12-17 15:48:16,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:48:16,529 INFO L93 Difference]: Finished difference Result 18579 states and 23988 transitions. [2021-12-17 15:48:16,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2021-12-17 15:48:16,529 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 15.9) internal successors, (318), 17 states have internal predecessors, (318), 7 states have call successors, (79), 7 states have call predecessors, (79), 9 states have return successors, (78), 9 states have call predecessors, (78), 7 states have call successors, (78) Word has length 413 [2021-12-17 15:48:16,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:48:16,553 INFO L225 Difference]: With dead ends: 18579 [2021-12-17 15:48:16,553 INFO L226 Difference]: Without dead ends: 15377 [2021-12-17 15:48:16,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1044 GetRequests, 933 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4155 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1124, Invalid=11308, Unknown=0, NotChecked=0, Total=12432 [2021-12-17 15:48:16,562 INFO L933 BasicCegarLoop]: 674 mSDtfsCounter, 3043 mSDsluCounter, 7930 mSDsCounter, 0 mSdLazyCounter, 5741 mSolverCounterSat, 1089 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3055 SdHoareTripleChecker+Valid, 8604 SdHoareTripleChecker+Invalid, 6830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1089 IncrementalHoareTripleChecker+Valid, 5741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:48:16,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3055 Valid, 8604 Invalid, 6830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1089 Valid, 5741 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-17 15:48:16,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15377 states. [2021-12-17 15:48:17,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15377 to 5793. [2021-12-17 15:48:17,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5793 states, 4725 states have (on average 1.1845502645502646) internal successors, (5597), 4773 states have internal predecessors, (5597), 702 states have call successors, (702), 365 states have call predecessors, (702), 365 states have return successors, (702), 654 states have call predecessors, (702), 702 states have call successors, (702) [2021-12-17 15:48:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5793 states to 5793 states and 7001 transitions. [2021-12-17 15:48:17,467 INFO L78 Accepts]: Start accepts. Automaton has 5793 states and 7001 transitions. Word has length 413 [2021-12-17 15:48:17,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:48:17,468 INFO L470 AbstractCegarLoop]: Abstraction has 5793 states and 7001 transitions. [2021-12-17 15:48:17,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 15.9) internal successors, (318), 17 states have internal predecessors, (318), 7 states have call successors, (79), 7 states have call predecessors, (79), 9 states have return successors, (78), 9 states have call predecessors, (78), 7 states have call successors, (78) [2021-12-17 15:48:17,468 INFO L276 IsEmpty]: Start isEmpty. Operand 5793 states and 7001 transitions. [2021-12-17 15:48:17,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2021-12-17 15:48:17,473 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:48:17,473 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-17 15:48:17,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-12-17 15:48:17,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:48:17,706 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:48:17,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:48:17,706 INFO L85 PathProgramCache]: Analyzing trace with hash -612309391, now seen corresponding path program 1 times [2021-12-17 15:48:17,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:48:17,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758707742] [2021-12-17 15:48:17,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:48:17,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:48:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:48:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:48:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:48:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 15:48:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:48:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:48:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:48:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-17 15:48:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:48:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:48:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:48:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:48:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 15:48:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:48:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:48:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:48:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-17 15:48:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-17 15:48:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-17 15:48:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-17 15:48:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-17 15:48:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-17 15:48:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-17 15:48:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2021-12-17 15:48:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-17 15:48:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-12-17 15:48:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2021-12-17 15:48:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2021-12-17 15:48:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2021-12-17 15:48:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2021-12-17 15:48:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2021-12-17 15:48:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2021-12-17 15:48:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2021-12-17 15:48:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-12-17 15:48:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2021-12-17 15:48:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2021-12-17 15:48:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2021-12-17 15:48:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:17,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2021-12-17 15:48:17,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:48:17,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758707742] [2021-12-17 15:48:17,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758707742] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:48:17,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080019658] [2021-12-17 15:48:17,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:48:17,851 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:48:17,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:48:17,852 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:48:17,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-17 15:48:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:48:18,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 1475 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-17 15:48:18,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:48:18,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2021-12-17 15:48:18,614 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:48:18,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080019658] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:48:18,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:48:18,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 10 [2021-12-17 15:48:18,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637145587] [2021-12-17 15:48:18,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:48:18,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 15:48:18,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:48:18,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 15:48:18,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-17 15:48:18,616 INFO L87 Difference]: Start difference. First operand 5793 states and 7001 transitions. Second operand has 8 states, 8 states have (on average 19.625) internal successors, (157), 7 states have internal predecessors, (157), 3 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2021-12-17 15:48:20,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:48:20,221 INFO L93 Difference]: Finished difference Result 13295 states and 16427 transitions. [2021-12-17 15:48:20,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 15:48:20,221 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 7 states have internal predecessors, (157), 3 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) Word has length 418 [2021-12-17 15:48:20,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:48:20,236 INFO L225 Difference]: With dead ends: 13295 [2021-12-17 15:48:20,237 INFO L226 Difference]: Without dead ends: 7915 [2021-12-17 15:48:20,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-12-17 15:48:20,245 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 616 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:48:20,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [625 Valid, 1961 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:48:20,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7915 states. [2021-12-17 15:48:21,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7915 to 5673. [2021-12-17 15:48:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5673 states, 4629 states have (on average 1.170447180816591) internal successors, (5418), 4677 states have internal predecessors, (5418), 678 states have call successors, (678), 365 states have call predecessors, (678), 365 states have return successors, (678), 630 states have call predecessors, (678), 678 states have call successors, (678) [2021-12-17 15:48:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5673 states to 5673 states and 6774 transitions. [2021-12-17 15:48:21,143 INFO L78 Accepts]: Start accepts. Automaton has 5673 states and 6774 transitions. Word has length 418 [2021-12-17 15:48:21,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:48:21,144 INFO L470 AbstractCegarLoop]: Abstraction has 5673 states and 6774 transitions. [2021-12-17 15:48:21,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 7 states have internal predecessors, (157), 3 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2021-12-17 15:48:21,144 INFO L276 IsEmpty]: Start isEmpty. Operand 5673 states and 6774 transitions. [2021-12-17 15:48:21,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2021-12-17 15:48:21,150 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:48:21,150 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:48:21,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-12-17 15:48:21,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:48:21,371 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:48:21,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:48:21,371 INFO L85 PathProgramCache]: Analyzing trace with hash -340747451, now seen corresponding path program 1 times [2021-12-17 15:48:21,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:48:21,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907077547] [2021-12-17 15:48:21,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:48:21,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:48:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 15:48:21,401 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 15:48:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 15:48:21,556 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 15:48:21,556 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 15:48:21,557 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 15:48:21,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-12-17 15:48:21,561 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:48:21,565 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 15:48:21,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 03:48:21 BoogieIcfgContainer [2021-12-17 15:48:21,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 15:48:21,765 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 15:48:21,765 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 15:48:21,765 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 15:48:21,765 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:44:58" (3/4) ... [2021-12-17 15:48:21,767 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 15:48:21,963 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 15:48:21,963 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 15:48:21,964 INFO L158 Benchmark]: Toolchain (without parser) took 204025.57ms. Allocated memory was 83.9MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 52.3MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 388.2MB. Max. memory is 16.1GB. [2021-12-17 15:48:21,964 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory was 42.7MB in the beginning and 42.7MB in the end (delta: 30.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 15:48:21,965 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.53ms. Allocated memory is still 83.9MB. Free memory was 52.2MB in the beginning and 56.8MB in the end (delta: -4.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 15:48:21,965 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.85ms. Allocated memory is still 83.9MB. Free memory was 56.8MB in the beginning and 54.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-17 15:48:21,969 INFO L158 Benchmark]: Boogie Preprocessor took 25.00ms. Allocated memory is still 83.9MB. Free memory was 54.0MB in the beginning and 51.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 15:48:21,969 INFO L158 Benchmark]: RCFGBuilder took 590.36ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 51.6MB in the beginning and 73.1MB in the end (delta: -21.5MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2021-12-17 15:48:21,969 INFO L158 Benchmark]: TraceAbstraction took 202840.28ms. Allocated memory was 100.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 72.6MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 324.2MB. Max. memory is 16.1GB. [2021-12-17 15:48:21,969 INFO L158 Benchmark]: Witness Printer took 198.75ms. Allocated memory is still 2.5GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 66.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2021-12-17 15:48:21,971 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.20ms. Allocated memory is still 83.9MB. Free memory was 42.7MB in the beginning and 42.7MB in the end (delta: 30.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.53ms. Allocated memory is still 83.9MB. Free memory was 52.2MB in the beginning and 56.8MB in the end (delta: -4.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.85ms. Allocated memory is still 83.9MB. Free memory was 56.8MB in the beginning and 54.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.00ms. Allocated memory is still 83.9MB. Free memory was 54.0MB in the beginning and 51.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 590.36ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 51.6MB in the beginning and 73.1MB in the end (delta: -21.5MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * TraceAbstraction took 202840.28ms. Allocated memory was 100.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 72.6MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 324.2MB. Max. memory is 16.1GB. * Witness Printer took 198.75ms. Allocated memory is still 2.5GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 66.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 535]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] msg_t nomsg = (msg_t )-1; [L24] port_t g1v ; [L25] int8_t g1v_old ; [L26] int8_t g1v_new ; [L27] port_t g2v ; [L28] int8_t g2v_old ; [L29] int8_t g2v_new ; [L30] port_t g3v ; [L31] int8_t g3v_old ; [L32] int8_t g3v_new ; [L36] _Bool gate1Failed ; [L37] _Bool gate2Failed ; [L38] _Bool gate3Failed ; [L39] msg_t VALUE1 ; [L40] msg_t VALUE2 ; [L41] msg_t VALUE3 ; [L43] _Bool gate1Failed_History_0 ; [L44] _Bool gate1Failed_History_1 ; [L45] _Bool gate1Failed_History_2 ; [L46] _Bool gate2Failed_History_0 ; [L47] _Bool gate2Failed_History_1 ; [L48] _Bool gate2Failed_History_2 ; [L49] _Bool gate3Failed_History_0 ; [L50] _Bool gate3Failed_History_1 ; [L51] _Bool gate3Failed_History_2 ; [L52] int8_t votedValue_History_0 ; [L53] int8_t votedValue_History_1 ; [L54] int8_t votedValue_History_2 ; VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=0, votedValue_History_1=0, votedValue_History_2=0] [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] gate1Failed = __VERIFIER_nondet_bool() [L482] gate2Failed = __VERIFIER_nondet_bool() [L483] gate3Failed = __VERIFIER_nondet_bool() [L484] VALUE1 = __VERIFIER_nondet_char() [L485] VALUE2 = __VERIFIER_nondet_char() [L486] VALUE3 = __VERIFIER_nondet_char() [L487] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L488] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L489] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L490] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L491] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L492] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L493] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L494] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L495] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L496] votedValue_History_0 = __VERIFIER_nondet_char() [L497] votedValue_History_1 = __VERIFIER_nondet_char() [L498] votedValue_History_2 = __VERIFIER_nondet_char() [L499] CALL, EXPR init() [L203] int tmp ; [L204] int tmp___0 ; [L205] int tmp___1 ; [L206] int tmp___2 ; VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] CALL, EXPR add_history_type(0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [\old(history_id)=0, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [\old(history_id)=0, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [\old(history_id)=0, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] RET, EXPR add_history_type(0) VAL [add_history_type(0)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] tmp = add_history_type(0) [L210] COND FALSE !(! tmp) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] CALL, EXPR add_history_type(1) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [\old(history_id)=1, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [\old(history_id)=1, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [\old(history_id)=1, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=1, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] RET, EXPR add_history_type(1) VAL [add_history_type(1)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] tmp___0 = add_history_type(1) [L214] COND FALSE !(! tmp___0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] CALL, EXPR add_history_type(2) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [\old(history_id)=2, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [\old(history_id)=2, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [\old(history_id)=2, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=2, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] RET, EXPR add_history_type(2) VAL [add_history_type(2)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] tmp___1 = add_history_type(2) [L218] COND FALSE !(! tmp___1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] CALL, EXPR add_history_type(3) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=3, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] RET, EXPR add_history_type(3) VAL [add_history_type(3)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] tmp___2 = add_history_type(3) [L222] COND FALSE !(! tmp___2) [L225] return (1); VAL [\result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L499] RET, EXPR init() [L499] i2 = init() [L500] COND FALSE !(!(i2)) VAL [c1=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, i2=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L501] g1v_old = nomsg [L502] g1v_new = nomsg [L503] g2v_old = nomsg [L504] g2v_new = nomsg [L505] g3v_old = nomsg [L506] g3v_new = nomsg [L507] i2 = 0 VAL [c1=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L508] COND TRUE i2 < 10 [L510] CALL gate1_each_pals_period() [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L344] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=4, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=6, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=5, \old(gate3Failed_History_2)=3, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed_History_0=0, gate1Failed_History_1=4, gate1Failed_History_2=2, gate2Failed_History_0=0, gate2Failed_History_1=6, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=5, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=4, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=6, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=5, \old(gate3Failed_History_2)=3, \old(history_id)=0, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=6, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=5, gate3Failed_History_2=3, history_id=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L344] RET write_history_bool(0, gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=6, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=5, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L345] COND TRUE \read(gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=6, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=5, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L346] EXPR nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=6, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=5, gate3Failed_History_2=3, nomsg=-1, nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L346] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new [L510] RET gate1_each_pals_period() [L511] CALL gate2_each_pals_period() [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L375] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=6, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=5, \old(gate3Failed_History_2)=3, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=6, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=5, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=6, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=5, \old(gate3Failed_History_2)=3, \old(history_id)=1, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=6, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=5, gate3Failed_History_2=3, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=6, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=5, \old(gate3Failed_History_2)=3, \old(history_id)=1, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=5, gate3Failed_History_2=3, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L375] RET write_history_bool(1, gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=5, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L376] COND TRUE \read(gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=5, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L377] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=5, gate3Failed_History_2=3, nomsg=-1, nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L511] RET gate2_each_pals_period() [L512] CALL gate3_each_pals_period() [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L406] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=5, \old(gate3Failed_History_2)=3, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=5, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=5, \old(gate3Failed_History_2)=3, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=5, gate3Failed_History_2=3, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L186] COND FALSE !(history_id == 1) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=5, \old(gate3Failed_History_2)=3, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=5, gate3Failed_History_2=3, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=5, \old(gate3Failed_History_2)=3, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L406] RET write_history_bool(2, gate3Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L407] COND FALSE !(\read(gate3Failed)) [L411] tmp = __VERIFIER_nondet_char() [L412] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, next_state=0, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L413] COND TRUE (int )next_state == 0 [L414] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L424] COND FALSE !(!((_Bool )tmp___0)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L425] EXPR next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, next_state=0, next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L425] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [L512] RET gate3_each_pals_period() [L513] CALL voter() [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] voted_value = VALUE1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L470] CALL write_history_int8(3, voted_value) [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [\old(buf)=255, \old(history_id)=3, buf=255, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L470] RET write_history_int8(3, voted_value) [L513] RET voter() [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L520] CALL, EXPR check() [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L249] COND FALSE !(! gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L252] COND FALSE !(! gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L255] COND TRUE ! gate3Failed [L256] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L260] COND FALSE !(!((_Bool )tmp)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] CALL, EXPR read_history_bool(0, 1) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L127] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] RET, EXPR read_history_bool(0, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, read_history_bool(0, 1)=0, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND TRUE ! tmp___3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, tmp=1, tmp___3=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] CALL, EXPR read_history_bool(1, 1) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L137] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L140] COND TRUE historyIndex == 1 [L141] return (gate2Failed_History_1); VAL [\old(history_id)=1, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] RET, EXPR read_history_bool(1, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, read_history_bool(1, 1)=0, tmp=1, tmp___3=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] tmp___4 = read_history_bool(1, 1) [L264] COND TRUE ! tmp___4 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] CALL, EXPR read_history_bool(2, 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L147] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L150] COND TRUE historyIndex == 1 [L151] return (gate3Failed_History_1); VAL [\old(history_id)=2, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] RET, EXPR read_history_bool(2, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, read_history_bool(2, 1)=0, tmp=1, tmp___3=0, tmp___4=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] tmp___5 = read_history_bool(2, 1) [L266] COND TRUE ! tmp___5 [L267] temp_count = 0 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] tmp___0 = read_history_int8(3, 0) [L269] COND TRUE (int )VALUE1 == (int )tmp___0 [L270] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] tmp___1 = read_history_int8(3, 0) [L273] COND TRUE (int )VALUE2 == (int )tmp___1 [L274] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] tmp___2 = read_history_int8(3, 0) [L277] COND TRUE (int )VALUE3 == (int )tmp___2 [L278] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L280] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L294] COND FALSE !(! (temp_count > 1)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] CALL, EXPR read_history_int8(3, 1) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 1 [L111] return (votedValue_History_1); VAL [\old(history_id)=3, \old(historyIndex)=1, \result=-2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] RET, EXPR read_history_int8(3, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, read_history_int8(3, 1)=-2, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] tmp___10 = read_history_int8(3, 1) [L301] COND FALSE !((int )tmp___10 > -2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] tmp___11 = read_history_int8(3, 0) [L321] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___11=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L333] return (1); VAL [\result=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___11=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L520] RET, EXPR check() [L520] c1 = check() [L521] CALL assert(c1) VAL [\old(arg)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L533] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L521] RET assert(c1) VAL [c1=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L522] i2 ++ VAL [c1=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L508] COND TRUE i2 < 10 [L510] CALL gate1_each_pals_period() [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L344] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=5, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=5, \old(history_id)=0, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L344] RET write_history_bool(0, gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L345] COND FALSE !(\read(gate1Failed)) [L349] tmp = __VERIFIER_nondet_char() [L350] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, next_state=0, nomsg=-1, tmp=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L351] COND TRUE (int )next_state == 0 [L352] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L362] COND FALSE !(!((_Bool )tmp___0)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L363] EXPR next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, next_state=0, next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L363] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L510] RET gate1_each_pals_period() [L511] CALL gate2_each_pals_period() [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L375] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=5, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=5, \old(history_id)=1, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=5, \old(history_id)=1, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L375] RET write_history_bool(1, gate2Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L376] COND TRUE \read(gate2Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L377] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L511] RET gate2_each_pals_period() [L512] CALL gate3_each_pals_period() [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L406] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=5, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=5, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L186] COND FALSE !(history_id == 1) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=5, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=5, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=5, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L406] RET write_history_bool(2, gate3Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L407] COND TRUE \read(gate3Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L408] EXPR nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L408] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new [L512] RET gate3_each_pals_period() [L513] CALL voter() [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] voted_value = VALUE1 VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L470] CALL write_history_int8(3, voted_value) [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [\old(buf)=255, \old(history_id)=3, buf=255, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L470] RET write_history_int8(3, voted_value) [L513] RET voter() [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L520] CALL, EXPR check() [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L249] COND TRUE ! gate1Failed [L250] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L260] COND FALSE !(!((_Bool )tmp)) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] CALL, EXPR read_history_bool(0, 1) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L127] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=-511, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] RET, EXPR read_history_bool(0, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(0, 1)=-511, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND FALSE !(! tmp___3) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] CALL, EXPR read_history_int8(3, 1) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND TRUE historyIndex == 1 [L111] return (votedValue_History_1); VAL [\old(history_id)=3, \old(historyIndex)=1, \result=-1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] RET, EXPR read_history_int8(3, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 1)=-1, tmp=1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] tmp___10 = read_history_int8(3, 1) [L301] COND TRUE (int )tmp___10 > -2 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 0)=-1, tmp=1, tmp___10=-1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] tmp___6 = read_history_int8(3, 0) [L303] COND TRUE (int )tmp___6 == (int )nomsg VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] CALL, EXPR read_history_bool(0, 1) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L127] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=-511, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] RET, EXPR read_history_bool(0, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(0, 1)=-511, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] tmp___7 = read_history_bool(0, 1) [L305] COND TRUE \read(tmp___7) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] CALL, EXPR read_history_bool(1, 1) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L137] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L140] COND TRUE historyIndex == 1 [L141] return (gate2Failed_History_1); VAL [\old(history_id)=1, \old(historyIndex)=1, \result=-255, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] RET, EXPR read_history_bool(1, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(1, 1)=-255, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] tmp___8 = read_history_bool(1, 1) [L307] COND TRUE \read(tmp___8) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] CALL, EXPR read_history_bool(2, 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L147] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L150] COND TRUE historyIndex == 1 [L151] return (gate3Failed_History_1); VAL [\old(history_id)=2, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] RET, EXPR read_history_bool(2, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(2, 1)=0, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] tmp___9 = read_history_bool(2, 1) [L309] COND TRUE ! tmp___9 [L310] return (0); VAL [\result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, tmp___9=0, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L520] RET, EXPR check() [L520] c1 = check() [L521] CALL assert(c1) VAL [\old(arg)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L533] COND TRUE ! arg VAL [\old(arg)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L535] reach_error() VAL [\old(arg)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 184 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 202.6s, OverallIterations: 56, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 151.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38713 SdHoareTripleChecker+Valid, 72.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38139 mSDsluCounter, 245949 SdHoareTripleChecker+Invalid, 61.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 223431 mSDsCounter, 20058 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 180592 IncrementalHoareTripleChecker+Invalid, 200650 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20058 mSolverCounterUnsat, 22518 mSDtfsCounter, 180592 mSolverCounterSat, 0.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15464 GetRequests, 12977 SyntacticMatches, 16 SemanticMatches, 2471 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278942 ImplicationChecksByTransitivity, 55.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8170occurred in iteration=47, InterpolantAutomatonStates: 2106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.0s AutomataMinimizationTime, 55 MinimizatonAttempts, 138406 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 22.0s InterpolantComputationTime, 20149 NumberOfCodeBlocks, 20149 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 22379 ConstructedInterpolants, 0 QuantifiedInterpolants, 47002 SizeOfPredicates, 72 NumberOfNonLiveVariables, 20628 ConjunctsInSsa, 381 ConjunctsInUnsatCore, 84 InterpolantComputations, 44 PerfectInterpolantSequences, 55373/57767 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-17 15:48:22,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE