/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/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf -i ../../../trunk/examples/svcomp/combinations/Problem05_label42+token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 07:02:59,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 07:02:59,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 07:02:59,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 07:02:59,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 07:02:59,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 07:02:59,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 07:02:59,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 07:02:59,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 07:02:59,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 07:02:59,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 07:02:59,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 07:02:59,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 07:02:59,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 07:02:59,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 07:02:59,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 07:02:59,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 07:02:59,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 07:02:59,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 07:02:59,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 07:02:59,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 07:02:59,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 07:02:59,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 07:02:59,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 07:02:59,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 07:02:59,265 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 07:02:59,265 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 07:02:59,266 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 07:02:59,266 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 07:02:59,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 07:02:59,267 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 07:02:59,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 07:02:59,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 07:02:59,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 07:02:59,268 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 07:02:59,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 07:02:59,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 07:02:59,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 07:02:59,269 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 07:02:59,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 07:02:59,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 07:02:59,274 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 07:02:59,292 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 07:02:59,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 07:02:59,292 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 07:02:59,292 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 07:02:59,293 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 07:02:59,293 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 07:02:59,293 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 07:02:59,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 07:02:59,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 07:02:59,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 07:02:59,293 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 07:02:59,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 07:02:59,294 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 07:02:59,294 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 07:02:59,294 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 07:02:59,294 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 07:02:59,294 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 07:02:59,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 07:02:59,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 07:02:59,294 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 07:02:59,294 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 07:02:59,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 07:02:59,294 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 07:02:59,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 07:02:59,295 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 07:02:59,295 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 07:02:59,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 07:02:59,296 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 07:02:59,296 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 07:02:59,296 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 07:02:59,296 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 07:02:59,297 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 07:02:59,297 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 07:02:59,297 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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-11 07:02:59,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 07:02:59,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 07:02:59,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 07:02:59,509 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 07:02:59,511 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 07:02:59,512 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/Problem05_label42+token_ring.02.cil-2.c [2022-01-11 07:02:59,571 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/977af2ec4/3afb3eb01a764ba9967123337a2566c6/FLAG4a5a12cb5 [2022-01-11 07:03:00,234 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 07:03:00,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label42+token_ring.02.cil-2.c [2022-01-11 07:03:00,281 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/977af2ec4/3afb3eb01a764ba9967123337a2566c6/FLAG4a5a12cb5 [2022-01-11 07:03:00,316 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/977af2ec4/3afb3eb01a764ba9967123337a2566c6 [2022-01-11 07:03:00,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 07:03:00,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 07:03:00,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 07:03:00,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 07:03:00,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 07:03:00,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 07:03:00" (1/1) ... [2022-01-11 07:03:00,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67b6f4ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:03:00, skipping insertion in model container [2022-01-11 07:03:00,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 07:03:00" (1/1) ... [2022-01-11 07:03:00,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 07:03:00,466 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 07:03:01,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label42+token_ring.02.cil-2.c[378560,378573] [2022-01-11 07:03:01,867 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label42+token_ring.02.cil-2.c[383339,383352] [2022-01-11 07:03:01,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 07:03:01,986 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 07:03:02,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label42+token_ring.02.cil-2.c[378560,378573] [2022-01-11 07:03:02,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label42+token_ring.02.cil-2.c[383339,383352] [2022-01-11 07:03:02,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 07:03:02,748 INFO L208 MainTranslator]: Completed translation [2022-01-11 07:03:02,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:03:02 WrapperNode [2022-01-11 07:03:02,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 07:03:02,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 07:03:02,750 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 07:03:02,750 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 07:03:02,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:03:02" (1/1) ... [2022-01-11 07:03:02,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:03:02" (1/1) ... [2022-01-11 07:03:03,156 INFO L137 Inliner]: procedures = 49, calls = 48, calls flagged for inlining = 43, calls inlined = 60, statements flattened = 12941 [2022-01-11 07:03:03,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 07:03:03,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 07:03:03,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 07:03:03,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 07:03:03,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:03:02" (1/1) ... [2022-01-11 07:03:03,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:03:02" (1/1) ... [2022-01-11 07:03:03,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:03:02" (1/1) ... [2022-01-11 07:03:03,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:03:02" (1/1) ... [2022-01-11 07:03:03,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:03:02" (1/1) ... [2022-01-11 07:03:03,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:03:02" (1/1) ... [2022-01-11 07:03:03,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:03:02" (1/1) ... [2022-01-11 07:03:03,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 07:03:03,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 07:03:03,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 07:03:03,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 07:03:03,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:03:02" (1/1) ... [2022-01-11 07:03:03,560 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 07:03:03,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 07:03:03,576 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-11 07:03:03,581 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-11 07:03:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 07:03:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 07:03:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 07:03:03,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 07:03:03,677 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 07:03:03,678 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 07:03:09,909 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 07:03:09,957 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 07:03:09,957 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-11 07:03:09,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 07:03:09 BoogieIcfgContainer [2022-01-11 07:03:09,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 07:03:09,973 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 07:03:09,973 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 07:03:09,975 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 07:03:09,977 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 07:03:09" (1/1) ... [2022-01-11 07:03:11,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 07:03:11 BasicIcfg [2022-01-11 07:03:11,221 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 07:03:11,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 07:03:11,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 07:03:11,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 07:03:11,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 07:03:00" (1/4) ... [2022-01-11 07:03:11,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fc7f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 07:03:11, skipping insertion in model container [2022-01-11 07:03:11,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:03:02" (2/4) ... [2022-01-11 07:03:11,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fc7f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 07:03:11, skipping insertion in model container [2022-01-11 07:03:11,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 07:03:09" (3/4) ... [2022-01-11 07:03:11,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fc7f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 07:03:11, skipping insertion in model container [2022-01-11 07:03:11,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 07:03:11" (4/4) ... [2022-01-11 07:03:11,227 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.02.cil-2.cTransformedIcfg [2022-01-11 07:03:11,232 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 07:03:11,233 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-11 07:03:11,274 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 07:03:11,281 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-11 07:03:11,281 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-11 07:03:11,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 2423 states, 2419 states have (on average 1.8400165357585778) internal successors, (4451), 2422 states have internal predecessors, (4451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:11,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 07:03:11,548 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:11,548 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] [2022-01-11 07:03:11,549 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:11,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:11,560 INFO L85 PathProgramCache]: Analyzing trace with hash -287375585, now seen corresponding path program 1 times [2022-01-11 07:03:11,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:11,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008050626] [2022-01-11 07:03:11,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:11,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:11,776 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-11 07:03:11,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:11,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008050626] [2022-01-11 07:03:11,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008050626] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:11,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:11,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:03:11,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493495932] [2022-01-11 07:03:11,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:11,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:03:11,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:11,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:03:11,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:11,803 INFO L87 Difference]: Start difference. First operand has 2423 states, 2419 states have (on average 1.8400165357585778) internal successors, (4451), 2422 states have internal predecessors, (4451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:12,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:12,050 INFO L93 Difference]: Finished difference Result 5007 states and 9151 transitions. [2022-01-11 07:03:12,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:03:12,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-11 07:03:12,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:12,069 INFO L225 Difference]: With dead ends: 5007 [2022-01-11 07:03:12,069 INFO L226 Difference]: Without dead ends: 2523 [2022-01-11 07:03:12,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:12,078 INFO L933 BasicCegarLoop]: 4368 mSDtfsCounter, 4327 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4327 SdHoareTripleChecker+Valid, 4648 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:12,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4327 Valid, 4648 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:12,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2022-01-11 07:03:12,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2519. [2022-01-11 07:03:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2519 states, 2516 states have (on average 1.8084260731319555) internal successors, (4550), 2518 states have internal predecessors, (4550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 4550 transitions. [2022-01-11 07:03:12,163 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 4550 transitions. Word has length 55 [2022-01-11 07:03:12,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:12,163 INFO L470 AbstractCegarLoop]: Abstraction has 2519 states and 4550 transitions. [2022-01-11 07:03:12,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:12,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 4550 transitions. [2022-01-11 07:03:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 07:03:12,165 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:12,165 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] [2022-01-11 07:03:12,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 07:03:12,165 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:12,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:12,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1259371969, now seen corresponding path program 1 times [2022-01-11 07:03:12,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:12,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203521438] [2022-01-11 07:03:12,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:12,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:12,204 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-11 07:03:12,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:12,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203521438] [2022-01-11 07:03:12,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203521438] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:12,204 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:12,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:03:12,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934800126] [2022-01-11 07:03:12,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:12,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:03:12,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:12,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:03:12,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:12,206 INFO L87 Difference]: Start difference. First operand 2519 states and 4550 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:12,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:12,271 INFO L93 Difference]: Finished difference Result 2907 states and 5128 transitions. [2022-01-11 07:03:12,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:03:12,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-11 07:03:12,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:12,279 INFO L225 Difference]: With dead ends: 2907 [2022-01-11 07:03:12,280 INFO L226 Difference]: Without dead ends: 2519 [2022-01-11 07:03:12,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:12,282 INFO L933 BasicCegarLoop]: 4295 mSDtfsCounter, 4290 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4290 SdHoareTripleChecker+Valid, 4295 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:12,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4290 Valid, 4295 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2022-01-11 07:03:12,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 2519. [2022-01-11 07:03:12,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2519 states, 2516 states have (on average 1.8052464228934817) internal successors, (4542), 2518 states have internal predecessors, (4542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 4542 transitions. [2022-01-11 07:03:12,328 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 4542 transitions. Word has length 55 [2022-01-11 07:03:12,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:12,328 INFO L470 AbstractCegarLoop]: Abstraction has 2519 states and 4542 transitions. [2022-01-11 07:03:12,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 4542 transitions. [2022-01-11 07:03:12,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 07:03:12,330 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:12,330 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] [2022-01-11 07:03:12,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 07:03:12,330 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:12,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:12,330 INFO L85 PathProgramCache]: Analyzing trace with hash 926030623, now seen corresponding path program 1 times [2022-01-11 07:03:12,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:12,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159943554] [2022-01-11 07:03:12,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:12,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:12,364 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-11 07:03:12,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:12,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159943554] [2022-01-11 07:03:12,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159943554] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:12,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:12,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:03:12,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536004795] [2022-01-11 07:03:12,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:12,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:03:12,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:12,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:03:12,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:12,366 INFO L87 Difference]: Start difference. First operand 2519 states and 4542 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:12,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:12,419 INFO L93 Difference]: Finished difference Result 2905 states and 5109 transitions. [2022-01-11 07:03:12,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:03:12,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-11 07:03:12,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:12,427 INFO L225 Difference]: With dead ends: 2905 [2022-01-11 07:03:12,428 INFO L226 Difference]: Without dead ends: 2519 [2022-01-11 07:03:12,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:12,429 INFO L933 BasicCegarLoop]: 4280 mSDtfsCounter, 4246 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4246 SdHoareTripleChecker+Valid, 4308 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:12,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4246 Valid, 4308 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:12,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2022-01-11 07:03:12,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 2519. [2022-01-11 07:03:12,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2519 states, 2516 states have (on average 1.7988871224165341) internal successors, (4526), 2518 states have internal predecessors, (4526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 4526 transitions. [2022-01-11 07:03:12,471 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 4526 transitions. Word has length 55 [2022-01-11 07:03:12,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:12,471 INFO L470 AbstractCegarLoop]: Abstraction has 2519 states and 4526 transitions. [2022-01-11 07:03:12,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:12,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 4526 transitions. [2022-01-11 07:03:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 07:03:12,472 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:12,472 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] [2022-01-11 07:03:12,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 07:03:12,473 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:12,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:12,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1823186046, now seen corresponding path program 1 times [2022-01-11 07:03:12,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:12,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707946806] [2022-01-11 07:03:12,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:12,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:12,500 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-11 07:03:12,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:12,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707946806] [2022-01-11 07:03:12,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707946806] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:12,501 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:12,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:03:12,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89126778] [2022-01-11 07:03:12,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:12,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:03:12,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:12,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:03:12,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:12,502 INFO L87 Difference]: Start difference. First operand 2519 states and 4526 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:12,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:12,555 INFO L93 Difference]: Finished difference Result 2904 states and 5076 transitions. [2022-01-11 07:03:12,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:03:12,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-11 07:03:12,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:12,563 INFO L225 Difference]: With dead ends: 2904 [2022-01-11 07:03:12,563 INFO L226 Difference]: Without dead ends: 2519 [2022-01-11 07:03:12,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:12,565 INFO L933 BasicCegarLoop]: 4270 mSDtfsCounter, 4236 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4236 SdHoareTripleChecker+Valid, 4297 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:12,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4236 Valid, 4297 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:12,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2022-01-11 07:03:12,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 2519. [2022-01-11 07:03:12,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2519 states, 2516 states have (on average 1.7925278219395866) internal successors, (4510), 2518 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 4510 transitions. [2022-01-11 07:03:12,606 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 4510 transitions. Word has length 55 [2022-01-11 07:03:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:12,607 INFO L470 AbstractCegarLoop]: Abstraction has 2519 states and 4510 transitions. [2022-01-11 07:03:12,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:12,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 4510 transitions. [2022-01-11 07:03:12,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 07:03:12,609 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:12,610 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] [2022-01-11 07:03:12,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 07:03:12,610 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:12,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:12,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1391651677, now seen corresponding path program 1 times [2022-01-11 07:03:12,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:12,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159778707] [2022-01-11 07:03:12,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:12,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:12,661 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-11 07:03:12,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:12,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159778707] [2022-01-11 07:03:12,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159778707] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:12,663 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:12,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:03:12,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611356901] [2022-01-11 07:03:12,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:12,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:03:12,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:12,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:03:12,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:12,665 INFO L87 Difference]: Start difference. First operand 2519 states and 4510 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:12,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:12,726 INFO L93 Difference]: Finished difference Result 2903 states and 5043 transitions. [2022-01-11 07:03:12,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:03:12,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-11 07:03:12,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:12,734 INFO L225 Difference]: With dead ends: 2903 [2022-01-11 07:03:12,734 INFO L226 Difference]: Without dead ends: 2519 [2022-01-11 07:03:12,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:12,737 INFO L933 BasicCegarLoop]: 4260 mSDtfsCounter, 4226 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4226 SdHoareTripleChecker+Valid, 4286 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:12,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4226 Valid, 4286 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:12,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2022-01-11 07:03:12,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 2519. [2022-01-11 07:03:12,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2519 states, 2516 states have (on average 1.786168521462639) internal successors, (4494), 2518 states have internal predecessors, (4494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:12,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 4494 transitions. [2022-01-11 07:03:12,787 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 4494 transitions. Word has length 55 [2022-01-11 07:03:12,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:12,789 INFO L470 AbstractCegarLoop]: Abstraction has 2519 states and 4494 transitions. [2022-01-11 07:03:12,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:12,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 4494 transitions. [2022-01-11 07:03:12,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 07:03:12,795 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:12,795 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] [2022-01-11 07:03:12,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 07:03:12,796 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:12,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:12,797 INFO L85 PathProgramCache]: Analyzing trace with hash -30889156, now seen corresponding path program 1 times [2022-01-11 07:03:12,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:12,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391699975] [2022-01-11 07:03:12,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:12,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:12,860 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-11 07:03:12,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:12,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391699975] [2022-01-11 07:03:12,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391699975] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:12,860 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:12,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 07:03:12,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721130919] [2022-01-11 07:03:12,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:12,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 07:03:12,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:12,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 07:03:12,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:03:12,862 INFO L87 Difference]: Start difference. First operand 2519 states and 4494 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:12,986 INFO L93 Difference]: Finished difference Result 3179 states and 5402 transitions. [2022-01-11 07:03:12,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 07:03:12,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-11 07:03:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:12,995 INFO L225 Difference]: With dead ends: 3179 [2022-01-11 07:03:12,996 INFO L226 Difference]: Without dead ends: 2809 [2022-01-11 07:03:12,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 07:03:13,001 INFO L933 BasicCegarLoop]: 4247 mSDtfsCounter, 759 mSDsluCounter, 12551 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 16798 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:13,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [759 Valid, 16798 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:13,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2022-01-11 07:03:13,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 2525. [2022-01-11 07:03:13,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2525 states, 2522 states have (on average 1.7811260904044408) internal successors, (4492), 2524 states have internal predecessors, (4492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2525 states and 4492 transitions. [2022-01-11 07:03:13,056 INFO L78 Accepts]: Start accepts. Automaton has 2525 states and 4492 transitions. Word has length 55 [2022-01-11 07:03:13,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:13,057 INFO L470 AbstractCegarLoop]: Abstraction has 2525 states and 4492 transitions. [2022-01-11 07:03:13,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:13,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2525 states and 4492 transitions. [2022-01-11 07:03:13,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 07:03:13,058 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:13,058 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] [2022-01-11 07:03:13,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 07:03:13,058 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:13,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:13,058 INFO L85 PathProgramCache]: Analyzing trace with hash 662212541, now seen corresponding path program 1 times [2022-01-11 07:03:13,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:13,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897885899] [2022-01-11 07:03:13,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:13,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:13,110 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-11 07:03:13,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:13,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897885899] [2022-01-11 07:03:13,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897885899] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:13,110 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:13,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:03:13,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416163698] [2022-01-11 07:03:13,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:13,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:03:13,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:13,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:03:13,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:13,112 INFO L87 Difference]: Start difference. First operand 2525 states and 4492 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:13,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:13,252 INFO L93 Difference]: Finished difference Result 2918 states and 5011 transitions. [2022-01-11 07:03:13,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:03:13,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-11 07:03:13,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:13,260 INFO L225 Difference]: With dead ends: 2918 [2022-01-11 07:03:13,260 INFO L226 Difference]: Without dead ends: 2525 [2022-01-11 07:03:13,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:13,263 INFO L933 BasicCegarLoop]: 4255 mSDtfsCounter, 4224 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4224 SdHoareTripleChecker+Valid, 4255 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:13,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4224 Valid, 4255 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:13,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states. [2022-01-11 07:03:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 2525. [2022-01-11 07:03:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2525 states, 2522 states have (on average 1.7779540047581284) internal successors, (4484), 2524 states have internal predecessors, (4484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:13,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2525 states and 4484 transitions. [2022-01-11 07:03:13,313 INFO L78 Accepts]: Start accepts. Automaton has 2525 states and 4484 transitions. Word has length 55 [2022-01-11 07:03:13,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:13,314 INFO L470 AbstractCegarLoop]: Abstraction has 2525 states and 4484 transitions. [2022-01-11 07:03:13,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:13,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2525 states and 4484 transitions. [2022-01-11 07:03:13,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 07:03:13,314 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:13,315 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] [2022-01-11 07:03:13,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 07:03:13,315 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:13,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:13,315 INFO L85 PathProgramCache]: Analyzing trace with hash -182259330, now seen corresponding path program 1 times [2022-01-11 07:03:13,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:13,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127255449] [2022-01-11 07:03:13,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:13,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:13,340 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-11 07:03:13,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:13,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127255449] [2022-01-11 07:03:13,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127255449] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:13,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:13,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:03:13,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136560924] [2022-01-11 07:03:13,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:13,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:03:13,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:13,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:03:13,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:13,341 INFO L87 Difference]: Start difference. First operand 2525 states and 4484 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:13,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:13,413 INFO L93 Difference]: Finished difference Result 3244 states and 5421 transitions. [2022-01-11 07:03:13,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:03:13,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-11 07:03:13,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:13,422 INFO L225 Difference]: With dead ends: 3244 [2022-01-11 07:03:13,423 INFO L226 Difference]: Without dead ends: 2856 [2022-01-11 07:03:13,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:13,425 INFO L933 BasicCegarLoop]: 4251 mSDtfsCounter, 4177 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4177 SdHoareTripleChecker+Valid, 4487 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:13,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4177 Valid, 4487 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:13,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2022-01-11 07:03:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 2810. [2022-01-11 07:03:13,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2810 states, 2807 states have (on average 1.7260420377627361) internal successors, (4845), 2809 states have internal predecessors, (4845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 4845 transitions. [2022-01-11 07:03:13,486 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 4845 transitions. Word has length 55 [2022-01-11 07:03:13,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:13,487 INFO L470 AbstractCegarLoop]: Abstraction has 2810 states and 4845 transitions. [2022-01-11 07:03:13,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:13,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 4845 transitions. [2022-01-11 07:03:13,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-11 07:03:13,488 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:13,488 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:03:13,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 07:03:13,488 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:13,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:13,489 INFO L85 PathProgramCache]: Analyzing trace with hash -807388770, now seen corresponding path program 1 times [2022-01-11 07:03:13,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:13,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242504583] [2022-01-11 07:03:13,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:13,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:13,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:03:13,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:13,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242504583] [2022-01-11 07:03:13,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242504583] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:13,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:13,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:03:13,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799597640] [2022-01-11 07:03:13,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:13,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:03:13,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:13,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:03:13,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:13,523 INFO L87 Difference]: Start difference. First operand 2810 states and 4845 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:13,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:13,609 INFO L93 Difference]: Finished difference Result 4014 states and 6390 transitions. [2022-01-11 07:03:13,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:03:13,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-01-11 07:03:13,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:13,619 INFO L225 Difference]: With dead ends: 4014 [2022-01-11 07:03:13,619 INFO L226 Difference]: Without dead ends: 3367 [2022-01-11 07:03:13,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:13,621 INFO L933 BasicCegarLoop]: 4317 mSDtfsCounter, 4140 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4140 SdHoareTripleChecker+Valid, 4597 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:13,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4140 Valid, 4597 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:13,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3367 states. [2022-01-11 07:03:13,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3367 to 3363. [2022-01-11 07:03:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3363 states, 3360 states have (on average 1.6470238095238094) internal successors, (5534), 3362 states have internal predecessors, (5534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3363 states to 3363 states and 5534 transitions. [2022-01-11 07:03:13,706 INFO L78 Accepts]: Start accepts. Automaton has 3363 states and 5534 transitions. Word has length 88 [2022-01-11 07:03:13,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:13,706 INFO L470 AbstractCegarLoop]: Abstraction has 3363 states and 5534 transitions. [2022-01-11 07:03:13,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:13,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3363 states and 5534 transitions. [2022-01-11 07:03:13,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-11 07:03:13,707 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:13,707 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:03:13,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 07:03:13,708 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:13,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:13,708 INFO L85 PathProgramCache]: Analyzing trace with hash -24009795, now seen corresponding path program 1 times [2022-01-11 07:03:13,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:13,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702029165] [2022-01-11 07:03:13,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:13,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 07:03:13,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:13,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702029165] [2022-01-11 07:03:13,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702029165] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:13,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:13,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:03:13,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755501418] [2022-01-11 07:03:13,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:13,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:03:13,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:13,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:03:13,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:13,730 INFO L87 Difference]: Start difference. First operand 3363 states and 5534 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:13,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:13,810 INFO L93 Difference]: Finished difference Result 4527 states and 7020 transitions. [2022-01-11 07:03:13,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:03:13,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-01-11 07:03:13,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:13,829 INFO L225 Difference]: With dead ends: 4527 [2022-01-11 07:03:13,830 INFO L226 Difference]: Without dead ends: 3327 [2022-01-11 07:03:13,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:13,833 INFO L933 BasicCegarLoop]: 4256 mSDtfsCounter, 294 mSDsluCounter, 3958 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 8214 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:13,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 8214 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:13,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3327 states. [2022-01-11 07:03:13,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3327 to 3327. [2022-01-11 07:03:13,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3327 states, 3324 states have (on average 1.6522262334536704) internal successors, (5492), 3326 states have internal predecessors, (5492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 5492 transitions. [2022-01-11 07:03:13,925 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 5492 transitions. Word has length 88 [2022-01-11 07:03:13,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:13,926 INFO L470 AbstractCegarLoop]: Abstraction has 3327 states and 5492 transitions. [2022-01-11 07:03:13,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:13,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 5492 transitions. [2022-01-11 07:03:13,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-01-11 07:03:13,927 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:13,927 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:03:13,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 07:03:13,927 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:13,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:13,928 INFO L85 PathProgramCache]: Analyzing trace with hash -212195573, now seen corresponding path program 1 times [2022-01-11 07:03:13,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:13,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716300669] [2022-01-11 07:03:13,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:13,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:13,966 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:03:13,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:13,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716300669] [2022-01-11 07:03:13,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716300669] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:13,967 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:13,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:03:13,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234751835] [2022-01-11 07:03:13,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:13,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:03:13,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:13,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:03:13,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:13,968 INFO L87 Difference]: Start difference. First operand 3327 states and 5492 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:14,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:14,090 INFO L93 Difference]: Finished difference Result 5494 states and 8243 transitions. [2022-01-11 07:03:14,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:03:14,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-01-11 07:03:14,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:14,099 INFO L225 Difference]: With dead ends: 5494 [2022-01-11 07:03:14,099 INFO L226 Difference]: Without dead ends: 4330 [2022-01-11 07:03:14,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:14,102 INFO L933 BasicCegarLoop]: 4279 mSDtfsCounter, 4205 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4205 SdHoareTripleChecker+Valid, 4552 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:14,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4205 Valid, 4552 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:14,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2022-01-11 07:03:14,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 4294. [2022-01-11 07:03:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4294 states, 4291 states have (on average 1.5621067350268003) internal successors, (6703), 4293 states have internal predecessors, (6703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:14,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4294 states to 4294 states and 6703 transitions. [2022-01-11 07:03:14,232 INFO L78 Accepts]: Start accepts. Automaton has 4294 states and 6703 transitions. Word has length 89 [2022-01-11 07:03:14,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:14,232 INFO L470 AbstractCegarLoop]: Abstraction has 4294 states and 6703 transitions. [2022-01-11 07:03:14,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 4294 states and 6703 transitions. [2022-01-11 07:03:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-01-11 07:03:14,234 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:14,234 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:03:14,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 07:03:14,234 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:14,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:14,235 INFO L85 PathProgramCache]: Analyzing trace with hash 357170156, now seen corresponding path program 1 times [2022-01-11 07:03:14,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:14,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155971279] [2022-01-11 07:03:14,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:14,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:14,254 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 07:03:14,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:14,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155971279] [2022-01-11 07:03:14,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155971279] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:14,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:14,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:03:14,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561682021] [2022-01-11 07:03:14,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:14,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:03:14,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:14,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:03:14,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:14,256 INFO L87 Difference]: Start difference. First operand 4294 states and 6703 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:14,402 INFO L93 Difference]: Finished difference Result 6398 states and 9369 transitions. [2022-01-11 07:03:14,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:03:14,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-01-11 07:03:14,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:14,410 INFO L225 Difference]: With dead ends: 6398 [2022-01-11 07:03:14,410 INFO L226 Difference]: Without dead ends: 4259 [2022-01-11 07:03:14,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:14,414 INFO L933 BasicCegarLoop]: 4255 mSDtfsCounter, 292 mSDsluCounter, 3958 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 8213 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:14,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 8213 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:14,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2022-01-11 07:03:14,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 4259. [2022-01-11 07:03:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4259 states, 4256 states have (on average 1.5655545112781954) internal successors, (6663), 4258 states have internal predecessors, (6663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4259 states to 4259 states and 6663 transitions. [2022-01-11 07:03:14,535 INFO L78 Accepts]: Start accepts. Automaton has 4259 states and 6663 transitions. Word has length 89 [2022-01-11 07:03:14,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:14,535 INFO L470 AbstractCegarLoop]: Abstraction has 4259 states and 6663 transitions. [2022-01-11 07:03:14,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:14,535 INFO L276 IsEmpty]: Start isEmpty. Operand 4259 states and 6663 transitions. [2022-01-11 07:03:14,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-01-11 07:03:14,536 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:14,536 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:03:14,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 07:03:14,537 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:14,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:14,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1753321557, now seen corresponding path program 1 times [2022-01-11 07:03:14,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:14,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451822217] [2022-01-11 07:03:14,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:14,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:03:14,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:14,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451822217] [2022-01-11 07:03:14,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451822217] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:14,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:14,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:03:14,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987569475] [2022-01-11 07:03:14,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:14,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:03:14,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:14,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:03:14,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:14,565 INFO L87 Difference]: Start difference. First operand 4259 states and 6663 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:14,757 INFO L93 Difference]: Finished difference Result 8148 states and 11546 transitions. [2022-01-11 07:03:14,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:03:14,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-01-11 07:03:14,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:14,768 INFO L225 Difference]: With dead ends: 8148 [2022-01-11 07:03:14,769 INFO L226 Difference]: Without dead ends: 6052 [2022-01-11 07:03:14,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:14,773 INFO L933 BasicCegarLoop]: 4481 mSDtfsCounter, 225 mSDsluCounter, 4236 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 8717 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:14,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 8717 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:14,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6052 states. [2022-01-11 07:03:14,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6052 to 6052. [2022-01-11 07:03:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6052 states, 6049 states have (on average 1.4587535129773517) internal successors, (8824), 6051 states have internal predecessors, (8824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:14,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6052 states to 6052 states and 8824 transitions. [2022-01-11 07:03:14,969 INFO L78 Accepts]: Start accepts. Automaton has 6052 states and 8824 transitions. Word has length 90 [2022-01-11 07:03:14,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:14,969 INFO L470 AbstractCegarLoop]: Abstraction has 6052 states and 8824 transitions. [2022-01-11 07:03:14,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 6052 states and 8824 transitions. [2022-01-11 07:03:14,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-01-11 07:03:14,974 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:14,974 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:03:14,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 07:03:14,974 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:14,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:14,974 INFO L85 PathProgramCache]: Analyzing trace with hash 620661569, now seen corresponding path program 1 times [2022-01-11 07:03:14,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:14,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100951667] [2022-01-11 07:03:14,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:14,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:15,007 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:03:15,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:15,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100951667] [2022-01-11 07:03:15,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100951667] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:15,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:15,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:03:15,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756045928] [2022-01-11 07:03:15,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:15,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:03:15,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:15,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:03:15,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:15,008 INFO L87 Difference]: Start difference. First operand 6052 states and 8824 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:15,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:15,244 INFO L93 Difference]: Finished difference Result 11656 states and 15758 transitions. [2022-01-11 07:03:15,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:03:15,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-01-11 07:03:15,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:15,261 INFO L225 Difference]: With dead ends: 11656 [2022-01-11 07:03:15,261 INFO L226 Difference]: Without dead ends: 7778 [2022-01-11 07:03:15,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:15,270 INFO L933 BasicCegarLoop]: 4248 mSDtfsCounter, 4129 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4129 SdHoareTripleChecker+Valid, 4484 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:15,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4129 Valid, 4484 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:15,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7778 states. [2022-01-11 07:03:15,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7778 to 7742. [2022-01-11 07:03:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7742 states, 7739 states have (on average 1.4037989404315803) internal successors, (10864), 7741 states have internal predecessors, (10864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:15,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7742 states to 7742 states and 10864 transitions. [2022-01-11 07:03:15,594 INFO L78 Accepts]: Start accepts. Automaton has 7742 states and 10864 transitions. Word has length 115 [2022-01-11 07:03:15,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:15,594 INFO L470 AbstractCegarLoop]: Abstraction has 7742 states and 10864 transitions. [2022-01-11 07:03:15,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:15,595 INFO L276 IsEmpty]: Start isEmpty. Operand 7742 states and 10864 transitions. [2022-01-11 07:03:15,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-01-11 07:03:15,599 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:15,600 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:03:15,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 07:03:15,600 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:15,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:15,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1678229026, now seen corresponding path program 1 times [2022-01-11 07:03:15,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:15,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104695330] [2022-01-11 07:03:15,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:15,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:15,656 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:03:15,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:15,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104695330] [2022-01-11 07:03:15,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104695330] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:15,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:15,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:03:15,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017535371] [2022-01-11 07:03:15,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:15,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:03:15,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:15,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:03:15,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:15,658 INFO L87 Difference]: Start difference. First operand 7742 states and 10864 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:16,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:16,165 INFO L93 Difference]: Finished difference Result 15750 states and 20672 transitions. [2022-01-11 07:03:16,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:03:16,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-01-11 07:03:16,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:16,183 INFO L225 Difference]: With dead ends: 15750 [2022-01-11 07:03:16,184 INFO L226 Difference]: Without dead ends: 10168 [2022-01-11 07:03:16,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:16,194 INFO L933 BasicCegarLoop]: 4246 mSDtfsCounter, 4122 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4122 SdHoareTripleChecker+Valid, 4482 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:16,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4122 Valid, 4482 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:16,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10168 states. [2022-01-11 07:03:16,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10168 to 10116. [2022-01-11 07:03:16,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10116 states, 10113 states have (on average 1.3531098585978443) internal successors, (13684), 10115 states have internal predecessors, (13684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:16,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10116 states to 10116 states and 13684 transitions. [2022-01-11 07:03:16,634 INFO L78 Accepts]: Start accepts. Automaton has 10116 states and 13684 transitions. Word has length 115 [2022-01-11 07:03:16,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:16,634 INFO L470 AbstractCegarLoop]: Abstraction has 10116 states and 13684 transitions. [2022-01-11 07:03:16,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:16,634 INFO L276 IsEmpty]: Start isEmpty. Operand 10116 states and 13684 transitions. [2022-01-11 07:03:16,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-11 07:03:16,641 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:16,641 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:03:16,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 07:03:16,642 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:16,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:16,642 INFO L85 PathProgramCache]: Analyzing trace with hash 501584817, now seen corresponding path program 1 times [2022-01-11 07:03:16,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:16,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117850893] [2022-01-11 07:03:16,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:16,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:16,671 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-11 07:03:16,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:16,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117850893] [2022-01-11 07:03:16,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117850893] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:16,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:16,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:03:16,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132874710] [2022-01-11 07:03:16,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:16,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:03:16,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:16,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:03:16,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:16,674 INFO L87 Difference]: Start difference. First operand 10116 states and 13684 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:17,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:17,076 INFO L93 Difference]: Finished difference Result 16426 states and 21435 transitions. [2022-01-11 07:03:17,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:03:17,077 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2022-01-11 07:03:17,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:17,097 INFO L225 Difference]: With dead ends: 16426 [2022-01-11 07:03:17,098 INFO L226 Difference]: Without dead ends: 10284 [2022-01-11 07:03:17,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:17,110 INFO L933 BasicCegarLoop]: 4255 mSDtfsCounter, 4169 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4169 SdHoareTripleChecker+Valid, 4526 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:17,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4169 Valid, 4526 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:17,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10284 states. [2022-01-11 07:03:17,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10284 to 9972. [2022-01-11 07:03:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9972 states, 9969 states have (on average 1.3389507473166817) internal successors, (13348), 9971 states have internal predecessors, (13348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:17,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9972 states to 9972 states and 13348 transitions. [2022-01-11 07:03:17,522 INFO L78 Accepts]: Start accepts. Automaton has 9972 states and 13348 transitions. Word has length 130 [2022-01-11 07:03:17,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:17,523 INFO L470 AbstractCegarLoop]: Abstraction has 9972 states and 13348 transitions. [2022-01-11 07:03:17,523 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:17,523 INFO L276 IsEmpty]: Start isEmpty. Operand 9972 states and 13348 transitions. [2022-01-11 07:03:17,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-01-11 07:03:17,531 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:17,531 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:03:17,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 07:03:17,532 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:17,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:17,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1449647072, now seen corresponding path program 1 times [2022-01-11 07:03:17,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:17,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976561154] [2022-01-11 07:03:17,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:17,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:17,570 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:03:17,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:17,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976561154] [2022-01-11 07:03:17,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976561154] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:17,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:17,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:03:17,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912871401] [2022-01-11 07:03:17,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:17,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:03:17,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:17,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:03:17,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:17,572 INFO L87 Difference]: Start difference. First operand 9972 states and 13348 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:17,898 INFO L93 Difference]: Finished difference Result 15388 states and 19880 transitions. [2022-01-11 07:03:17,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:03:17,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2022-01-11 07:03:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:17,916 INFO L225 Difference]: With dead ends: 15388 [2022-01-11 07:03:17,916 INFO L226 Difference]: Without dead ends: 9976 [2022-01-11 07:03:17,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:17,924 INFO L933 BasicCegarLoop]: 4446 mSDtfsCounter, 195 mSDsluCounter, 4233 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 8679 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:17,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 8679 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:17,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9976 states. [2022-01-11 07:03:18,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9976 to 9972. [2022-01-11 07:03:18,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9972 states, 9969 states have (on average 1.3353395526131007) internal successors, (13312), 9971 states have internal predecessors, (13312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9972 states to 9972 states and 13312 transitions. [2022-01-11 07:03:18,331 INFO L78 Accepts]: Start accepts. Automaton has 9972 states and 13312 transitions. Word has length 131 [2022-01-11 07:03:18,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:18,331 INFO L470 AbstractCegarLoop]: Abstraction has 9972 states and 13312 transitions. [2022-01-11 07:03:18,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:18,332 INFO L276 IsEmpty]: Start isEmpty. Operand 9972 states and 13312 transitions. [2022-01-11 07:03:18,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-01-11 07:03:18,338 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:18,338 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:03:18,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 07:03:18,339 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:18,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:18,340 INFO L85 PathProgramCache]: Analyzing trace with hash 2031324677, now seen corresponding path program 1 times [2022-01-11 07:03:18,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:18,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511361707] [2022-01-11 07:03:18,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:18,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-11 07:03:18,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:18,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511361707] [2022-01-11 07:03:18,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511361707] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:18,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:18,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:03:18,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772868618] [2022-01-11 07:03:18,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:18,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:03:18,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:18,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:03:18,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:18,373 INFO L87 Difference]: Start difference. First operand 9972 states and 13312 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:18,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:18,593 INFO L93 Difference]: Finished difference Result 14060 states and 18258 transitions. [2022-01-11 07:03:18,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:03:18,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2022-01-11 07:03:18,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:18,609 INFO L225 Difference]: With dead ends: 14060 [2022-01-11 07:03:18,609 INFO L226 Difference]: Without dead ends: 8624 [2022-01-11 07:03:18,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:18,616 INFO L933 BasicCegarLoop]: 4437 mSDtfsCounter, 203 mSDsluCounter, 4232 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 8669 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:18,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 8669 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:18,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8624 states. [2022-01-11 07:03:18,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8624 to 8620. [2022-01-11 07:03:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8620 states, 8617 states have (on average 1.3524428455378903) internal successors, (11654), 8619 states have internal predecessors, (11654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8620 states to 8620 states and 11654 transitions. [2022-01-11 07:03:18,861 INFO L78 Accepts]: Start accepts. Automaton has 8620 states and 11654 transitions. Word has length 131 [2022-01-11 07:03:18,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:18,861 INFO L470 AbstractCegarLoop]: Abstraction has 8620 states and 11654 transitions. [2022-01-11 07:03:18,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:18,862 INFO L276 IsEmpty]: Start isEmpty. Operand 8620 states and 11654 transitions. [2022-01-11 07:03:18,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-01-11 07:03:18,866 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:18,866 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:03:18,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 07:03:18,866 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:18,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:18,867 INFO L85 PathProgramCache]: Analyzing trace with hash -707819198, now seen corresponding path program 1 times [2022-01-11 07:03:18,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:18,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56906283] [2022-01-11 07:03:18,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:18,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:03:18,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:18,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56906283] [2022-01-11 07:03:18,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56906283] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:18,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:18,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:03:18,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804966805] [2022-01-11 07:03:18,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:18,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:03:18,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:18,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:03:18,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:18,902 INFO L87 Difference]: Start difference. First operand 8620 states and 11654 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:19,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:19,134 INFO L93 Difference]: Finished difference Result 13136 states and 17030 transitions. [2022-01-11 07:03:19,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:03:19,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2022-01-11 07:03:19,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:19,150 INFO L225 Difference]: With dead ends: 13136 [2022-01-11 07:03:19,151 INFO L226 Difference]: Without dead ends: 8664 [2022-01-11 07:03:19,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:19,159 INFO L933 BasicCegarLoop]: 4443 mSDtfsCounter, 219 mSDsluCounter, 4198 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 8641 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:19,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 8641 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:19,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8664 states. [2022-01-11 07:03:19,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8664 to 8620. [2022-01-11 07:03:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8620 states, 8617 states have (on average 1.3361958918417083) internal successors, (11514), 8619 states have internal predecessors, (11514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8620 states to 8620 states and 11514 transitions. [2022-01-11 07:03:19,469 INFO L78 Accepts]: Start accepts. Automaton has 8620 states and 11514 transitions. Word has length 131 [2022-01-11 07:03:19,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:19,469 INFO L470 AbstractCegarLoop]: Abstraction has 8620 states and 11514 transitions. [2022-01-11 07:03:19,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:19,469 INFO L276 IsEmpty]: Start isEmpty. Operand 8620 states and 11514 transitions. [2022-01-11 07:03:19,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-01-11 07:03:19,473 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:19,474 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:03:19,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 07:03:19,474 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:19,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:19,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1344987167, now seen corresponding path program 1 times [2022-01-11 07:03:19,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:19,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621280171] [2022-01-11 07:03:19,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:19,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 07:03:19,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:19,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621280171] [2022-01-11 07:03:19,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621280171] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:19,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:19,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:03:19,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757129310] [2022-01-11 07:03:19,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:19,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:03:19,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:19,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:03:19,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:19,510 INFO L87 Difference]: Start difference. First operand 8620 states and 11514 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:19,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:19,763 INFO L93 Difference]: Finished difference Result 13158 states and 16894 transitions. [2022-01-11 07:03:19,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:03:19,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2022-01-11 07:03:19,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:19,779 INFO L225 Difference]: With dead ends: 13158 [2022-01-11 07:03:19,779 INFO L226 Difference]: Without dead ends: 8902 [2022-01-11 07:03:19,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:19,787 INFO L933 BasicCegarLoop]: 4400 mSDtfsCounter, 235 mSDsluCounter, 4183 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 8583 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:19,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 8583 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8902 states. [2022-01-11 07:03:20,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8902 to 8602. [2022-01-11 07:03:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8602 states, 8599 states have (on average 1.3215490173275963) internal successors, (11364), 8601 states have internal predecessors, (11364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:20,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8602 states to 8602 states and 11364 transitions. [2022-01-11 07:03:20,047 INFO L78 Accepts]: Start accepts. Automaton has 8602 states and 11364 transitions. Word has length 131 [2022-01-11 07:03:20,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:20,047 INFO L470 AbstractCegarLoop]: Abstraction has 8602 states and 11364 transitions. [2022-01-11 07:03:20,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:20,048 INFO L276 IsEmpty]: Start isEmpty. Operand 8602 states and 11364 transitions. [2022-01-11 07:03:20,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 07:03:20,053 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:20,053 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:03:20,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 07:03:20,053 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:20,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:20,054 INFO L85 PathProgramCache]: Analyzing trace with hash 118260269, now seen corresponding path program 1 times [2022-01-11 07:03:20,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:20,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165468950] [2022-01-11 07:03:20,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:20,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:20,085 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:03:20,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:20,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165468950] [2022-01-11 07:03:20,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165468950] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:20,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:20,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:03:20,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051456411] [2022-01-11 07:03:20,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:20,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:03:20,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:20,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:03:20,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:20,087 INFO L87 Difference]: Start difference. First operand 8602 states and 11364 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:20,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:20,353 INFO L93 Difference]: Finished difference Result 12660 states and 16040 transitions. [2022-01-11 07:03:20,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:03:20,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2022-01-11 07:03:20,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:20,372 INFO L225 Difference]: With dead ends: 12660 [2022-01-11 07:03:20,372 INFO L226 Difference]: Without dead ends: 8630 [2022-01-11 07:03:20,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:20,380 INFO L933 BasicCegarLoop]: 4429 mSDtfsCounter, 193 mSDsluCounter, 4188 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 8617 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:20,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 8617 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:20,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8630 states. [2022-01-11 07:03:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8630 to 8602. [2022-01-11 07:03:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8602 states, 8599 states have (on average 1.308291661821142) internal successors, (11250), 8601 states have internal predecessors, (11250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8602 states to 8602 states and 11250 transitions. [2022-01-11 07:03:20,660 INFO L78 Accepts]: Start accepts. Automaton has 8602 states and 11250 transitions. Word has length 132 [2022-01-11 07:03:20,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:20,660 INFO L470 AbstractCegarLoop]: Abstraction has 8602 states and 11250 transitions. [2022-01-11 07:03:20,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:20,660 INFO L276 IsEmpty]: Start isEmpty. Operand 8602 states and 11250 transitions. [2022-01-11 07:03:20,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-01-11 07:03:20,664 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:20,664 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:03:20,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 07:03:20,664 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:20,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:20,665 INFO L85 PathProgramCache]: Analyzing trace with hash -545277156, now seen corresponding path program 1 times [2022-01-11 07:03:20,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:20,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289574376] [2022-01-11 07:03:20,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:20,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-11 07:03:20,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:20,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289574376] [2022-01-11 07:03:20,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289574376] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:20,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:20,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 07:03:20,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791513983] [2022-01-11 07:03:20,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:20,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 07:03:20,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:20,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 07:03:20,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:03:20,722 INFO L87 Difference]: Start difference. First operand 8602 states and 11250 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:21,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:21,021 INFO L93 Difference]: Finished difference Result 14342 states and 17736 transitions. [2022-01-11 07:03:21,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 07:03:21,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-01-11 07:03:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:21,037 INFO L225 Difference]: With dead ends: 14342 [2022-01-11 07:03:21,038 INFO L226 Difference]: Without dead ends: 7920 [2022-01-11 07:03:21,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 07:03:21,046 INFO L933 BasicCegarLoop]: 4240 mSDtfsCounter, 623 mSDsluCounter, 12399 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 16639 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:21,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [623 Valid, 16639 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:21,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7920 states. [2022-01-11 07:03:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7920 to 7286. [2022-01-11 07:03:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7286 states, 7283 states have (on average 1.3280241658657146) internal successors, (9672), 7285 states have internal predecessors, (9672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7286 states to 7286 states and 9672 transitions. [2022-01-11 07:03:21,331 INFO L78 Accepts]: Start accepts. Automaton has 7286 states and 9672 transitions. Word has length 133 [2022-01-11 07:03:21,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:21,331 INFO L470 AbstractCegarLoop]: Abstraction has 7286 states and 9672 transitions. [2022-01-11 07:03:21,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:21,331 INFO L276 IsEmpty]: Start isEmpty. Operand 7286 states and 9672 transitions. [2022-01-11 07:03:21,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-01-11 07:03:21,334 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:21,335 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:03:21,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 07:03:21,335 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:21,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:21,335 INFO L85 PathProgramCache]: Analyzing trace with hash 304337501, now seen corresponding path program 1 times [2022-01-11 07:03:21,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:21,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280656556] [2022-01-11 07:03:21,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:21,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-01-11 07:03:21,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:21,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280656556] [2022-01-11 07:03:21,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280656556] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:21,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:21,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 07:03:21,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411583763] [2022-01-11 07:03:21,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:21,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 07:03:21,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:21,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 07:03:21,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:03:21,395 INFO L87 Difference]: Start difference. First operand 7286 states and 9672 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:21,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:21,627 INFO L93 Difference]: Finished difference Result 9911 states and 12533 transitions. [2022-01-11 07:03:21,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 07:03:21,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-01-11 07:03:21,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:21,635 INFO L225 Difference]: With dead ends: 9911 [2022-01-11 07:03:21,635 INFO L226 Difference]: Without dead ends: 3756 [2022-01-11 07:03:21,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 07:03:21,643 INFO L933 BasicCegarLoop]: 4267 mSDtfsCounter, 704 mSDsluCounter, 12232 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 16499 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:21,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [704 Valid, 16499 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:21,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3756 states. [2022-01-11 07:03:21,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3756 to 3694. [2022-01-11 07:03:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3694 states, 3691 states have (on average 1.5261446762395015) internal successors, (5633), 3693 states have internal predecessors, (5633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:21,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 3694 states and 5633 transitions. [2022-01-11 07:03:21,740 INFO L78 Accepts]: Start accepts. Automaton has 3694 states and 5633 transitions. Word has length 133 [2022-01-11 07:03:21,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:21,740 INFO L470 AbstractCegarLoop]: Abstraction has 3694 states and 5633 transitions. [2022-01-11 07:03:21,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:21,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3694 states and 5633 transitions. [2022-01-11 07:03:21,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 07:03:21,742 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:21,742 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:03:21,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 07:03:21,743 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:21,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash -474492862, now seen corresponding path program 1 times [2022-01-11 07:03:21,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:21,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883080537] [2022-01-11 07:03:21,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:21,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 07:03:21,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:21,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883080537] [2022-01-11 07:03:21,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883080537] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:21,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:21,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 07:03:21,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199259011] [2022-01-11 07:03:21,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:21,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 07:03:21,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:21,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 07:03:21,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:03:21,940 INFO L87 Difference]: Start difference. First operand 3694 states and 5633 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:22,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:22,132 INFO L93 Difference]: Finished difference Result 3694 states and 5633 transitions. [2022-01-11 07:03:22,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 07:03:22,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-11 07:03:22,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:22,139 INFO L225 Difference]: With dead ends: 3694 [2022-01-11 07:03:22,140 INFO L226 Difference]: Without dead ends: 3692 [2022-01-11 07:03:22,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:03:22,142 INFO L933 BasicCegarLoop]: 4416 mSDtfsCounter, 4327 mSDsluCounter, 8826 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4327 SdHoareTripleChecker+Valid, 13242 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:03:22,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4327 Valid, 13242 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:22,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3692 states. [2022-01-11 07:03:22,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3692 to 3692. [2022-01-11 07:03:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3692 states, 3690 states have (on average 1.5257452574525745) internal successors, (5630), 3691 states have internal predecessors, (5630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3692 states and 5630 transitions. [2022-01-11 07:03:22,298 INFO L78 Accepts]: Start accepts. Automaton has 3692 states and 5630 transitions. Word has length 165 [2022-01-11 07:03:22,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:22,298 INFO L470 AbstractCegarLoop]: Abstraction has 3692 states and 5630 transitions. [2022-01-11 07:03:22,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:22,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3692 states and 5630 transitions. [2022-01-11 07:03:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-01-11 07:03:22,300 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:22,300 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:03:22,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 07:03:22,301 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:22,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:22,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1113134758, now seen corresponding path program 1 times [2022-01-11 07:03:22,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:22,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469106034] [2022-01-11 07:03:22,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:22,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:03:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-01-11 07:03:22,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:03:22,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469106034] [2022-01-11 07:03:22,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469106034] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:03:22,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:03:22,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:03:22,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144919718] [2022-01-11 07:03:22,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:03:22,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:03:22,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:03:22,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:03:22,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:22,345 INFO L87 Difference]: Start difference. First operand 3692 states and 5630 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:22,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:03:22,579 INFO L93 Difference]: Finished difference Result 5002 states and 7017 transitions. [2022-01-11 07:03:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:03:22,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2022-01-11 07:03:22,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:03:22,586 INFO L225 Difference]: With dead ends: 5002 [2022-01-11 07:03:22,586 INFO L226 Difference]: Without dead ends: 4339 [2022-01-11 07:03:22,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:03:22,588 INFO L933 BasicCegarLoop]: 4408 mSDtfsCounter, 194 mSDsluCounter, 4206 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 8614 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-11 07:03:22,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 8614 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:03:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4339 states. [2022-01-11 07:03:22,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4339 to 3694. [2022-01-11 07:03:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3694 states, 3692 states have (on average 1.5254604550379198) internal successors, (5632), 3693 states have internal predecessors, (5632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:22,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 3694 states and 5632 transitions. [2022-01-11 07:03:22,721 INFO L78 Accepts]: Start accepts. Automaton has 3694 states and 5632 transitions. Word has length 169 [2022-01-11 07:03:22,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:03:22,722 INFO L470 AbstractCegarLoop]: Abstraction has 3694 states and 5632 transitions. [2022-01-11 07:03:22,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:03:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3694 states and 5632 transitions. [2022-01-11 07:03:22,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-01-11 07:03:22,724 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:03:22,724 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:03:22,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 07:03:22,724 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:03:22,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:03:22,725 INFO L85 PathProgramCache]: Analyzing trace with hash -178243508, now seen corresponding path program 1 times [2022-01-11 07:03:22,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:03:22,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171669419] [2022-01-11 07:03:22,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:03:22,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:03:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 07:03:22,750 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-11 07:03:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 07:03:22,829 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-11 07:03:22,829 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-11 07:03:22,830 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-11 07:03:22,831 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-01-11 07:03:22,831 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-01-11 07:03:22,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 07:03:22,833 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] [2022-01-11 07:03:22,836 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 07:03:23,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 07:03:23 BasicIcfg [2022-01-11 07:03:23,181 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 07:03:23,181 INFO L158 Benchmark]: Toolchain (without parser) took 22861.00ms. Allocated memory was 165.7MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 119.9MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 714.3MB. Max. memory is 8.0GB. [2022-01-11 07:03:23,182 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 165.7MB. Free memory was 132.7MB in the beginning and 132.6MB in the end (delta: 82.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 07:03:23,182 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2427.50ms. Allocated memory was 165.7MB in the beginning and 263.2MB in the end (delta: 97.5MB). Free memory was 119.5MB in the beginning and 141.3MB in the end (delta: -21.8MB). Peak memory consumption was 130.7MB. Max. memory is 8.0GB. [2022-01-11 07:03:23,182 INFO L158 Benchmark]: Boogie Procedure Inliner took 407.13ms. Allocated memory is still 263.2MB. Free memory was 141.3MB in the beginning and 128.2MB in the end (delta: 13.0MB). Peak memory consumption was 89.7MB. Max. memory is 8.0GB. [2022-01-11 07:03:23,182 INFO L158 Benchmark]: Boogie Preprocessor took 394.68ms. Allocated memory was 263.2MB in the beginning and 526.4MB in the end (delta: 263.2MB). Free memory was 128.2MB in the beginning and 369.5MB in the end (delta: -241.3MB). Peak memory consumption was 91.2MB. Max. memory is 8.0GB. [2022-01-11 07:03:23,182 INFO L158 Benchmark]: RCFGBuilder took 6418.86ms. Allocated memory was 526.4MB in the beginning and 1.1GB in the end (delta: 526.4MB). Free memory was 369.1MB in the beginning and 634.3MB in the end (delta: -265.2MB). Peak memory consumption was 262.1MB. Max. memory is 8.0GB. [2022-01-11 07:03:23,182 INFO L158 Benchmark]: IcfgTransformer took 1248.36ms. Allocated memory was 1.1GB in the beginning and 1.6GB in the end (delta: 513.8MB). Free memory was 634.3MB in the beginning and 954.1MB in the end (delta: -319.8MB). Peak memory consumption was 192.9MB. Max. memory is 8.0GB. [2022-01-11 07:03:23,183 INFO L158 Benchmark]: TraceAbstraction took 11958.94ms. Allocated memory was 1.6GB in the beginning and 2.9GB in the end (delta: 1.3GB). Free memory was 954.1MB in the beginning and 2.1GB in the end (delta: -1.1GB). Peak memory consumption was 149.0MB. Max. memory is 8.0GB. [2022-01-11 07:03:23,184 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.11ms. Allocated memory is still 165.7MB. Free memory was 132.7MB in the beginning and 132.6MB in the end (delta: 82.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2427.50ms. Allocated memory was 165.7MB in the beginning and 263.2MB in the end (delta: 97.5MB). Free memory was 119.5MB in the beginning and 141.3MB in the end (delta: -21.8MB). Peak memory consumption was 130.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 407.13ms. Allocated memory is still 263.2MB. Free memory was 141.3MB in the beginning and 128.2MB in the end (delta: 13.0MB). Peak memory consumption was 89.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 394.68ms. Allocated memory was 263.2MB in the beginning and 526.4MB in the end (delta: 263.2MB). Free memory was 128.2MB in the beginning and 369.5MB in the end (delta: -241.3MB). Peak memory consumption was 91.2MB. Max. memory is 8.0GB. * RCFGBuilder took 6418.86ms. Allocated memory was 526.4MB in the beginning and 1.1GB in the end (delta: 526.4MB). Free memory was 369.1MB in the beginning and 634.3MB in the end (delta: -265.2MB). Peak memory consumption was 262.1MB. Max. memory is 8.0GB. * IcfgTransformer took 1248.36ms. Allocated memory was 1.1GB in the beginning and 1.6GB in the end (delta: 513.8MB). Free memory was 634.3MB in the beginning and 954.1MB in the end (delta: -319.8MB). Peak memory consumption was 192.9MB. Max. memory is 8.0GB. * TraceAbstraction took 11958.94ms. Allocated memory was 1.6GB in the beginning and 2.9GB in the end (delta: 1.3GB). Free memory was 954.1MB in the beginning and 2.1GB in the end (delta: -1.1GB). Peak memory consumption was 149.0MB. 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: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int t2_pc = 0; [L11180] int m_st ; [L11181] int t1_st ; [L11182] int t2_st ; [L11183] int m_i ; [L11184] int t1_i ; [L11185] int t2_i ; [L11186] int M_E = 2; [L11187] int T1_E = 2; [L11188] int T2_E = 2; [L11189] int E_M = 2; [L11190] int E_1 = 2; [L11191] int E_2 = 2; [L11196] int token ; [L11198] int local ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11776] COND FALSE !(__VERIFIER_nondet_int()) [L11779] CALL main2() [L11763] int __retres1 ; [L11767] CALL init_model() [L11677] m_i = 1 [L11678] t1_i = 1 [L11679] t2_i = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11767] RET init_model() [L11768] CALL start_simulation() [L11704] int kernel_st ; [L11705] int tmp ; [L11706] int tmp___0 ; [L11710] kernel_st = 0 [L11711] FCALL update_channels() [L11712] CALL init_threads() [L11396] COND TRUE m_i == 1 [L11397] m_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11401] COND TRUE t1_i == 1 [L11402] t1_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11406] COND TRUE t2_i == 1 [L11407] t2_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11712] RET init_threads() [L11713] CALL fire_delta_events() [L11509] COND FALSE !(M_E == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11514] COND FALSE !(T1_E == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11519] COND FALSE !(T2_E == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11524] COND FALSE !(E_M == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11529] COND FALSE !(E_1 == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11534] COND FALSE !(E_2 == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11713] RET fire_delta_events() [L11714] CALL activate_threads() [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11331] COND FALSE !(m_pc == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11341] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11343] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11350] COND FALSE !(t1_pc == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11360] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11362] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11369] COND FALSE !(t2_pc == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11379] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11381] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11714] RET activate_threads() [L11715] CALL reset_delta_events() [L11547] COND FALSE !(M_E == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11552] COND FALSE !(T1_E == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11557] COND FALSE !(T2_E == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11562] COND FALSE !(E_M == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11567] COND FALSE !(E_1 == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11572] COND FALSE !(E_2 == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11715] RET reset_delta_events() [L11718] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11721] kernel_st = 1 [L11722] CALL eval() [L11442] int tmp ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11446] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11449] CALL, EXPR exists_runnable_thread() [L11416] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11419] COND TRUE m_st == 0 [L11420] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11437] return (__retres1); VAL [\result=-1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11449] RET, EXPR exists_runnable_thread() [L11449] tmp = exists_runnable_thread() [L11451] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND FALSE !(\read(tmp_ndt_1)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11470] COND TRUE t1_st == 0 [L11471] int tmp_ndt_2; [L11472] tmp_ndt_2 = __VERIFIER_nondet_int() [L11473] COND TRUE \read(tmp_ndt_2) [L11475] t1_st = 1 [L11476] CALL transmit1() [L11259] COND TRUE t1_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11270] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11272] t1_pc = 1 [L11273] t1_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11476] RET transmit1() [L11484] COND TRUE t2_st == 0 [L11485] int tmp_ndt_3; [L11486] tmp_ndt_3 = __VERIFIER_nondet_int() [L11487] COND TRUE \read(tmp_ndt_3) [L11489] t2_st = 1 [L11490] CALL transmit2() [L11295] COND TRUE t2_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11306] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11308] t2_pc = 1 [L11309] t2_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11490] RET transmit2() [L11446] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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=4, token=0] [L11449] CALL, EXPR exists_runnable_thread() [L11416] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11419] COND TRUE m_st == 0 [L11420] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11437] return (__retres1); VAL [\result=-1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11449] RET, EXPR exists_runnable_thread() [L11449] tmp = exists_runnable_thread() [L11451] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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=4, token=0] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND TRUE \read(tmp_ndt_1) [L11461] m_st = 1 [L11462] CALL master() [L11201] int tmp_var = __VERIFIER_nondet_int(); [L11203] COND TRUE m_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11214] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11217] token = __VERIFIER_nondet_int() [L11218] local = token [L11219] E_1 = 1 [L11220] CALL immediate_notify() [L11620] CALL activate_threads() [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, 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] [L11331] COND FALSE !(m_pc == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, 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] [L11341] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, 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] [L11343] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, 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] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, 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] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, 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] [L11350] COND TRUE t1_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, 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] [L11351] COND TRUE E_1 == 1 [L11352] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, 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] [L11362] return (__retres1); VAL [\result=-1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, 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] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND TRUE \read(tmp___0) [L11599] t1_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, 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] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, 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] [L11369] COND TRUE t2_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, 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] [L11370] COND FALSE !(E_2 == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, 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] [L11379] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, 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] [L11381] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, 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] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, 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] [L11620] RET activate_threads() [L11220] RET immediate_notify() [L11221] E_1 = 2 [L11222] m_pc = 1 [L11223] m_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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, token=0] [L11462] RET master() [L11470] COND TRUE t1_st == 0 [L11471] int tmp_ndt_2; [L11472] tmp_ndt_2 = __VERIFIER_nondet_int() [L11473] COND TRUE \read(tmp_ndt_2) [L11475] t1_st = 1 [L11476] CALL transmit1() [L11259] COND FALSE !(t1_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11262] COND TRUE t1_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11278] token += 1 [L11279] E_2 = 1 [L11280] CALL immediate_notify() [L11620] CALL activate_threads() [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, 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] [L11331] COND TRUE m_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, 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] [L11332] COND FALSE !(E_M == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, 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] [L11341] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, 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] [L11343] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, 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] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, 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] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, 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] [L11350] COND TRUE t1_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, 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] [L11351] COND FALSE !(E_1 == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, 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] [L11360] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, 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] [L11362] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, 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] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, 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] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, 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] [L11369] COND TRUE t2_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, 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] [L11370] COND TRUE E_2 == 1 [L11371] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, 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] [L11381] return (__retres1); VAL [\result=-1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, 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] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND TRUE \read(tmp___1) [L11607] t2_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, 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] [L11620] RET activate_threads() [L11280] RET immediate_notify() [L11281] E_2 = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11270] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11272] t1_pc = 1 [L11273] t1_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11476] RET transmit1() [L11484] COND TRUE t2_st == 0 [L11485] int tmp_ndt_3; [L11486] tmp_ndt_3 = __VERIFIER_nondet_int() [L11487] COND TRUE \read(tmp_ndt_3) [L11489] t2_st = 1 [L11490] CALL transmit2() [L11295] COND FALSE !(t2_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11298] COND TRUE t2_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11314] token += 1 [L11315] E_M = 1 [L11316] CALL immediate_notify() [L11620] CALL activate_threads() [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, 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] [L11331] COND TRUE m_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, 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] [L11332] COND TRUE E_M == 1 [L11333] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, 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] [L11343] return (__retres1); VAL [\result=-1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, 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] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND TRUE \read(tmp) [L11591] m_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, 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] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, 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] [L11350] COND TRUE t1_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, 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] [L11351] COND FALSE !(E_1 == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, 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] [L11360] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, 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] [L11362] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, 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] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, 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] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, 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] [L11369] COND TRUE t2_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, 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] [L11370] COND FALSE !(E_2 == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, 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] [L11379] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, 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] [L11381] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, 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] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, 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] [L11620] RET activate_threads() [L11316] RET immediate_notify() [L11317] E_M = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11306] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11308] t2_pc = 1 [L11309] t2_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11490] RET transmit2() [L11446] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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=5, token=2] [L11449] CALL, EXPR exists_runnable_thread() [L11416] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11419] COND TRUE m_st == 0 [L11420] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11437] return (__retres1); VAL [\result=-1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11449] RET, EXPR exists_runnable_thread() [L11449] tmp = exists_runnable_thread() [L11451] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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=5, token=2] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND TRUE \read(tmp_ndt_1) [L11461] m_st = 1 [L11462] CALL master() [L11201] int tmp_var = __VERIFIER_nondet_int(); [L11203] COND FALSE !(m_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11206] COND TRUE m_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11228] COND FALSE !(token != local + 2) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11233] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11234] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11239] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11240] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] [L11241] COND TRUE tmp_var == 5 [L11242] CALL error() [L11173] reach_error() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, 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] - UnprovableResult [Line: 11173]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 11049]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 2423 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58954 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58954 mSDsluCounter, 193342 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85293 mSDsCounter, 197 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 431 IncrementalHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 197 mSolverCounterUnsat, 108049 mSDtfsCounter, 431 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10116occurred in iteration=15, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 2495 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 2670 NumberOfCodeBlocks, 2670 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2475 ConstructedInterpolants, 0 QuantifiedInterpolants, 5866 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 395/395 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-11 07:03:23,219 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...