/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 01:05:44,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 01:05:44,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 01:05:44,807 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 01:05:44,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 01:05:44,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 01:05:44,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 01:05:44,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 01:05:44,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 01:05:44,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 01:05:44,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 01:05:44,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 01:05:44,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 01:05:44,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 01:05:44,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 01:05:44,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 01:05:44,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 01:05:44,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 01:05:44,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 01:05:44,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 01:05:44,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 01:05:44,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 01:05:44,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 01:05:44,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 01:05:44,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 01:05:44,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 01:05:44,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 01:05:44,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 01:05:44,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 01:05:44,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 01:05:44,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 01:05:44,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 01:05:44,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 01:05:44,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 01:05:44,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 01:05:44,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 01:05:44,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 01:05:44,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 01:05:44,861 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 01:05:44,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 01:05:44,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 01:05:44,870 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 01:05:44,900 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 01:05:44,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 01:05:44,900 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 01:05:44,900 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 01:05:44,900 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 01:05:44,901 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 01:05:44,901 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 01:05:44,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 01:05:44,901 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 01:05:44,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 01:05:44,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 01:05:44,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 01:05:44,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 01:05:44,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 01:05:44,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 01:05:44,902 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 01:05:44,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 01:05:44,902 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 01:05:44,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 01:05:44,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 01:05:44,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 01:05:44,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:05:44,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 01:05:44,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 01:05:44,902 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 01:05:44,902 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 01:05:44,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 01:05:44,903 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 01:05:44,903 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 01:05:44,903 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 01:05:44,903 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 01:05:45,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 01:05:45,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 01:05:45,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 01:05:45,077 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 01:05:45,078 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 01:05:45,078 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2022-01-10 01:05:45,116 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4979b5e/26a44589ee6e424484e6b7b6362a9555/FLAG01c51d93b [2022-01-10 01:05:45,483 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 01:05:45,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2022-01-10 01:05:45,489 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4979b5e/26a44589ee6e424484e6b7b6362a9555/FLAG01c51d93b [2022-01-10 01:05:45,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4979b5e/26a44589ee6e424484e6b7b6362a9555 [2022-01-10 01:05:45,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 01:05:45,509 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 01:05:45,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 01:05:45,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 01:05:45,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 01:05:45,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:05:45" (1/1) ... [2022-01-10 01:05:45,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a88d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:45, skipping insertion in model container [2022-01-10 01:05:45,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:05:45" (1/1) ... [2022-01-10 01:05:45,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 01:05:45,554 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 01:05:45,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c[671,684] [2022-01-10 01:05:45,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:05:45,741 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 01:05:45,751 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c[671,684] [2022-01-10 01:05:45,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:05:45,784 INFO L208 MainTranslator]: Completed translation [2022-01-10 01:05:45,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:45 WrapperNode [2022-01-10 01:05:45,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 01:05:45,785 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 01:05:45,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 01:05:45,786 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 01:05:45,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:45" (1/1) ... [2022-01-10 01:05:45,796 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:45" (1/1) ... [2022-01-10 01:05:45,813 INFO L137 Inliner]: procedures = 32, calls = 38, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 278 [2022-01-10 01:05:45,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 01:05:45,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 01:05:45,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 01:05:45,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 01:05:45,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:45" (1/1) ... [2022-01-10 01:05:45,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:45" (1/1) ... [2022-01-10 01:05:45,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:45" (1/1) ... [2022-01-10 01:05:45,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:45" (1/1) ... [2022-01-10 01:05:45,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:45" (1/1) ... [2022-01-10 01:05:45,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:45" (1/1) ... [2022-01-10 01:05:45,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:45" (1/1) ... [2022-01-10 01:05:45,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 01:05:45,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 01:05:45,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 01:05:45,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 01:05:45,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:45" (1/1) ... [2022-01-10 01:05:45,837 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:05:45,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:05:45,854 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) [2022-01-10 01:05:45,857 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 [2022-01-10 01:05:45,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 01:05:45,890 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-01-10 01:05:45,893 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-01-10 01:05:45,893 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-01-10 01:05:45,893 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-01-10 01:05:45,893 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-01-10 01:05:45,893 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-01-10 01:05:45,894 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-01-10 01:05:45,894 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-01-10 01:05:45,894 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-01-10 01:05:45,894 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-01-10 01:05:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-01-10 01:05:45,897 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-01-10 01:05:45,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 01:05:45,897 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-01-10 01:05:45,897 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-01-10 01:05:45,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 01:05:45,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 01:05:45,976 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 01:05:45,977 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 01:05:46,202 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 01:05:46,207 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 01:05:46,207 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-10 01:05:46,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:05:46 BoogieIcfgContainer [2022-01-10 01:05:46,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 01:05:46,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 01:05:46,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 01:05:46,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 01:05:46,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:05:45" (1/3) ... [2022-01-10 01:05:46,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e68ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:05:46, skipping insertion in model container [2022-01-10 01:05:46,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:45" (2/3) ... [2022-01-10 01:05:46,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e68ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:05:46, skipping insertion in model container [2022-01-10 01:05:46,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:05:46" (3/3) ... [2022-01-10 01:05:46,214 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2022-01-10 01:05:46,217 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 01:05:46,217 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 01:05:46,245 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 01:05:46,250 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 [2022-01-10 01:05:46,250 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 01:05:46,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 113 states have (on average 1.584070796460177) internal successors, (179), 117 states have internal predecessors, (179), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-01-10 01:05:46,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 01:05:46,267 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:05:46,267 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:05:46,268 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:05:46,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:05:46,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1053890287, now seen corresponding path program 1 times [2022-01-10 01:05:46,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:05:46,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121810487] [2022-01-10 01:05:46,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:05:46,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:05:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:46,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:05:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:46,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:05:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:46,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:05:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:46,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:05:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:46,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:05:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:05:46,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:05:46,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121810487] [2022-01-10 01:05:46,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121810487] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:05:46,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:05:46,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:05:46,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396725606] [2022-01-10 01:05:46,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:05:46,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:05:46,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:05:46,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:05:46,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:05:46,552 INFO L87 Difference]: Start difference. First operand has 140 states, 113 states have (on average 1.584070796460177) internal successors, (179), 117 states have internal predecessors, (179), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:05:46,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:05:46,935 INFO L93 Difference]: Finished difference Result 304 states and 476 transitions. [2022-01-10 01:05:46,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 01:05:46,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-01-10 01:05:46,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:05:46,951 INFO L225 Difference]: With dead ends: 304 [2022-01-10 01:05:46,951 INFO L226 Difference]: Without dead ends: 166 [2022-01-10 01:05:46,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:05:46,955 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 298 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 01:05:46,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 367 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 01:05:46,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-01-10 01:05:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 134. [2022-01-10 01:05:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 109 states have (on average 1.4862385321100917) internal successors, (162), 111 states have internal predecessors, (162), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-10 01:05:47,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 196 transitions. [2022-01-10 01:05:47,019 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 196 transitions. Word has length 68 [2022-01-10 01:05:47,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:05:47,019 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 196 transitions. [2022-01-10 01:05:47,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:05:47,019 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 196 transitions. [2022-01-10 01:05:47,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 01:05:47,021 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:05:47,021 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:05:47,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 01:05:47,021 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:05:47,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:05:47,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1279502351, now seen corresponding path program 1 times [2022-01-10 01:05:47,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:05:47,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92442908] [2022-01-10 01:05:47,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:05:47,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:05:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:47,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:05:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:47,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:05:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:47,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:05:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:47,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:05:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:47,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:05:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:05:47,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:05:47,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92442908] [2022-01-10 01:05:47,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92442908] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:05:47,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:05:47,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 01:05:47,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437187921] [2022-01-10 01:05:47,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:05:47,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 01:05:47,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:05:47,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 01:05:47,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:05:47,154 INFO L87 Difference]: Start difference. First operand 134 states and 196 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:05:47,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:05:47,633 INFO L93 Difference]: Finished difference Result 444 states and 667 transitions. [2022-01-10 01:05:47,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 01:05:47,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-01-10 01:05:47,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:05:47,636 INFO L225 Difference]: With dead ends: 444 [2022-01-10 01:05:47,636 INFO L226 Difference]: Without dead ends: 320 [2022-01-10 01:05:47,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-10 01:05:47,638 INFO L933 BasicCegarLoop]: 220 mSDtfsCounter, 419 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 01:05:47,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [428 Valid, 572 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 01:05:47,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-01-10 01:05:47,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 255. [2022-01-10 01:05:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 212 states have (on average 1.5) internal successors, (318), 215 states have internal predecessors, (318), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2022-01-10 01:05:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 377 transitions. [2022-01-10 01:05:47,657 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 377 transitions. Word has length 68 [2022-01-10 01:05:47,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:05:47,658 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 377 transitions. [2022-01-10 01:05:47,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:05:47,658 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 377 transitions. [2022-01-10 01:05:47,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 01:05:47,659 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:05:47,659 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:05:47,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 01:05:47,659 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:05:47,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:05:47,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1382216715, now seen corresponding path program 1 times [2022-01-10 01:05:47,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:05:47,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990155460] [2022-01-10 01:05:47,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:05:47,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:05:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:47,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:05:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:47,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:05:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:47,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:05:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:47,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:05:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:47,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:05:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:47,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:05:47,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:05:47,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990155460] [2022-01-10 01:05:47,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990155460] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:05:47,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:05:47,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:05:47,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392873781] [2022-01-10 01:05:47,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:05:47,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:05:47,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:05:47,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:05:47,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:05:47,747 INFO L87 Difference]: Start difference. First operand 255 states and 377 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:05:48,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:05:48,320 INFO L93 Difference]: Finished difference Result 717 states and 1071 transitions. [2022-01-10 01:05:48,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 01:05:48,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-01-10 01:05:48,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:05:48,327 INFO L225 Difference]: With dead ends: 717 [2022-01-10 01:05:48,327 INFO L226 Difference]: Without dead ends: 472 [2022-01-10 01:05:48,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 01:05:48,336 INFO L933 BasicCegarLoop]: 311 mSDtfsCounter, 407 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 01:05:48,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 986 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 01:05:48,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-01-10 01:05:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 369. [2022-01-10 01:05:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 308 states have (on average 1.4935064935064934) internal successors, (460), 312 states have internal predecessors, (460), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-01-10 01:05:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 543 transitions. [2022-01-10 01:05:48,371 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 543 transitions. Word has length 68 [2022-01-10 01:05:48,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:05:48,372 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 543 transitions. [2022-01-10 01:05:48,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:05:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 543 transitions. [2022-01-10 01:05:48,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 01:05:48,377 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:05:48,377 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:05:48,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 01:05:48,378 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:05:48,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:05:48,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1525965171, now seen corresponding path program 1 times [2022-01-10 01:05:48,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:05:48,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738582401] [2022-01-10 01:05:48,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:05:48,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:05:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:48,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:05:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:48,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:05:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:48,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:05:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:48,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:05:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:48,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:05:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:05:48,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:05:48,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738582401] [2022-01-10 01:05:48,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738582401] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:05:48,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:05:48,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:05:48,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118010451] [2022-01-10 01:05:48,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:05:48,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:05:48,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:05:48,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:05:48,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:05:48,483 INFO L87 Difference]: Start difference. First operand 369 states and 543 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:05:49,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:05:49,016 INFO L93 Difference]: Finished difference Result 1118 states and 1665 transitions. [2022-01-10 01:05:49,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 01:05:49,017 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-01-10 01:05:49,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:05:49,020 INFO L225 Difference]: With dead ends: 1118 [2022-01-10 01:05:49,020 INFO L226 Difference]: Without dead ends: 759 [2022-01-10 01:05:49,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 01:05:49,022 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 441 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 01:05:49,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [450 Valid, 683 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 01:05:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2022-01-10 01:05:49,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 598. [2022-01-10 01:05:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 501 states have (on average 1.4870259481037924) internal successors, (745), 507 states have internal predecessors, (745), 62 states have call successors, (62), 31 states have call predecessors, (62), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2022-01-10 01:05:49,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 880 transitions. [2022-01-10 01:05:49,082 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 880 transitions. Word has length 68 [2022-01-10 01:05:49,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:05:49,082 INFO L470 AbstractCegarLoop]: Abstraction has 598 states and 880 transitions. [2022-01-10 01:05:49,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:05:49,082 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 880 transitions. [2022-01-10 01:05:49,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 01:05:49,083 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:05:49,083 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:05:49,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 01:05:49,084 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:05:49,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:05:49,084 INFO L85 PathProgramCache]: Analyzing trace with hash -649946165, now seen corresponding path program 1 times [2022-01-10 01:05:49,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:05:49,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905028403] [2022-01-10 01:05:49,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:05:49,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:05:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:49,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:05:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:49,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:05:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:49,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:05:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:49,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:05:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:49,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:05:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:05:49,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:05:49,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905028403] [2022-01-10 01:05:49,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905028403] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:05:49,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:05:49,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:05:49,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752474393] [2022-01-10 01:05:49,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:05:49,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:05:49,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:05:49,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:05:49,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:05:49,156 INFO L87 Difference]: Start difference. First operand 598 states and 880 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:05:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:05:49,711 INFO L93 Difference]: Finished difference Result 1992 states and 2956 transitions. [2022-01-10 01:05:49,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:05:49,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-01-10 01:05:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:05:49,734 INFO L225 Difference]: With dead ends: 1992 [2022-01-10 01:05:49,734 INFO L226 Difference]: Without dead ends: 1404 [2022-01-10 01:05:49,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-01-10 01:05:49,738 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 413 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 01:05:49,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [421 Valid, 984 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 01:05:49,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2022-01-10 01:05:49,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1010. [2022-01-10 01:05:49,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 845 states have (on average 1.4733727810650887) internal successors, (1245), 855 states have internal predecessors, (1245), 102 states have call successors, (102), 55 states have call predecessors, (102), 62 states have return successors, (135), 107 states have call predecessors, (135), 100 states have call successors, (135) [2022-01-10 01:05:49,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1482 transitions. [2022-01-10 01:05:49,835 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1482 transitions. Word has length 68 [2022-01-10 01:05:49,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:05:49,835 INFO L470 AbstractCegarLoop]: Abstraction has 1010 states and 1482 transitions. [2022-01-10 01:05:49,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:05:49,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1482 transitions. [2022-01-10 01:05:49,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 01:05:49,837 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:05:49,837 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:05:49,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 01:05:49,837 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:05:49,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:05:49,837 INFO L85 PathProgramCache]: Analyzing trace with hash 888393865, now seen corresponding path program 1 times [2022-01-10 01:05:49,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:05:49,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609635899] [2022-01-10 01:05:49,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:05:49,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:05:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:49,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:05:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:49,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:05:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:49,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:05:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:49,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:05:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:49,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:05:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:05:49,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:05:49,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609635899] [2022-01-10 01:05:49,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609635899] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:05:49,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:05:49,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:05:49,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340378803] [2022-01-10 01:05:49,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:05:49,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:05:49,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:05:49,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:05:49,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:05:49,942 INFO L87 Difference]: Start difference. First operand 1010 states and 1482 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:05:50,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:05:50,570 INFO L93 Difference]: Finished difference Result 3390 states and 4996 transitions. [2022-01-10 01:05:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:05:50,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-01-10 01:05:50,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:05:50,578 INFO L225 Difference]: With dead ends: 3390 [2022-01-10 01:05:50,578 INFO L226 Difference]: Without dead ends: 2390 [2022-01-10 01:05:50,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-01-10 01:05:50,583 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 418 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 01:05:50,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 956 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 01:05:50,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2022-01-10 01:05:50,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 1867. [2022-01-10 01:05:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1570 states have (on average 1.4745222929936306) internal successors, (2315), 1588 states have internal predecessors, (2315), 178 states have call successors, (178), 103 states have call predecessors, (178), 118 states have return successors, (273), 191 states have call predecessors, (273), 176 states have call successors, (273) [2022-01-10 01:05:50,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2766 transitions. [2022-01-10 01:05:50,660 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2766 transitions. Word has length 68 [2022-01-10 01:05:50,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:05:50,660 INFO L470 AbstractCegarLoop]: Abstraction has 1867 states and 2766 transitions. [2022-01-10 01:05:50,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:05:50,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2766 transitions. [2022-01-10 01:05:50,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 01:05:50,662 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:05:50,662 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:05:50,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 01:05:50,662 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:05:50,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:05:50,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1140192245, now seen corresponding path program 1 times [2022-01-10 01:05:50,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:05:50,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221199741] [2022-01-10 01:05:50,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:05:50,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:05:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:50,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:05:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:50,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:05:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:50,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:05:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:50,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:05:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:50,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:05:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:05:50,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:05:50,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221199741] [2022-01-10 01:05:50,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221199741] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:05:50,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:05:50,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 01:05:50,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415373024] [2022-01-10 01:05:50,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:05:50,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 01:05:50,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:05:50,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 01:05:50,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:05:50,709 INFO L87 Difference]: Start difference. First operand 1867 states and 2766 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:05:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:05:51,469 INFO L93 Difference]: Finished difference Result 5251 states and 7801 transitions. [2022-01-10 01:05:51,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 01:05:51,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-01-10 01:05:51,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:05:51,484 INFO L225 Difference]: With dead ends: 5251 [2022-01-10 01:05:51,485 INFO L226 Difference]: Without dead ends: 3395 [2022-01-10 01:05:51,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-10 01:05:51,492 INFO L933 BasicCegarLoop]: 353 mSDtfsCounter, 541 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 01:05:51,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [566 Valid, 746 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 01:05:51,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3395 states. [2022-01-10 01:05:51,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3395 to 2808. [2022-01-10 01:05:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2808 states, 2353 states have (on average 1.4526136846578837) internal successors, (3418), 2388 states have internal predecessors, (3418), 274 states have call successors, (274), 157 states have call predecessors, (274), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2022-01-10 01:05:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 4089 transitions. [2022-01-10 01:05:51,616 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 4089 transitions. Word has length 68 [2022-01-10 01:05:51,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:05:51,617 INFO L470 AbstractCegarLoop]: Abstraction has 2808 states and 4089 transitions. [2022-01-10 01:05:51,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:05:51,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 4089 transitions. [2022-01-10 01:05:51,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 01:05:51,625 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:05:51,626 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2022-01-10 01:05:51,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 01:05:51,626 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:05:51,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:05:51,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1415706776, now seen corresponding path program 1 times [2022-01-10 01:05:51,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:05:51,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176230637] [2022-01-10 01:05:51,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:05:51,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:05:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:51,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:05:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:51,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:05:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:51,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:05:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:51,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:05:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:51,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:05:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:51,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-10 01:05:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:51,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:05:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:51,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-10 01:05:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 01:05:51,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:05:51,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176230637] [2022-01-10 01:05:51,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176230637] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:05:51,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060268744] [2022-01-10 01:05:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:05:51,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:05:51,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:05:51,794 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) [2022-01-10 01:05:51,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 01:05:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:51,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 01:05:51,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:05:52,072 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 01:05:52,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:05:52,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060268744] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:05:52,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:05:52,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-01-10 01:05:52,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340844700] [2022-01-10 01:05:52,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:05:52,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:05:52,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:05:52,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:05:52,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:05:52,075 INFO L87 Difference]: Start difference. First operand 2808 states and 4089 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 01:05:52,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:05:52,277 INFO L93 Difference]: Finished difference Result 8259 states and 12107 transitions. [2022-01-10 01:05:52,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:05:52,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 110 [2022-01-10 01:05:52,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:05:52,297 INFO L225 Difference]: With dead ends: 8259 [2022-01-10 01:05:52,297 INFO L226 Difference]: Without dead ends: 5462 [2022-01-10 01:05:52,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:05:52,305 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 152 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:05:52,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 374 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:05:52,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5462 states. [2022-01-10 01:05:52,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5462 to 5406. [2022-01-10 01:05:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5406 states, 4537 states have (on average 1.451840423187128) internal successors, (6587), 4605 states have internal predecessors, (6587), 512 states have call successors, (512), 309 states have call predecessors, (512), 356 states have return successors, (745), 507 states have call predecessors, (745), 510 states have call successors, (745) [2022-01-10 01:05:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5406 states to 5406 states and 7844 transitions. [2022-01-10 01:05:52,518 INFO L78 Accepts]: Start accepts. Automaton has 5406 states and 7844 transitions. Word has length 110 [2022-01-10 01:05:52,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:05:52,518 INFO L470 AbstractCegarLoop]: Abstraction has 5406 states and 7844 transitions. [2022-01-10 01:05:52,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 01:05:52,518 INFO L276 IsEmpty]: Start isEmpty. Operand 5406 states and 7844 transitions. [2022-01-10 01:05:52,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 01:05:52,525 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:05:52,526 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2022-01-10 01:05:52,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 01:05:52,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:05:52,759 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:05:52,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:05:52,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1986703688, now seen corresponding path program 1 times [2022-01-10 01:05:52,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:05:52,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853741979] [2022-01-10 01:05:52,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:05:52,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:05:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:52,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:05:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:52,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:05:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:52,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:05:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:52,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:05:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:52,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:05:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:52,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-10 01:05:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:52,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:05:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:52,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-10 01:05:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:52,838 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 01:05:52,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:05:52,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853741979] [2022-01-10 01:05:52,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853741979] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:05:52,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451778627] [2022-01-10 01:05:52,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:05:52,838 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:05:52,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:05:52,852 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) [2022-01-10 01:05:52,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 01:05:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:52,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 01:05:52,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:05:53,068 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-10 01:05:53,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:05:53,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451778627] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:05:53,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:05:53,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-01-10 01:05:53,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315868532] [2022-01-10 01:05:53,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:05:53,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:05:53,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:05:53,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:05:53,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:05:53,070 INFO L87 Difference]: Start difference. First operand 5406 states and 7844 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:05:53,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:05:53,277 INFO L93 Difference]: Finished difference Result 9176 states and 13438 transitions. [2022-01-10 01:05:53,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:05:53,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 110 [2022-01-10 01:05:53,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:05:53,302 INFO L225 Difference]: With dead ends: 9176 [2022-01-10 01:05:53,303 INFO L226 Difference]: Without dead ends: 7157 [2022-01-10 01:05:53,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:05:53,310 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 143 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:05:53,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 535 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:05:53,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7157 states. [2022-01-10 01:05:53,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7157 to 7157. [2022-01-10 01:05:53,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7157 states, 6007 states have (on average 1.4486432495422008) internal successors, (8702), 6091 states have internal predecessors, (8702), 673 states have call successors, (673), 413 states have call predecessors, (673), 476 states have return successors, (1015), 668 states have call predecessors, (1015), 671 states have call successors, (1015) [2022-01-10 01:05:53,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7157 states to 7157 states and 10390 transitions. [2022-01-10 01:05:53,550 INFO L78 Accepts]: Start accepts. Automaton has 7157 states and 10390 transitions. Word has length 110 [2022-01-10 01:05:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:05:53,550 INFO L470 AbstractCegarLoop]: Abstraction has 7157 states and 10390 transitions. [2022-01-10 01:05:53,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:05:53,551 INFO L276 IsEmpty]: Start isEmpty. Operand 7157 states and 10390 transitions. [2022-01-10 01:05:53,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-01-10 01:05:53,599 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:05:53,600 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:05:53,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 01:05:53,815 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,SelfDestructingSolverStorable8 [2022-01-10 01:05:53,816 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:05:53,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:05:53,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1976353697, now seen corresponding path program 1 times [2022-01-10 01:05:53,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:05:53,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675597066] [2022-01-10 01:05:53,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:05:53,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:05:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:53,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:05:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:53,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:05:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:53,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:05:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:53,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:05:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:53,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:05:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:53,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-10 01:05:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:53,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:05:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:53,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-01-10 01:05:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:53,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:05:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:53,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-01-10 01:05:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:53,897 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-10 01:05:53,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:05:53,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675597066] [2022-01-10 01:05:53,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675597066] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:05:53,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891016268] [2022-01-10 01:05:53,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:05:53,897 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:05:53,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:05:53,898 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) [2022-01-10 01:05:53,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 01:05:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:53,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 01:05:53,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:05:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-10 01:05:54,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:05:54,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891016268] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:05:54,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:05:54,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-01-10 01:05:54,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924797781] [2022-01-10 01:05:54,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:05:54,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:05:54,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:05:54,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:05:54,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:05:54,209 INFO L87 Difference]: Start difference. First operand 7157 states and 10390 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 01:05:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:05:54,543 INFO L93 Difference]: Finished difference Result 21167 states and 30956 transitions. [2022-01-10 01:05:54,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:05:54,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 142 [2022-01-10 01:05:54,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:05:54,593 INFO L225 Difference]: With dead ends: 21167 [2022-01-10 01:05:54,594 INFO L226 Difference]: Without dead ends: 14021 [2022-01-10 01:05:54,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:05:54,613 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 110 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:05:54,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 395 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:05:54,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14021 states. [2022-01-10 01:05:55,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14021 to 13877. [2022-01-10 01:05:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13877 states, 11640 states have (on average 1.4448453608247422) internal successors, (16818), 11806 states have internal predecessors, (16818), 1293 states have call successors, (1293), 816 states have call predecessors, (1293), 943 states have return successors, (1949), 1270 states have call predecessors, (1949), 1291 states have call successors, (1949) [2022-01-10 01:05:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13877 states to 13877 states and 20060 transitions. [2022-01-10 01:05:55,161 INFO L78 Accepts]: Start accepts. Automaton has 13877 states and 20060 transitions. Word has length 142 [2022-01-10 01:05:55,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:05:55,161 INFO L470 AbstractCegarLoop]: Abstraction has 13877 states and 20060 transitions. [2022-01-10 01:05:55,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 01:05:55,161 INFO L276 IsEmpty]: Start isEmpty. Operand 13877 states and 20060 transitions. [2022-01-10 01:05:55,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-10 01:05:55,195 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:05:55,196 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:05:55,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 01:05:55,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:05:55,412 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:05:55,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:05:55,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1687241086, now seen corresponding path program 1 times [2022-01-10 01:05:55,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:05:55,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584305199] [2022-01-10 01:05:55,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:05:55,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:05:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:55,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:05:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:55,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:05:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:55,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:05:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:55,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:05:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:55,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:05:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:55,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-01-10 01:05:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:55,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:05:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:55,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:05:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:55,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-01-10 01:05:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:55,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:05:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:55,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-01-10 01:05:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:55,512 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-01-10 01:05:55,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:05:55,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584305199] [2022-01-10 01:05:55,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584305199] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:05:55,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944929011] [2022-01-10 01:05:55,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:05:55,513 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:05:55,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:05:55,514 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) [2022-01-10 01:05:55,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 01:05:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:55,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 01:05:55,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:05:55,918 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 01:05:55,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:05:55,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944929011] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:05:55,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:05:55,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-01-10 01:05:55,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307058574] [2022-01-10 01:05:55,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:05:55,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:05:55,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:05:55,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:05:55,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:05:55,921 INFO L87 Difference]: Start difference. First operand 13877 states and 20060 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 01:05:56,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:05:56,396 INFO L93 Difference]: Finished difference Result 29372 states and 43088 transitions. [2022-01-10 01:05:56,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:05:56,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 159 [2022-01-10 01:05:56,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:05:56,436 INFO L225 Difference]: With dead ends: 29372 [2022-01-10 01:05:56,436 INFO L226 Difference]: Without dead ends: 15505 [2022-01-10 01:05:56,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:05:56,467 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 128 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:05:56,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 224 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:05:56,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15505 states. [2022-01-10 01:05:57,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15505 to 15505. [2022-01-10 01:05:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15505 states, 13108 states have (on average 1.3864815379920659) internal successors, (18174), 13274 states have internal predecessors, (18174), 1338 states have call successors, (1338), 931 states have call predecessors, (1338), 1058 states have return successors, (1999), 1315 states have call predecessors, (1999), 1336 states have call successors, (1999) [2022-01-10 01:05:57,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15505 states to 15505 states and 21511 transitions. [2022-01-10 01:05:57,115 INFO L78 Accepts]: Start accepts. Automaton has 15505 states and 21511 transitions. Word has length 159 [2022-01-10 01:05:57,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:05:57,116 INFO L470 AbstractCegarLoop]: Abstraction has 15505 states and 21511 transitions. [2022-01-10 01:05:57,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 01:05:57,116 INFO L276 IsEmpty]: Start isEmpty. Operand 15505 states and 21511 transitions. [2022-01-10 01:05:57,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-10 01:05:57,142 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:05:57,142 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:05:57,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 01:05:57,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:05:57,359 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:05:57,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:05:57,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1840869217, now seen corresponding path program 1 times [2022-01-10 01:05:57,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:05:57,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554263172] [2022-01-10 01:05:57,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:05:57,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:05:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:57,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:05:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:57,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:05:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:57,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:05:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:57,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:05:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:57,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:05:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:57,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-01-10 01:05:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:57,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:05:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:57,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:05:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:57,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-01-10 01:05:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:57,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:05:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:57,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-01-10 01:05:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-01-10 01:05:57,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:05:57,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554263172] [2022-01-10 01:05:57,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554263172] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:05:57,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13680098] [2022-01-10 01:05:57,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:05:57,435 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:05:57,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:05:57,436 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) [2022-01-10 01:05:57,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 01:05:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:05:57,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 01:05:57,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:05:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-10 01:05:57,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:05:57,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13680098] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:05:57,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:05:57,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-01-10 01:05:57,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589855149] [2022-01-10 01:05:57,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:05:57,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:05:57,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:05:57,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:05:57,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:05:57,766 INFO L87 Difference]: Start difference. First operand 15505 states and 21511 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 01:05:58,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:05:58,878 INFO L93 Difference]: Finished difference Result 32538 states and 45049 transitions. [2022-01-10 01:05:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:05:58,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 159 [2022-01-10 01:05:58,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:05:58,989 INFO L225 Difference]: With dead ends: 32538 [2022-01-10 01:05:58,989 INFO L226 Difference]: Without dead ends: 17045 [2022-01-10 01:05:59,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:05:59,050 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 130 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:05:59,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 374 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:05:59,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17045 states. [2022-01-10 01:05:59,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17045 to 16905. [2022-01-10 01:05:59,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16905 states, 14396 states have (on average 1.3505140316754654) internal successors, (19442), 14562 states have internal predecessors, (19442), 1358 states have call successors, (1358), 1023 states have call predecessors, (1358), 1150 states have return successors, (2111), 1335 states have call predecessors, (2111), 1356 states have call successors, (2111) [2022-01-10 01:05:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16905 states to 16905 states and 22911 transitions. [2022-01-10 01:05:59,896 INFO L78 Accepts]: Start accepts. Automaton has 16905 states and 22911 transitions. Word has length 159 [2022-01-10 01:05:59,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:05:59,896 INFO L470 AbstractCegarLoop]: Abstraction has 16905 states and 22911 transitions. [2022-01-10 01:05:59,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 01:05:59,896 INFO L276 IsEmpty]: Start isEmpty. Operand 16905 states and 22911 transitions. [2022-01-10 01:05:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 01:05:59,930 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:05:59,930 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:05:59,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 01:06:00,146 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,SelfDestructingSolverStorable11 [2022-01-10 01:06:00,146 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:06:00,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:06:00,147 INFO L85 PathProgramCache]: Analyzing trace with hash 740866845, now seen corresponding path program 1 times [2022-01-10 01:06:00,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:06:00,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417777246] [2022-01-10 01:06:00,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:00,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:06:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:00,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:06:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:00,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:06:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:00,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:06:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:00,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:06:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:00,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:06:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:00,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-10 01:06:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:00,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:00,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-01-10 01:06:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:00,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-10 01:06:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:00,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:00,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-01-10 01:06:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:00,247 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-01-10 01:06:00,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:06:00,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417777246] [2022-01-10 01:06:00,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417777246] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:06:00,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303273367] [2022-01-10 01:06:00,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:00,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:06:00,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:06:00,248 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) [2022-01-10 01:06:00,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 01:06:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:00,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 01:06:00,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:06:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 01:06:00,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:06:00,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303273367] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:06:00,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:06:00,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-01-10 01:06:00,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245541238] [2022-01-10 01:06:00,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:06:00,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:06:00,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:06:00,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:06:00,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:06:00,486 INFO L87 Difference]: Start difference. First operand 16905 states and 22911 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-10 01:06:01,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:06:01,561 INFO L93 Difference]: Finished difference Result 49878 states and 68158 transitions. [2022-01-10 01:06:01,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:06:01,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 160 [2022-01-10 01:06:01,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:06:01,663 INFO L225 Difference]: With dead ends: 49878 [2022-01-10 01:06:01,663 INFO L226 Difference]: Without dead ends: 32985 [2022-01-10 01:06:01,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:06:01,697 INFO L933 BasicCegarLoop]: 361 mSDtfsCounter, 163 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:06:01,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 549 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:06:01,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32985 states. [2022-01-10 01:06:02,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32985 to 32941. [2022-01-10 01:06:03,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32941 states, 28041 states have (on average 1.3411076637780392) internal successors, (37606), 28372 states have internal predecessors, (37606), 2637 states have call successors, (2637), 2007 states have call predecessors, (2637), 2262 states have return successors, (4710), 2593 states have call predecessors, (4710), 2635 states have call successors, (4710) [2022-01-10 01:06:03,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32941 states to 32941 states and 44953 transitions. [2022-01-10 01:06:03,112 INFO L78 Accepts]: Start accepts. Automaton has 32941 states and 44953 transitions. Word has length 160 [2022-01-10 01:06:03,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:06:03,112 INFO L470 AbstractCegarLoop]: Abstraction has 32941 states and 44953 transitions. [2022-01-10 01:06:03,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-10 01:06:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 32941 states and 44953 transitions. [2022-01-10 01:06:03,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 01:06:03,163 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:06:03,163 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:06:03,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 01:06:03,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:06:03,379 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:06:03,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:06:03,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2091960737, now seen corresponding path program 1 times [2022-01-10 01:06:03,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:06:03,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896857361] [2022-01-10 01:06:03,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:03,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:06:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:03,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:06:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:03,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:06:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:03,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:06:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:03,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:06:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:03,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:06:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:03,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-10 01:06:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:03,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:03,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-01-10 01:06:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:03,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-01-10 01:06:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:03,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:03,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-01-10 01:06:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:03,498 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-01-10 01:06:03,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:06:03,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896857361] [2022-01-10 01:06:03,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896857361] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:06:03,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498870831] [2022-01-10 01:06:03,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:03,498 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:06:03,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:06:03,499 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) [2022-01-10 01:06:03,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 01:06:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:03,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 01:06:03,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:06:03,848 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-01-10 01:06:03,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:06:03,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498870831] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:06:03,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:06:03,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-01-10 01:06:03,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409817071] [2022-01-10 01:06:03,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:06:03,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:06:03,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:06:03,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:06:03,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:06:03,850 INFO L87 Difference]: Start difference. First operand 32941 states and 44953 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 01:06:04,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:06:04,924 INFO L93 Difference]: Finished difference Result 54646 states and 75917 transitions. [2022-01-10 01:06:04,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:06:04,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 160 [2022-01-10 01:06:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:06:05,017 INFO L225 Difference]: With dead ends: 54646 [2022-01-10 01:06:05,017 INFO L226 Difference]: Without dead ends: 28066 [2022-01-10 01:06:05,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:06:05,073 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 123 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:06:05,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 222 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:06:05,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28066 states. [2022-01-10 01:06:06,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28066 to 20182. [2022-01-10 01:06:06,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20182 states, 17220 states have (on average 1.2998257839721254) internal successors, (22383), 17395 states have internal predecessors, (22383), 1597 states have call successors, (1597), 1237 states have call predecessors, (1597), 1364 states have return successors, (2530), 1565 states have call predecessors, (2530), 1595 states have call successors, (2530) [2022-01-10 01:06:06,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20182 states to 20182 states and 26510 transitions. [2022-01-10 01:06:06,169 INFO L78 Accepts]: Start accepts. Automaton has 20182 states and 26510 transitions. Word has length 160 [2022-01-10 01:06:06,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:06:06,169 INFO L470 AbstractCegarLoop]: Abstraction has 20182 states and 26510 transitions. [2022-01-10 01:06:06,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 01:06:06,170 INFO L276 IsEmpty]: Start isEmpty. Operand 20182 states and 26510 transitions. [2022-01-10 01:06:06,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 01:06:06,244 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:06:06,244 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:06:06,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-10 01:06:06,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:06:06,444 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:06:06,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:06:06,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1447536284, now seen corresponding path program 1 times [2022-01-10 01:06:06,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:06:06,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151312213] [2022-01-10 01:06:06,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:06,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:06:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:06,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:06:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:06,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:06:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:06,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:06:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:06,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:06:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:06,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:06:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:06,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-10 01:06:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:06,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:06,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-01-10 01:06:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:06,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-01-10 01:06:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:06,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:06,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-01-10 01:06:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-01-10 01:06:06,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:06:06,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151312213] [2022-01-10 01:06:06,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151312213] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:06:06,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801238264] [2022-01-10 01:06:06,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:06,543 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:06:06,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:06:06,552 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) [2022-01-10 01:06:06,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-10 01:06:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:06,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 01:06:06,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:06:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-10 01:06:06,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:06:06,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801238264] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:06:06,851 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:06:06,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-01-10 01:06:06,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983886492] [2022-01-10 01:06:06,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:06:06,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:06:06,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:06:06,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:06:06,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:06:06,852 INFO L87 Difference]: Start difference. First operand 20182 states and 26510 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-10 01:06:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:06:08,164 INFO L93 Difference]: Finished difference Result 57486 states and 76378 transitions. [2022-01-10 01:06:08,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:06:08,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 160 [2022-01-10 01:06:08,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:06:08,263 INFO L225 Difference]: With dead ends: 57486 [2022-01-10 01:06:08,263 INFO L226 Difference]: Without dead ends: 37321 [2022-01-10 01:06:08,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:06:08,305 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 150 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:06:08,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 540 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:06:08,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37321 states. [2022-01-10 01:06:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37321 to 37317. [2022-01-10 01:06:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37317 states, 31725 states have (on average 1.2904018912529551) internal successors, (40938), 32074 states have internal predecessors, (40938), 3027 states have call successors, (3027), 2309 states have call predecessors, (3027), 2564 states have return successors, (5602), 2965 states have call predecessors, (5602), 3025 states have call successors, (5602) [2022-01-10 01:06:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37317 states to 37317 states and 49567 transitions. [2022-01-10 01:06:10,369 INFO L78 Accepts]: Start accepts. Automaton has 37317 states and 49567 transitions. Word has length 160 [2022-01-10 01:06:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:06:10,369 INFO L470 AbstractCegarLoop]: Abstraction has 37317 states and 49567 transitions. [2022-01-10 01:06:10,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-10 01:06:10,369 INFO L276 IsEmpty]: Start isEmpty. Operand 37317 states and 49567 transitions. [2022-01-10 01:06:10,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 01:06:10,420 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:06:10,420 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:06:10,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-10 01:06:10,636 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,SelfDestructingSolverStorable14 [2022-01-10 01:06:10,637 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:06:10,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:06:10,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1243097865, now seen corresponding path program 1 times [2022-01-10 01:06:10,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:06:10,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271427240] [2022-01-10 01:06:10,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:10,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:06:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:10,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:06:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:10,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:06:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:10,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:06:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:10,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:06:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:10,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:06:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:10,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-10 01:06:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:10,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 01:06:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:10,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:10,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-10 01:06:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:10,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:10,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-01-10 01:06:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-01-10 01:06:10,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:06:10,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271427240] [2022-01-10 01:06:10,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271427240] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:06:10,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543651138] [2022-01-10 01:06:10,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:10,723 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:06:10,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:06:10,724 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) [2022-01-10 01:06:10,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-10 01:06:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:10,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 01:06:10,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:06:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-10 01:06:11,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:06:11,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543651138] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:06:11,064 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:06:11,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-01-10 01:06:11,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163943240] [2022-01-10 01:06:11,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:06:11,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:06:11,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:06:11,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:06:11,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:06:11,065 INFO L87 Difference]: Start difference. First operand 37317 states and 49567 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 01:06:12,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:06:12,482 INFO L93 Difference]: Finished difference Result 66696 states and 88559 transitions. [2022-01-10 01:06:12,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:06:12,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 160 [2022-01-10 01:06:12,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:06:12,590 INFO L225 Difference]: With dead ends: 66696 [2022-01-10 01:06:12,591 INFO L226 Difference]: Without dead ends: 37895 [2022-01-10 01:06:12,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:06:12,637 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 149 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 402 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 [2022-01-10 01:06:12,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 402 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:06:12,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37895 states. [2022-01-10 01:06:14,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37895 to 37317. [2022-01-10 01:06:14,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37317 states, 31725 states have (on average 1.283845547675335) internal successors, (40730), 32074 states have internal predecessors, (40730), 3027 states have call successors, (3027), 2309 states have call predecessors, (3027), 2564 states have return successors, (5602), 2965 states have call predecessors, (5602), 3025 states have call successors, (5602) [2022-01-10 01:06:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37317 states to 37317 states and 49359 transitions. [2022-01-10 01:06:14,614 INFO L78 Accepts]: Start accepts. Automaton has 37317 states and 49359 transitions. Word has length 160 [2022-01-10 01:06:14,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:06:14,615 INFO L470 AbstractCegarLoop]: Abstraction has 37317 states and 49359 transitions. [2022-01-10 01:06:14,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 01:06:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 37317 states and 49359 transitions. [2022-01-10 01:06:14,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 01:06:14,653 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:06:14,653 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:06:14,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-10 01:06:14,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-10 01:06:14,871 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:06:14,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:06:14,871 INFO L85 PathProgramCache]: Analyzing trace with hash -924686934, now seen corresponding path program 1 times [2022-01-10 01:06:14,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:06:14,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513689856] [2022-01-10 01:06:14,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:14,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:06:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:14,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:06:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:14,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:06:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:14,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:06:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:14,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:06:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:14,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:06:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:14,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-10 01:06:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:14,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 01:06:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:14,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:14,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-01-10 01:06:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:14,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:14,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-01-10 01:06:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-01-10 01:06:14,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:06:14,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513689856] [2022-01-10 01:06:14,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513689856] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:06:14,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419096902] [2022-01-10 01:06:14,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:14,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:06:14,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:06:14,990 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) [2022-01-10 01:06:14,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-10 01:06:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:15,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 01:06:15,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:06:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-10 01:06:15,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:06:15,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419096902] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:06:15,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:06:15,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-01-10 01:06:15,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74730560] [2022-01-10 01:06:15,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:06:15,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:06:15,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:06:15,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:06:15,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:06:15,405 INFO L87 Difference]: Start difference. First operand 37317 states and 49359 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 01:06:16,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:06:16,769 INFO L93 Difference]: Finished difference Result 66439 states and 87931 transitions. [2022-01-10 01:06:16,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:06:16,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 160 [2022-01-10 01:06:16,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:06:16,867 INFO L225 Difference]: With dead ends: 66439 [2022-01-10 01:06:16,867 INFO L226 Difference]: Without dead ends: 38303 [2022-01-10 01:06:17,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:06:17,022 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 148 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 415 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 [2022-01-10 01:06:17,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 415 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:06:17,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38303 states. [2022-01-10 01:06:18,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38303 to 37273. [2022-01-10 01:06:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37273 states, 31681 states have (on average 1.27767431583599) internal successors, (40478), 32030 states have internal predecessors, (40478), 3027 states have call successors, (3027), 2309 states have call predecessors, (3027), 2564 states have return successors, (5602), 2965 states have call predecessors, (5602), 3025 states have call successors, (5602) [2022-01-10 01:06:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37273 states to 37273 states and 49107 transitions. [2022-01-10 01:06:18,712 INFO L78 Accepts]: Start accepts. Automaton has 37273 states and 49107 transitions. Word has length 160 [2022-01-10 01:06:18,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:06:18,712 INFO L470 AbstractCegarLoop]: Abstraction has 37273 states and 49107 transitions. [2022-01-10 01:06:18,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 01:06:18,713 INFO L276 IsEmpty]: Start isEmpty. Operand 37273 states and 49107 transitions. [2022-01-10 01:06:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 01:06:18,746 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:06:18,746 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:06:18,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-10 01:06:18,980 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,SelfDestructingSolverStorable16 [2022-01-10 01:06:18,981 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:06:18,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:06:18,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1962226697, now seen corresponding path program 1 times [2022-01-10 01:06:18,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:06:18,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968728319] [2022-01-10 01:06:18,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:18,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:06:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:18,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:06:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:19,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:06:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:19,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:06:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:19,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:06:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:19,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:06:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:19,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-10 01:06:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:19,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 01:06:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:19,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:19,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-10 01:06:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:19,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:19,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-01-10 01:06:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:19,070 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-01-10 01:06:19,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:06:19,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968728319] [2022-01-10 01:06:19,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968728319] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:06:19,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:06:19,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:06:19,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115489830] [2022-01-10 01:06:19,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:06:19,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:06:19,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:06:19,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:06:19,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:06:19,072 INFO L87 Difference]: Start difference. First operand 37273 states and 49107 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 01:06:20,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:06:20,991 INFO L93 Difference]: Finished difference Result 73684 states and 96266 transitions. [2022-01-10 01:06:20,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 01:06:20,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 160 [2022-01-10 01:06:20,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:06:21,126 INFO L225 Difference]: With dead ends: 73684 [2022-01-10 01:06:21,127 INFO L226 Difference]: Without dead ends: 36426 [2022-01-10 01:06:21,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:06:21,214 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 295 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:06:21,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 333 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:06:21,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36426 states. [2022-01-10 01:06:22,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36426 to 33688. [2022-01-10 01:06:22,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33688 states, 28868 states have (on average 1.276880975474574) internal successors, (36861), 29506 states have internal predecessors, (36861), 2309 states have call successors, (2309), 1773 states have call predecessors, (2309), 2510 states have return successors, (4633), 2424 states have call predecessors, (4633), 2307 states have call successors, (4633) [2022-01-10 01:06:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33688 states to 33688 states and 43803 transitions. [2022-01-10 01:06:23,075 INFO L78 Accepts]: Start accepts. Automaton has 33688 states and 43803 transitions. Word has length 160 [2022-01-10 01:06:23,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:06:23,075 INFO L470 AbstractCegarLoop]: Abstraction has 33688 states and 43803 transitions. [2022-01-10 01:06:23,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 01:06:23,075 INFO L276 IsEmpty]: Start isEmpty. Operand 33688 states and 43803 transitions. [2022-01-10 01:06:23,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 01:06:23,103 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:06:23,103 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:06:23,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 01:06:23,104 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:06:23,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:06:23,104 INFO L85 PathProgramCache]: Analyzing trace with hash -32521304, now seen corresponding path program 1 times [2022-01-10 01:06:23,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:06:23,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754470360] [2022-01-10 01:06:23,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:23,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:06:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:23,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:06:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:23,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:06:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:23,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:06:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:23,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:06:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:23,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:06:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:23,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-10 01:06:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:23,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 01:06:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:23,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:23,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-01-10 01:06:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:23,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:23,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-01-10 01:06:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-01-10 01:06:23,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:06:23,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754470360] [2022-01-10 01:06:23,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754470360] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:06:23,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:06:23,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:06:23,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321250036] [2022-01-10 01:06:23,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:06:23,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:06:23,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:06:23,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:06:23,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:06:23,182 INFO L87 Difference]: Start difference. First operand 33688 states and 43803 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 01:06:24,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:06:24,634 INFO L93 Difference]: Finished difference Result 61428 states and 79737 transitions. [2022-01-10 01:06:24,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 01:06:24,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 160 [2022-01-10 01:06:24,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:06:24,712 INFO L225 Difference]: With dead ends: 61428 [2022-01-10 01:06:24,712 INFO L226 Difference]: Without dead ends: 27751 [2022-01-10 01:06:24,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:06:24,756 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 295 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:06:24,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 331 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:06:24,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27751 states. [2022-01-10 01:06:25,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27751 to 25142. [2022-01-10 01:06:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25142 states, 21588 states have (on average 1.2871965906985363) internal successors, (27788), 22035 states have internal predecessors, (27788), 1719 states have call successors, (1719), 1327 states have call predecessors, (1719), 1834 states have return successors, (3243), 1787 states have call predecessors, (3243), 1717 states have call successors, (3243) [2022-01-10 01:06:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25142 states to 25142 states and 32750 transitions. [2022-01-10 01:06:25,991 INFO L78 Accepts]: Start accepts. Automaton has 25142 states and 32750 transitions. Word has length 160 [2022-01-10 01:06:25,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:06:25,991 INFO L470 AbstractCegarLoop]: Abstraction has 25142 states and 32750 transitions. [2022-01-10 01:06:25,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 01:06:25,991 INFO L276 IsEmpty]: Start isEmpty. Operand 25142 states and 32750 transitions. [2022-01-10 01:06:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-10 01:06:26,014 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:06:26,014 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:06:26,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 01:06:26,014 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:06:26,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:06:26,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1152046593, now seen corresponding path program 1 times [2022-01-10 01:06:26,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:06:26,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239954408] [2022-01-10 01:06:26,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:26,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:06:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:26,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:06:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:26,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:06:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:26,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:06:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:26,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:06:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:26,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:06:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:26,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-01-10 01:06:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:26,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-10 01:06:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:26,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:26,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-01-10 01:06:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:26,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:26,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-10 01:06:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-01-10 01:06:26,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:06:26,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239954408] [2022-01-10 01:06:26,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239954408] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:06:26,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581556225] [2022-01-10 01:06:26,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:26,098 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:06:26,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:06:26,099 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) [2022-01-10 01:06:26,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-10 01:06:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:26,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 01:06:26,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:06:26,359 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-10 01:06:26,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:06:26,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581556225] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:06:26,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:06:26,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-01-10 01:06:26,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615992065] [2022-01-10 01:06:26,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:06:26,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:06:26,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:06:26,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:06:26,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:06:26,361 INFO L87 Difference]: Start difference. First operand 25142 states and 32750 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-10 01:06:27,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:06:27,304 INFO L93 Difference]: Finished difference Result 42267 states and 56594 transitions. [2022-01-10 01:06:27,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:06:27,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 162 [2022-01-10 01:06:27,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:06:27,454 INFO L225 Difference]: With dead ends: 42267 [2022-01-10 01:06:27,454 INFO L226 Difference]: Without dead ends: 25260 [2022-01-10 01:06:27,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:06:27,480 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 142 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:06:27,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 461 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:06:27,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25260 states. [2022-01-10 01:06:28,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25260 to 25142. [2022-01-10 01:06:28,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25142 states, 21588 states have (on average 1.2639429312581063) internal successors, (27286), 22035 states have internal predecessors, (27286), 1719 states have call successors, (1719), 1327 states have call predecessors, (1719), 1834 states have return successors, (3243), 1787 states have call predecessors, (3243), 1717 states have call successors, (3243) [2022-01-10 01:06:28,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25142 states to 25142 states and 32248 transitions. [2022-01-10 01:06:28,634 INFO L78 Accepts]: Start accepts. Automaton has 25142 states and 32248 transitions. Word has length 162 [2022-01-10 01:06:28,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:06:28,634 INFO L470 AbstractCegarLoop]: Abstraction has 25142 states and 32248 transitions. [2022-01-10 01:06:28,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-10 01:06:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 25142 states and 32248 transitions. [2022-01-10 01:06:28,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-10 01:06:28,651 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:06:28,651 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:06:28,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-10 01:06:28,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:06:28,869 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:06:28,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:06:28,869 INFO L85 PathProgramCache]: Analyzing trace with hash 179847711, now seen corresponding path program 1 times [2022-01-10 01:06:28,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:06:28,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078970410] [2022-01-10 01:06:28,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:28,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:06:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:28,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:06:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:28,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:06:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:28,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:06:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:28,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:06:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:28,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:06:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:28,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-01-10 01:06:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:28,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-10 01:06:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:28,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:28,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-01-10 01:06:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:28,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:28,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-10 01:06:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-01-10 01:06:28,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:06:28,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078970410] [2022-01-10 01:06:28,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078970410] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:06:28,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792947808] [2022-01-10 01:06:28,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:28,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:06:28,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:06:28,996 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) [2022-01-10 01:06:28,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-10 01:06:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:29,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 01:06:29,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:06:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 01:06:29,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:06:29,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792947808] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:06:29,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:06:29,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-01-10 01:06:29,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532958132] [2022-01-10 01:06:29,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:06:29,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:06:29,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:06:29,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:06:29,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:06:29,250 INFO L87 Difference]: Start difference. First operand 25142 states and 32248 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 01:06:30,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:06:30,217 INFO L93 Difference]: Finished difference Result 47063 states and 61427 transitions. [2022-01-10 01:06:30,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:06:30,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 162 [2022-01-10 01:06:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:06:30,266 INFO L225 Difference]: With dead ends: 47063 [2022-01-10 01:06:30,266 INFO L226 Difference]: Without dead ends: 23084 [2022-01-10 01:06:30,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:06:30,303 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 163 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:06:30,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 220 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:06:30,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23084 states. [2022-01-10 01:06:31,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23084 to 21819. [2022-01-10 01:06:31,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21819 states, 18787 states have (on average 1.2295204130515782) internal successors, (23099), 19154 states have internal predecessors, (23099), 1471 states have call successors, (1471), 1139 states have call predecessors, (1471), 1560 states have return successors, (2573), 1529 states have call predecessors, (2573), 1469 states have call successors, (2573) [2022-01-10 01:06:31,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21819 states to 21819 states and 27143 transitions. [2022-01-10 01:06:31,409 INFO L78 Accepts]: Start accepts. Automaton has 21819 states and 27143 transitions. Word has length 162 [2022-01-10 01:06:31,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:06:31,409 INFO L470 AbstractCegarLoop]: Abstraction has 21819 states and 27143 transitions. [2022-01-10 01:06:31,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 01:06:31,409 INFO L276 IsEmpty]: Start isEmpty. Operand 21819 states and 27143 transitions. [2022-01-10 01:06:31,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-10 01:06:31,422 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:06:31,422 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:06:31,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-10 01:06:31,636 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,SelfDestructingSolverStorable20 [2022-01-10 01:06:31,636 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:06:31,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:06:31,636 INFO L85 PathProgramCache]: Analyzing trace with hash -841833728, now seen corresponding path program 1 times [2022-01-10 01:06:31,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:06:31,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050067082] [2022-01-10 01:06:31,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:31,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:06:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:31,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:06:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:31,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:06:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:31,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:06:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:31,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:06:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:31,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:06:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:31,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-01-10 01:06:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:31,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-10 01:06:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:31,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:31,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-01-10 01:06:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:31,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:31,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-10 01:06:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-01-10 01:06:31,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:06:31,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050067082] [2022-01-10 01:06:31,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050067082] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:06:31,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459760334] [2022-01-10 01:06:31,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:31,712 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:06:31,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:06:31,713 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) [2022-01-10 01:06:31,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-10 01:06:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:31,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 01:06:31,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:06:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 01:06:31,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:06:31,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459760334] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:06:31,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:06:31,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-01-10 01:06:31,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361268088] [2022-01-10 01:06:31,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:06:31,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:06:31,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:06:31,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:06:31,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:06:31,996 INFO L87 Difference]: Start difference. First operand 21819 states and 27143 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-10 01:06:32,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:06:32,872 INFO L93 Difference]: Finished difference Result 37441 states and 47801 transitions. [2022-01-10 01:06:32,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:06:32,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 162 [2022-01-10 01:06:32,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:06:32,918 INFO L225 Difference]: With dead ends: 37441 [2022-01-10 01:06:32,918 INFO L226 Difference]: Without dead ends: 21923 [2022-01-10 01:06:32,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:06:32,944 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 135 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:06:32,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 503 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:06:32,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21923 states. [2022-01-10 01:06:33,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21923 to 21819. [2022-01-10 01:06:33,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21819 states, 18787 states have (on average 1.2024804386011603) internal successors, (22591), 19154 states have internal predecessors, (22591), 1471 states have call successors, (1471), 1139 states have call predecessors, (1471), 1560 states have return successors, (2573), 1529 states have call predecessors, (2573), 1469 states have call successors, (2573) [2022-01-10 01:06:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21819 states to 21819 states and 26635 transitions. [2022-01-10 01:06:33,887 INFO L78 Accepts]: Start accepts. Automaton has 21819 states and 26635 transitions. Word has length 162 [2022-01-10 01:06:33,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:06:33,887 INFO L470 AbstractCegarLoop]: Abstraction has 21819 states and 26635 transitions. [2022-01-10 01:06:33,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-10 01:06:33,887 INFO L276 IsEmpty]: Start isEmpty. Operand 21819 states and 26635 transitions. [2022-01-10 01:06:33,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-10 01:06:33,900 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:06:33,900 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:06:33,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-10 01:06:34,107 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,SelfDestructingSolverStorable21 [2022-01-10 01:06:34,107 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:06:34,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:06:34,108 INFO L85 PathProgramCache]: Analyzing trace with hash -292288290, now seen corresponding path program 1 times [2022-01-10 01:06:34,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:06:34,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904935496] [2022-01-10 01:06:34,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:34,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:06:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:34,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:06:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:34,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:06:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:34,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:06:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:34,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:06:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:34,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:06:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:34,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-01-10 01:06:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:34,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-10 01:06:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:34,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:34,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-01-10 01:06:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:34,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:34,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-01-10 01:06:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:34,204 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-01-10 01:06:34,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:06:34,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904935496] [2022-01-10 01:06:34,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904935496] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:06:34,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637284637] [2022-01-10 01:06:34,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:34,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:06:34,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:06:34,205 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) [2022-01-10 01:06:34,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-10 01:06:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:34,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 01:06:34,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:06:34,556 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 01:06:34,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:06:34,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637284637] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:06:34,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:06:34,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-01-10 01:06:34,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109994044] [2022-01-10 01:06:34,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:06:34,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:06:34,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:06:34,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:06:34,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:06:34,558 INFO L87 Difference]: Start difference. First operand 21819 states and 26635 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 01:06:35,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:06:35,338 INFO L93 Difference]: Finished difference Result 35688 states and 44707 transitions. [2022-01-10 01:06:35,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:06:35,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 163 [2022-01-10 01:06:35,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:06:35,389 INFO L225 Difference]: With dead ends: 35688 [2022-01-10 01:06:35,389 INFO L226 Difference]: Without dead ends: 21867 [2022-01-10 01:06:35,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:06:35,419 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 156 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:06:35,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 463 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:06:35,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21867 states. [2022-01-10 01:06:36,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21867 to 21819. [2022-01-10 01:06:36,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21819 states, 18787 states have (on average 1.1889604513759515) internal successors, (22337), 19154 states have internal predecessors, (22337), 1471 states have call successors, (1471), 1139 states have call predecessors, (1471), 1560 states have return successors, (2573), 1529 states have call predecessors, (2573), 1469 states have call successors, (2573) [2022-01-10 01:06:36,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21819 states to 21819 states and 26381 transitions. [2022-01-10 01:06:36,318 INFO L78 Accepts]: Start accepts. Automaton has 21819 states and 26381 transitions. Word has length 163 [2022-01-10 01:06:36,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:06:36,318 INFO L470 AbstractCegarLoop]: Abstraction has 21819 states and 26381 transitions. [2022-01-10 01:06:36,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 01:06:36,318 INFO L276 IsEmpty]: Start isEmpty. Operand 21819 states and 26381 transitions. [2022-01-10 01:06:36,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-01-10 01:06:36,331 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:06:36,331 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:06:36,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-01-10 01:06:36,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:06:36,538 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:06:36,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:06:36,538 INFO L85 PathProgramCache]: Analyzing trace with hash 327768535, now seen corresponding path program 1 times [2022-01-10 01:06:36,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:06:36,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941676529] [2022-01-10 01:06:36,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:36,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:06:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:36,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:06:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:36,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:06:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:36,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:06:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:36,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:06:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:36,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:06:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:36,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-01-10 01:06:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:36,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-10 01:06:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:36,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:36,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-01-10 01:06:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:36,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:36,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-10 01:06:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-01-10 01:06:36,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:06:36,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941676529] [2022-01-10 01:06:36,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941676529] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:06:36,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948754023] [2022-01-10 01:06:36,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:36,612 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:06:36,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:06:36,613 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) [2022-01-10 01:06:36,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-10 01:06:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:36,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 01:06:36,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:06:36,933 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-01-10 01:06:36,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:06:36,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948754023] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:06:36,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:06:36,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-01-10 01:06:36,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859084401] [2022-01-10 01:06:36,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:06:36,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:06:36,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:06:36,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:06:36,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-10 01:06:36,934 INFO L87 Difference]: Start difference. First operand 21819 states and 26381 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:06:37,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:06:37,673 INFO L93 Difference]: Finished difference Result 30074 states and 36610 transitions. [2022-01-10 01:06:37,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 01:06:37,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 164 [2022-01-10 01:06:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:06:37,710 INFO L225 Difference]: With dead ends: 30074 [2022-01-10 01:06:37,710 INFO L226 Difference]: Without dead ends: 15972 [2022-01-10 01:06:37,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-01-10 01:06:37,734 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 187 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:06:37,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 347 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:06:37,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15972 states. [2022-01-10 01:06:38,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15972 to 15912. [2022-01-10 01:06:38,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15912 states, 13716 states have (on average 1.17198891805191) internal successors, (16075), 13964 states have internal predecessors, (16075), 1077 states have call successors, (1077), 829 states have call predecessors, (1077), 1118 states have return successors, (1821), 1120 states have call predecessors, (1821), 1075 states have call successors, (1821) [2022-01-10 01:06:38,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15912 states to 15912 states and 18973 transitions. [2022-01-10 01:06:38,506 INFO L78 Accepts]: Start accepts. Automaton has 15912 states and 18973 transitions. Word has length 164 [2022-01-10 01:06:38,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:06:38,506 INFO L470 AbstractCegarLoop]: Abstraction has 15912 states and 18973 transitions. [2022-01-10 01:06:38,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:06:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 15912 states and 18973 transitions. [2022-01-10 01:06:38,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-01-10 01:06:38,514 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:06:38,514 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:06:38,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-10 01:06:38,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:06:38,727 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:06:38,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:06:38,728 INFO L85 PathProgramCache]: Analyzing trace with hash 815815641, now seen corresponding path program 1 times [2022-01-10 01:06:38,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:06:38,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103744023] [2022-01-10 01:06:38,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:38,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:06:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:38,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:06:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:38,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:06:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:38,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:06:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:38,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:06:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:38,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:06:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:38,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-01-10 01:06:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:38,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-10 01:06:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:38,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:38,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-01-10 01:06:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:38,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:38,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-10 01:06:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:38,795 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-01-10 01:06:38,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:06:38,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103744023] [2022-01-10 01:06:38,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103744023] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:06:38,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521667443] [2022-01-10 01:06:38,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:38,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:06:38,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:06:38,797 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) [2022-01-10 01:06:38,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-10 01:06:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:38,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 01:06:38,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:06:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-01-10 01:06:39,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:06:39,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521667443] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:06:39,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:06:39,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-01-10 01:06:39,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215212044] [2022-01-10 01:06:39,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:06:39,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:06:39,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:06:39,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:06:39,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:06:39,067 INFO L87 Difference]: Start difference. First operand 15912 states and 18973 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:06:39,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:06:39,746 INFO L93 Difference]: Finished difference Result 29801 states and 36019 transitions. [2022-01-10 01:06:39,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 01:06:39,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 164 [2022-01-10 01:06:39,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:06:39,778 INFO L225 Difference]: With dead ends: 29801 [2022-01-10 01:06:39,778 INFO L226 Difference]: Without dead ends: 13900 [2022-01-10 01:06:39,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:06:39,804 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 87 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:06:39,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 736 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:06:39,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13900 states. [2022-01-10 01:06:40,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13900 to 13328. [2022-01-10 01:06:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13328 states, 11381 states have (on average 1.1476144451278447) internal successors, (13061), 11591 states have internal predecessors, (13061), 958 states have call successors, (958), 737 states have call predecessors, (958), 988 states have return successors, (1535), 1001 states have call predecessors, (1535), 956 states have call successors, (1535) [2022-01-10 01:06:40,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13328 states to 13328 states and 15554 transitions. [2022-01-10 01:06:40,531 INFO L78 Accepts]: Start accepts. Automaton has 13328 states and 15554 transitions. Word has length 164 [2022-01-10 01:06:40,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:06:40,531 INFO L470 AbstractCegarLoop]: Abstraction has 13328 states and 15554 transitions. [2022-01-10 01:06:40,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:06:40,532 INFO L276 IsEmpty]: Start isEmpty. Operand 13328 states and 15554 transitions. [2022-01-10 01:06:40,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-01-10 01:06:40,536 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:06:40,536 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:06:40,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-10 01:06:40,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-01-10 01:06:40,753 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:06:40,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:06:40,754 INFO L85 PathProgramCache]: Analyzing trace with hash -950903894, now seen corresponding path program 1 times [2022-01-10 01:06:40,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:06:40,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637292775] [2022-01-10 01:06:40,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:40,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:06:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:40,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:06:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:40,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:06:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:40,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:06:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:40,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:06:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:40,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:06:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:40,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-01-10 01:06:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:40,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-10 01:06:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:40,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:40,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-01-10 01:06:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:40,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:40,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-10 01:06:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-01-10 01:06:40,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:06:40,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637292775] [2022-01-10 01:06:40,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637292775] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:06:40,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677886173] [2022-01-10 01:06:40,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:40,825 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:06:40,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:06:40,826 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) [2022-01-10 01:06:40,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-10 01:06:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:40,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 01:06:40,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:06:41,119 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-01-10 01:06:41,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:06:41,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677886173] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:06:41,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:06:41,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-01-10 01:06:41,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480926663] [2022-01-10 01:06:41,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:06:41,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:06:41,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:06:41,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:06:41,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:06:41,121 INFO L87 Difference]: Start difference. First operand 13328 states and 15554 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:06:41,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:06:41,775 INFO L93 Difference]: Finished difference Result 24593 states and 29078 transitions. [2022-01-10 01:06:41,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 01:06:41,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 164 [2022-01-10 01:06:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:06:41,796 INFO L225 Difference]: With dead ends: 24593 [2022-01-10 01:06:41,796 INFO L226 Difference]: Without dead ends: 11276 [2022-01-10 01:06:41,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:06:41,811 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 49 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:06:41,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 726 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:06:41,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11276 states. [2022-01-10 01:06:42,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11276 to 10980. [2022-01-10 01:06:42,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10980 states, 9342 states have (on average 1.1294155427103405) internal successors, (10551), 9502 states have internal predecessors, (10551), 815 states have call successors, (815), 621 states have call predecessors, (815), 822 states have return successors, (1201), 858 states have call predecessors, (1201), 813 states have call successors, (1201) [2022-01-10 01:06:42,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10980 states to 10980 states and 12567 transitions. [2022-01-10 01:06:42,327 INFO L78 Accepts]: Start accepts. Automaton has 10980 states and 12567 transitions. Word has length 164 [2022-01-10 01:06:42,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:06:42,328 INFO L470 AbstractCegarLoop]: Abstraction has 10980 states and 12567 transitions. [2022-01-10 01:06:42,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:06:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 10980 states and 12567 transitions. [2022-01-10 01:06:42,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-01-10 01:06:42,332 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:06:42,332 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:06:42,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-01-10 01:06:42,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-10 01:06:42,548 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:06:42,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:06:42,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1119292316, now seen corresponding path program 1 times [2022-01-10 01:06:42,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:06:42,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132123754] [2022-01-10 01:06:42,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:42,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:06:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:42,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:06:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:42,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:06:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:42,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:06:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:42,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:06:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:42,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:06:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:42,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-01-10 01:06:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:42,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-10 01:06:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:42,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:42,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-01-10 01:06:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:42,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:42,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-10 01:06:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-01-10 01:06:42,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:06:42,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132123754] [2022-01-10 01:06:42,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132123754] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:06:42,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94088075] [2022-01-10 01:06:42,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:42,642 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:06:42,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:06:42,646 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) [2022-01-10 01:06:42,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-01-10 01:06:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:42,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 01:06:42,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:06:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-01-10 01:06:42,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:06:42,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94088075] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:06:42,928 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:06:42,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-01-10 01:06:42,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103847851] [2022-01-10 01:06:42,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:06:42,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:06:42,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:06:42,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:06:42,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:06:42,929 INFO L87 Difference]: Start difference. First operand 10980 states and 12567 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:06:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:06:43,204 INFO L93 Difference]: Finished difference Result 16293 states and 18722 transitions. [2022-01-10 01:06:43,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 01:06:43,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 164 [2022-01-10 01:06:43,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:06:43,211 INFO L225 Difference]: With dead ends: 16293 [2022-01-10 01:06:43,211 INFO L226 Difference]: Without dead ends: 3288 [2022-01-10 01:06:43,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:06:43,224 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 10 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:06:43,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 711 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:06:43,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2022-01-10 01:06:43,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 3288. [2022-01-10 01:06:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3288 states, 2793 states have (on average 1.1016827783745078) internal successors, (3077), 2815 states have internal predecessors, (3077), 278 states have call successors, (278), 201 states have call predecessors, (278), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2022-01-10 01:06:43,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 3656 transitions. [2022-01-10 01:06:43,484 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 3656 transitions. Word has length 164 [2022-01-10 01:06:43,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:06:43,484 INFO L470 AbstractCegarLoop]: Abstraction has 3288 states and 3656 transitions. [2022-01-10 01:06:43,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:06:43,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 3656 transitions. [2022-01-10 01:06:43,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-01-10 01:06:43,486 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:06:43,486 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 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] [2022-01-10 01:06:43,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-01-10 01:06:43,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-01-10 01:06:43,699 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:06:43,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:06:43,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1437280244, now seen corresponding path program 1 times [2022-01-10 01:06:43,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:06:43,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662538286] [2022-01-10 01:06:43,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:43,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:06:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:43,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:06:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:43,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:06:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:43,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:06:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:43,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:06:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:43,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:06:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:43,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 01:06:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:43,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-01-10 01:06:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:43,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:43,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-01-10 01:06:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:43,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:43,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-01-10 01:06:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:43,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:43,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-01-10 01:06:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-01-10 01:06:43,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:06:43,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662538286] [2022-01-10 01:06:43,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662538286] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:06:43,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:06:43,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:06:43,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784376583] [2022-01-10 01:06:43,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:06:43,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:06:43,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:06:43,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:06:43,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:06:43,798 INFO L87 Difference]: Start difference. First operand 3288 states and 3656 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-01-10 01:06:44,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:06:44,521 INFO L93 Difference]: Finished difference Result 3506 states and 3881 transitions. [2022-01-10 01:06:44,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 01:06:44,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 202 [2022-01-10 01:06:44,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:06:44,528 INFO L225 Difference]: With dead ends: 3506 [2022-01-10 01:06:44,528 INFO L226 Difference]: Without dead ends: 3503 [2022-01-10 01:06:44,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-01-10 01:06:44,529 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 676 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 01:06:44,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [709 Valid, 897 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 01:06:44,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2022-01-10 01:06:44,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 3287. [2022-01-10 01:06:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3287 states, 2793 states have (on average 1.100250626566416) internal successors, (3073), 2814 states have internal predecessors, (3073), 277 states have call successors, (277), 201 states have call predecessors, (277), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2022-01-10 01:06:44,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 3287 states and 3651 transitions. [2022-01-10 01:06:44,694 INFO L78 Accepts]: Start accepts. Automaton has 3287 states and 3651 transitions. Word has length 202 [2022-01-10 01:06:44,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:06:44,694 INFO L470 AbstractCegarLoop]: Abstraction has 3287 states and 3651 transitions. [2022-01-10 01:06:44,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-01-10 01:06:44,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3287 states and 3651 transitions. [2022-01-10 01:06:44,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-01-10 01:06:44,697 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:06:44,697 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 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] [2022-01-10 01:06:44,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 01:06:44,697 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:06:44,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:06:44,697 INFO L85 PathProgramCache]: Analyzing trace with hash -611652260, now seen corresponding path program 1 times [2022-01-10 01:06:44,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:06:44,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894388870] [2022-01-10 01:06:44,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:44,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:06:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:44,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:06:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:44,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:06:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:44,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 01:06:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:44,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 01:06:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:44,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-10 01:06:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:44,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 01:06:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:44,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-01-10 01:06:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:44,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:44,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-01-10 01:06:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:44,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:44,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-01-10 01:06:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:44,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:06:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:44,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-01-10 01:06:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:06:44,752 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-01-10 01:06:44,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:06:44,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894388870] [2022-01-10 01:06:44,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894388870] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:06:44,752 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:06:44,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:06:44,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951101109] [2022-01-10 01:06:44,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:06:44,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:06:44,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:06:44,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:06:44,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:06:44,753 INFO L87 Difference]: Start difference. First operand 3287 states and 3651 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-10 01:06:45,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:06:45,124 INFO L93 Difference]: Finished difference Result 5330 states and 6022 transitions. [2022-01-10 01:06:45,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 01:06:45,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 206 [2022-01-10 01:06:45,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:06:45,132 INFO L225 Difference]: With dead ends: 5330 [2022-01-10 01:06:45,132 INFO L226 Difference]: Without dead ends: 3951 [2022-01-10 01:06:45,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:06:45,134 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 195 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:06:45,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 560 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:06:45,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2022-01-10 01:06:45,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3291. [2022-01-10 01:06:45,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3291 states, 2797 states have (on average 1.1001072577761888) internal successors, (3077), 2818 states have internal predecessors, (3077), 277 states have call successors, (277), 201 states have call predecessors, (277), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2022-01-10 01:06:45,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3291 states to 3291 states and 3655 transitions. [2022-01-10 01:06:45,349 INFO L78 Accepts]: Start accepts. Automaton has 3291 states and 3655 transitions. Word has length 206 [2022-01-10 01:06:45,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:06:45,350 INFO L470 AbstractCegarLoop]: Abstraction has 3291 states and 3655 transitions. [2022-01-10 01:06:45,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-10 01:06:45,350 INFO L276 IsEmpty]: Start isEmpty. Operand 3291 states and 3655 transitions. [2022-01-10 01:06:45,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-01-10 01:06:45,352 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:06:45,352 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 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] [2022-01-10 01:06:45,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 01:06:45,352 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:06:45,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:06:45,353 INFO L85 PathProgramCache]: Analyzing trace with hash -552168776, now seen corresponding path program 1 times [2022-01-10 01:06:45,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:06:45,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450112640] [2022-01-10 01:06:45,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:06:45,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:06:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 01:06:45,366 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 01:06:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 01:06:45,433 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 01:06:45,433 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 01:06:45,434 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 01:06:45,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 01:06:45,439 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:06:45,441 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 01:06:45,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:06:45 BoogieIcfgContainer [2022-01-10 01:06:45,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 01:06:45,570 INFO L158 Benchmark]: Toolchain (without parser) took 60060.91ms. Allocated memory was 195.0MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 137.8MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-01-10 01:06:45,570 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 195.0MB. Free memory is still 154.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 01:06:45,570 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.46ms. Allocated memory was 195.0MB in the beginning and 257.9MB in the end (delta: 62.9MB). Free memory was 137.5MB in the beginning and 228.7MB in the end (delta: -91.1MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-01-10 01:06:45,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.64ms. Allocated memory is still 257.9MB. Free memory was 228.7MB in the beginning and 226.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 01:06:45,572 INFO L158 Benchmark]: Boogie Preprocessor took 17.58ms. Allocated memory is still 257.9MB. Free memory was 226.6MB in the beginning and 225.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 01:06:45,572 INFO L158 Benchmark]: RCFGBuilder took 377.27ms. Allocated memory is still 257.9MB. Free memory was 225.0MB in the beginning and 205.1MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-01-10 01:06:45,574 INFO L158 Benchmark]: TraceAbstraction took 59359.87ms. Allocated memory was 257.9MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 204.6MB in the beginning and 5.6GB in the end (delta: -5.4GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-01-10 01:06:45,577 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 195.0MB. Free memory is still 154.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 273.46ms. Allocated memory was 195.0MB in the beginning and 257.9MB in the end (delta: 62.9MB). Free memory was 137.5MB in the beginning and 228.7MB in the end (delta: -91.1MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.64ms. Allocated memory is still 257.9MB. Free memory was 228.7MB in the beginning and 226.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.58ms. Allocated memory is still 257.9MB. Free memory was 226.6MB in the beginning and 225.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 377.27ms. Allocated memory is still 257.9MB. Free memory was 225.0MB in the beginning and 205.1MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 59359.87ms. Allocated memory was 257.9MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 204.6MB in the beginning and 5.6GB in the end (delta: -5.4GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * 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: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int t2_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int t2_st ; [L30] int m_i ; [L31] int t1_i ; [L32] int t2_i ; [L33] int M_E = 2; [L34] int T1_E = 2; [L35] int T2_E = 2; [L36] int E_M = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L43] int token ; [L45] int local ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L610] int __retres1 ; [L614] CALL init_model() [L524] m_i = 1 [L525] t1_i = 1 [L526] t2_i = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L614] RET init_model() [L615] CALL start_simulation() [L551] int kernel_st ; [L552] int tmp ; [L553] int tmp___0 ; [L557] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L558] FCALL update_channels() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L559] CALL init_threads() [L243] COND TRUE m_i == 1 [L244] m_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L248] COND TRUE t1_i == 1 [L249] t1_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L253] COND TRUE t2_i == 1 [L254] t2_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L559] RET init_threads() [L560] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L356] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L361] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L366] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L371] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L376] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L381] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L560] RET fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L561] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L188] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L190] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L207] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L209] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L226] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L228] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L561] RET activate_threads() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L562] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L394] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L399] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L404] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L409] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L414] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L419] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L562] RET reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L565] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L568] kernel_st = 1 [L569] CALL eval() [L289] int tmp ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L263] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 [L323] CALL transmit1() [L106] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L117] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L119] t1_pc = 1 [L120] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L323] RET transmit1() [L331] COND TRUE t2_st == 0 [L332] int tmp_ndt_3; [L333] tmp_ndt_3 = __VERIFIER_nondet_int() [L334] COND TRUE \read(tmp_ndt_3) [L336] t2_st = 1 [L337] CALL transmit2() [L142] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L153] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L155] t2_pc = 1 [L156] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L337] RET transmit2() [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L296] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L263] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L284] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L296] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND TRUE \read(tmp_ndt_1) [L308] m_st = 1 [L309] CALL master() [L48] int tmp_var = __VERIFIER_nondet_int(); [L50] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L61] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L64] token = __VERIFIER_nondet_int() [L65] local = token [L66] E_1 = 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L67] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L467] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L178] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L188] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L190] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L197] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L198] COND TRUE E_1 == 1 [L199] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L209] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, __retres1=1, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND TRUE \read(tmp___0) [L446] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L216] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L217] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L226] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L228] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L467] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L67] RET immediate_notify() VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L68] E_1 = 2 [L69] m_pc = 1 [L70] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L309] RET master() [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 [L323] CALL transmit1() [L106] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L109] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L125] token += 1 [L126] E_2 = 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L127] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L467] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L178] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L179] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L188] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L190] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L197] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L198] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L207] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L209] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L216] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L217] COND TRUE E_2 == 1 [L218] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L228] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, __retres1=1, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND TRUE \read(tmp___1) [L454] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L467] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L127] RET immediate_notify() VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L128] E_2 = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L117] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L119] t1_pc = 1 [L120] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L323] RET transmit1() [L331] COND TRUE t2_st == 0 [L332] int tmp_ndt_3; [L333] tmp_ndt_3 = __VERIFIER_nondet_int() [L334] COND TRUE \read(tmp_ndt_3) [L336] t2_st = 1 [L337] CALL transmit2() [L142] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L145] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L161] token += 1 [L162] E_M = 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L163] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L467] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L178] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L179] COND TRUE E_M == 1 [L180] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L190] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=1, __retres1=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND TRUE \read(tmp) [L438] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L197] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L198] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L207] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L209] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L216] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L217] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L226] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L228] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L467] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L163] RET immediate_notify() VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L164] E_M = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L153] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L155] t2_pc = 1 [L156] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L337] RET transmit2() [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L296] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L263] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L284] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L296] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND TRUE \read(tmp_ndt_1) [L308] m_st = 1 [L309] CALL master() [L48] int tmp_var = __VERIFIER_nondet_int(); [L50] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L53] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L75] COND FALSE !(token != local + 2) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L80] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L81] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L86] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L87] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L88] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L89] CALL error() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L20] reach_error() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 140 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 59.2s, OverallIterations: 30, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 25.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6896 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6723 mSDsluCounter, 15612 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8381 mSDsCounter, 787 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6492 IncrementalHoareTripleChecker+Invalid, 7279 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 787 mSolverCounterUnsat, 7231 mSDtfsCounter, 6492 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3580 GetRequests, 3347 SyntacticMatches, 6 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37317occurred in iteration=15, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.0s AutomataMinimizationTime, 29 MinimizatonAttempts, 20431 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 6981 NumberOfCodeBlocks, 6981 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 6727 ConstructedInterpolants, 0 QuantifiedInterpolants, 10949 SizeOfPredicates, 9 NumberOfNonLiveVariables, 8988 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 47 InterpolantComputations, 29 PerfectInterpolantSequences, 3368/3904 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-10 01:06:45,612 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...