/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_NONE.epf -i ../../../trunk/examples/svcomp/systemc/mem_slave_tlm.5.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 00:16:18,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 00:16:18,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 00:16:19,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 00:16:19,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 00:16:19,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 00:16:19,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 00:16:19,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 00:16:19,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 00:16:19,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 00:16:19,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 00:16:19,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 00:16:19,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 00:16:19,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 00:16:19,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 00:16:19,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 00:16:19,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 00:16:19,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 00:16:19,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 00:16:19,125 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 00:16:19,127 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 00:16:19,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 00:16:19,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 00:16:19,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 00:16:19,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 00:16:19,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 00:16:19,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 00:16:19,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 00:16:19,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 00:16:19,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 00:16:19,132 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 00:16:19,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 00:16:19,133 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 00:16:19,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 00:16:19,134 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 00:16:19,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 00:16:19,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 00:16:19,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 00:16:19,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 00:16:19,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 00:16:19,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 00:16:19,157 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 00:16:19,196 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 00:16:19,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 00:16:19,197 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 00:16:19,197 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 00:16:19,198 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 00:16:19,198 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 00:16:19,199 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 00:16:19,199 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 00:16:19,199 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 00:16:19,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 00:16:19,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 00:16:19,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 00:16:19,200 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 00:16:19,200 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 00:16:19,200 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 00:16:19,200 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 00:16:19,200 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 00:16:19,200 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 00:16:19,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 00:16:19,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 00:16:19,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 00:16:19,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:16:19,201 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 00:16:19,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 00:16:19,201 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 00:16:19,202 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 00:16:19,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 00:16:19,202 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 00:16:19,202 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 00:16:19,202 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 00:16:19,202 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 00:16:19,202 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 00:16:19,203 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 00:16:19,203 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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 00:16:19,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 00:16:19,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 00:16:19,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 00:16:19,523 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 00:16:19,523 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 00:16:19,524 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/mem_slave_tlm.5.cil.c [2022-01-11 00:16:19,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4b62bd7/a5af5a6217d148558bc5f2daa184a051/FLAG1ba5ed5ac [2022-01-11 00:16:20,010 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 00:16:20,010 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/mem_slave_tlm.5.cil.c [2022-01-11 00:16:20,048 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4b62bd7/a5af5a6217d148558bc5f2daa184a051/FLAG1ba5ed5ac [2022-01-11 00:16:20,059 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4b62bd7/a5af5a6217d148558bc5f2daa184a051 [2022-01-11 00:16:20,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 00:16:20,062 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 00:16:20,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 00:16:20,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 00:16:20,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 00:16:20,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:16:20" (1/1) ... [2022-01-11 00:16:20,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f42116e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:20, skipping insertion in model container [2022-01-11 00:16:20,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:16:20" (1/1) ... [2022-01-11 00:16:20,072 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 00:16:20,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 00:16:20,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/mem_slave_tlm.5.cil.c[646,659] [2022-01-11 00:16:20,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:16:20,362 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 00:16:20,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/mem_slave_tlm.5.cil.c[646,659] [2022-01-11 00:16:20,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:16:20,423 INFO L208 MainTranslator]: Completed translation [2022-01-11 00:16:20,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:20 WrapperNode [2022-01-11 00:16:20,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 00:16:20,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 00:16:20,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 00:16:20,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 00:16:20,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:20" (1/1) ... [2022-01-11 00:16:20,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:20" (1/1) ... [2022-01-11 00:16:20,470 INFO L137 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 883 [2022-01-11 00:16:20,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 00:16:20,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 00:16:20,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 00:16:20,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 00:16:20,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:20" (1/1) ... [2022-01-11 00:16:20,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:20" (1/1) ... [2022-01-11 00:16:20,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:20" (1/1) ... [2022-01-11 00:16:20,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:20" (1/1) ... [2022-01-11 00:16:20,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:20" (1/1) ... [2022-01-11 00:16:20,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:20" (1/1) ... [2022-01-11 00:16:20,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:20" (1/1) ... [2022-01-11 00:16:20,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 00:16:20,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 00:16:20,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 00:16:20,528 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 00:16:20,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:20" (1/1) ... [2022-01-11 00:16:20,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:16:20,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:16:20,587 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 00:16:20,592 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 00:16:20,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 00:16:20,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 00:16:20,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 00:16:20,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 00:16:20,692 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 00:16:20,693 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 00:16:21,284 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 00:16:21,293 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 00:16:21,293 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-01-11 00:16:21,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:16:21 BoogieIcfgContainer [2022-01-11 00:16:21,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 00:16:21,296 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 00:16:21,296 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 00:16:21,298 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 00:16:21,300 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:16:21" (1/1) ... [2022-01-11 00:16:21,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:16:21 BasicIcfg [2022-01-11 00:16:21,507 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 00:16:21,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 00:16:21,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 00:16:21,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 00:16:21,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 12:16:20" (1/4) ... [2022-01-11 00:16:21,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e8e75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:16:21, skipping insertion in model container [2022-01-11 00:16:21,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:20" (2/4) ... [2022-01-11 00:16:21,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e8e75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:16:21, skipping insertion in model container [2022-01-11 00:16:21,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:16:21" (3/4) ... [2022-01-11 00:16:21,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e8e75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:16:21, skipping insertion in model container [2022-01-11 00:16:21,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:16:21" (4/4) ... [2022-01-11 00:16:21,512 INFO L111 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.5.cil.cTransformedIcfg [2022-01-11 00:16:21,517 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 00:16:21,517 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-01-11 00:16:21,552 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 00:16:21,559 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 00:16:21,559 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-11 00:16:21,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 285 states, 279 states have (on average 1.8458781362007168) internal successors, (515), 284 states have internal predecessors, (515), 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 00:16:21,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-11 00:16:21,586 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:21,586 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] [2022-01-11 00:16:21,587 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:16:21,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:21,590 INFO L85 PathProgramCache]: Analyzing trace with hash -319750974, now seen corresponding path program 1 times [2022-01-11 00:16:21,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:21,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368617873] [2022-01-11 00:16:21,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:21,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:21,796 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 00:16:21,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:21,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368617873] [2022-01-11 00:16:21,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368617873] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:21,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:21,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:21,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421340249] [2022-01-11 00:16:21,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:21,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:21,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:21,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:21,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:21,827 INFO L87 Difference]: Start difference. First operand has 285 states, 279 states have (on average 1.8458781362007168) internal successors, (515), 284 states have internal predecessors, (515), 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 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 00:16:22,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:22,100 INFO L93 Difference]: Finished difference Result 748 states and 1351 transitions. [2022-01-11 00:16:22,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:22,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2022-01-11 00:16:22,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:22,111 INFO L225 Difference]: With dead ends: 748 [2022-01-11 00:16:22,111 INFO L226 Difference]: Without dead ends: 460 [2022-01-11 00:16:22,114 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 00:16:22,115 INFO L933 BasicCegarLoop]: 482 mSDtfsCounter, 270 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:22,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 795 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 00:16:22,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-01-11 00:16:22,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 444. [2022-01-11 00:16:22,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 439 states have (on average 1.5990888382687927) internal successors, (702), 443 states have internal predecessors, (702), 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 00:16:22,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 702 transitions. [2022-01-11 00:16:22,187 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 702 transitions. Word has length 28 [2022-01-11 00:16:22,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:22,187 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 702 transitions. [2022-01-11 00:16:22,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 00:16:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 702 transitions. [2022-01-11 00:16:22,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-11 00:16:22,189 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:22,189 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] [2022-01-11 00:16:22,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 00:16:22,189 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:16:22,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:22,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1507915958, now seen corresponding path program 1 times [2022-01-11 00:16:22,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:22,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035585417] [2022-01-11 00:16:22,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:22,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:22,289 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 00:16:22,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:22,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035585417] [2022-01-11 00:16:22,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035585417] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:22,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:22,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:22,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518108325] [2022-01-11 00:16:22,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:22,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:22,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:22,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:22,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:22,294 INFO L87 Difference]: Start difference. First operand 444 states and 702 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 00:16:22,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:22,374 INFO L93 Difference]: Finished difference Result 1259 states and 1982 transitions. [2022-01-11 00:16:22,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:22,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 40 [2022-01-11 00:16:22,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:22,378 INFO L225 Difference]: With dead ends: 1259 [2022-01-11 00:16:22,378 INFO L226 Difference]: Without dead ends: 826 [2022-01-11 00:16:22,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 00:16:22,384 INFO L933 BasicCegarLoop]: 444 mSDtfsCounter, 377 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:22,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 837 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:16:22,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2022-01-11 00:16:22,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 812. [2022-01-11 00:16:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 807 states have (on average 1.5427509293680297) internal successors, (1245), 811 states have internal predecessors, (1245), 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 00:16:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1245 transitions. [2022-01-11 00:16:22,433 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1245 transitions. Word has length 40 [2022-01-11 00:16:22,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:22,434 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1245 transitions. [2022-01-11 00:16:22,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 00:16:22,434 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1245 transitions. [2022-01-11 00:16:22,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-11 00:16:22,439 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:22,440 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] [2022-01-11 00:16:22,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 00:16:22,441 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:16:22,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:22,445 INFO L85 PathProgramCache]: Analyzing trace with hash -741204338, now seen corresponding path program 1 times [2022-01-11 00:16:22,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:22,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46759361] [2022-01-11 00:16:22,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:22,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:22,503 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 00:16:22,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:22,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46759361] [2022-01-11 00:16:22,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46759361] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:22,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:22,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:22,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371899384] [2022-01-11 00:16:22,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:22,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:22,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:22,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:22,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:22,506 INFO L87 Difference]: Start difference. First operand 812 states and 1245 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 00:16:22,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:22,612 INFO L93 Difference]: Finished difference Result 2145 states and 3343 transitions. [2022-01-11 00:16:22,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:22,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 40 [2022-01-11 00:16:22,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:22,617 INFO L225 Difference]: With dead ends: 2145 [2022-01-11 00:16:22,618 INFO L226 Difference]: Without dead ends: 1345 [2022-01-11 00:16:22,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 00:16:22,623 INFO L933 BasicCegarLoop]: 629 mSDtfsCounter, 327 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:22,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 1008 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:16:22,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2022-01-11 00:16:22,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1323. [2022-01-11 00:16:22,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 1318 states have (on average 1.5819423368740515) internal successors, (2085), 1322 states have internal predecessors, (2085), 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 00:16:22,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 2085 transitions. [2022-01-11 00:16:22,650 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 2085 transitions. Word has length 40 [2022-01-11 00:16:22,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:22,650 INFO L470 AbstractCegarLoop]: Abstraction has 1323 states and 2085 transitions. [2022-01-11 00:16:22,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 00:16:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 2085 transitions. [2022-01-11 00:16:22,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-11 00:16:22,653 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:22,653 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] [2022-01-11 00:16:22,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 00:16:22,653 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:16:22,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:22,654 INFO L85 PathProgramCache]: Analyzing trace with hash -793476159, now seen corresponding path program 1 times [2022-01-11 00:16:22,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:22,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566247327] [2022-01-11 00:16:22,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:22,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:22,710 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 00:16:22,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:22,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566247327] [2022-01-11 00:16:22,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566247327] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:22,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:22,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:22,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097690028] [2022-01-11 00:16:22,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:22,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:22,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:22,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:22,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:22,712 INFO L87 Difference]: Start difference. First operand 1323 states and 2085 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 00:16:22,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:22,766 INFO L93 Difference]: Finished difference Result 3291 states and 5187 transitions. [2022-01-11 00:16:22,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:22,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 41 [2022-01-11 00:16:22,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:22,771 INFO L225 Difference]: With dead ends: 3291 [2022-01-11 00:16:22,772 INFO L226 Difference]: Without dead ends: 1989 [2022-01-11 00:16:22,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 00:16:22,777 INFO L933 BasicCegarLoop]: 448 mSDtfsCounter, 354 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:22,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 813 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:22,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2022-01-11 00:16:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1955. [2022-01-11 00:16:22,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1955 states, 1950 states have (on average 1.5769230769230769) internal successors, (3075), 1954 states have internal predecessors, (3075), 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 00:16:22,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 3075 transitions. [2022-01-11 00:16:22,829 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 3075 transitions. Word has length 41 [2022-01-11 00:16:22,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:22,829 INFO L470 AbstractCegarLoop]: Abstraction has 1955 states and 3075 transitions. [2022-01-11 00:16:22,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 00:16:22,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 3075 transitions. [2022-01-11 00:16:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-11 00:16:22,830 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:22,831 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 00:16:22,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 00:16:22,831 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:16:22,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:22,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2093159616, now seen corresponding path program 1 times [2022-01-11 00:16:22,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:22,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151573382] [2022-01-11 00:16:22,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:22,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:22,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:22,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151573382] [2022-01-11 00:16:22,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151573382] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:22,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:22,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:22,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907921231] [2022-01-11 00:16:22,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:22,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:22,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:22,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:22,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:22,903 INFO L87 Difference]: Start difference. First operand 1955 states and 3075 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 00:16:22,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:22,992 INFO L93 Difference]: Finished difference Result 4864 states and 7692 transitions. [2022-01-11 00:16:22,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:22,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 47 [2022-01-11 00:16:22,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:23,001 INFO L225 Difference]: With dead ends: 4864 [2022-01-11 00:16:23,001 INFO L226 Difference]: Without dead ends: 2930 [2022-01-11 00:16:23,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 00:16:23,003 INFO L933 BasicCegarLoop]: 720 mSDtfsCounter, 415 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:23,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [415 Valid, 1073 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:23,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2022-01-11 00:16:23,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2764. [2022-01-11 00:16:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 2759 states have (on average 1.5719463573758607) internal successors, (4337), 2763 states have internal predecessors, (4337), 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 00:16:23,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 4337 transitions. [2022-01-11 00:16:23,073 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 4337 transitions. Word has length 47 [2022-01-11 00:16:23,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:23,075 INFO L470 AbstractCegarLoop]: Abstraction has 2764 states and 4337 transitions. [2022-01-11 00:16:23,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 00:16:23,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 4337 transitions. [2022-01-11 00:16:23,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 00:16:23,079 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:23,079 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] [2022-01-11 00:16:23,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 00:16:23,080 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:16:23,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:23,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1748759024, now seen corresponding path program 1 times [2022-01-11 00:16:23,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:23,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929644454] [2022-01-11 00:16:23,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:23,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:23,122 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 00:16:23,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:23,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929644454] [2022-01-11 00:16:23,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929644454] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:23,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:23,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:23,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544711516] [2022-01-11 00:16:23,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:23,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:23,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:23,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:23,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:23,124 INFO L87 Difference]: Start difference. First operand 2764 states and 4337 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 00:16:23,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:23,217 INFO L93 Difference]: Finished difference Result 5775 states and 9097 transitions. [2022-01-11 00:16:23,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:23,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2022-01-11 00:16:23,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:23,226 INFO L225 Difference]: With dead ends: 5775 [2022-01-11 00:16:23,227 INFO L226 Difference]: Without dead ends: 3081 [2022-01-11 00:16:23,229 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 00:16:23,230 INFO L933 BasicCegarLoop]: 448 mSDtfsCounter, 372 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:23,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 726 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:23,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2022-01-11 00:16:23,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2971. [2022-01-11 00:16:23,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2971 states, 2966 states have (on average 1.5684423465947404) internal successors, (4652), 2970 states have internal predecessors, (4652), 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 00:16:23,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2971 states and 4652 transitions. [2022-01-11 00:16:23,349 INFO L78 Accepts]: Start accepts. Automaton has 2971 states and 4652 transitions. Word has length 52 [2022-01-11 00:16:23,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:23,349 INFO L470 AbstractCegarLoop]: Abstraction has 2971 states and 4652 transitions. [2022-01-11 00:16:23,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 00:16:23,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 4652 transitions. [2022-01-11 00:16:23,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-11 00:16:23,350 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:23,350 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:23,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 00:16:23,351 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:16:23,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:23,351 INFO L85 PathProgramCache]: Analyzing trace with hash 98493340, now seen corresponding path program 1 times [2022-01-11 00:16:23,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:23,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603234721] [2022-01-11 00:16:23,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:23,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:23,386 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 00:16:23,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:23,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603234721] [2022-01-11 00:16:23,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603234721] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:23,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:23,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:23,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829261624] [2022-01-11 00:16:23,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:23,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:23,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:23,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:23,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:23,387 INFO L87 Difference]: Start difference. First operand 2971 states and 4652 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 00:16:23,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:23,644 INFO L93 Difference]: Finished difference Result 7138 states and 11272 transitions. [2022-01-11 00:16:23,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:23,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 61 [2022-01-11 00:16:23,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:23,656 INFO L225 Difference]: With dead ends: 7138 [2022-01-11 00:16:23,656 INFO L226 Difference]: Without dead ends: 4237 [2022-01-11 00:16:23,659 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 00:16:23,659 INFO L933 BasicCegarLoop]: 551 mSDtfsCounter, 364 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:23,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 790 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 00:16:23,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4237 states. [2022-01-11 00:16:23,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4237 to 4150. [2022-01-11 00:16:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4150 states, 4145 states have (on average 1.5565741857659832) internal successors, (6452), 4149 states have internal predecessors, (6452), 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 00:16:23,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4150 states to 4150 states and 6452 transitions. [2022-01-11 00:16:23,813 INFO L78 Accepts]: Start accepts. Automaton has 4150 states and 6452 transitions. Word has length 61 [2022-01-11 00:16:23,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:23,813 INFO L470 AbstractCegarLoop]: Abstraction has 4150 states and 6452 transitions. [2022-01-11 00:16:23,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 00:16:23,813 INFO L276 IsEmpty]: Start isEmpty. Operand 4150 states and 6452 transitions. [2022-01-11 00:16:23,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-11 00:16:23,814 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:23,815 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:23,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 00:16:23,815 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:16:23,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:23,815 INFO L85 PathProgramCache]: Analyzing trace with hash 305800857, now seen corresponding path program 1 times [2022-01-11 00:16:23,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:23,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144132426] [2022-01-11 00:16:23,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:23,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:23,878 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 00:16:23,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:23,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144132426] [2022-01-11 00:16:23,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144132426] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:23,878 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:23,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:23,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239652326] [2022-01-11 00:16:23,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:23,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:23,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:23,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:23,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:23,880 INFO L87 Difference]: Start difference. First operand 4150 states and 6452 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 00:16:24,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:24,016 INFO L93 Difference]: Finished difference Result 8230 states and 12820 transitions. [2022-01-11 00:16:24,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:24,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 63 [2022-01-11 00:16:24,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:24,028 INFO L225 Difference]: With dead ends: 8230 [2022-01-11 00:16:24,028 INFO L226 Difference]: Without dead ends: 4150 [2022-01-11 00:16:24,033 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 00:16:24,034 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 349 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:24,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [349 Valid, 447 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:24,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4150 states. [2022-01-11 00:16:24,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4150 to 4150. [2022-01-11 00:16:24,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4150 states, 4145 states have (on average 1.5348612786489746) internal successors, (6362), 4149 states have internal predecessors, (6362), 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 00:16:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4150 states to 4150 states and 6362 transitions. [2022-01-11 00:16:24,187 INFO L78 Accepts]: Start accepts. Automaton has 4150 states and 6362 transitions. Word has length 63 [2022-01-11 00:16:24,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:24,188 INFO L470 AbstractCegarLoop]: Abstraction has 4150 states and 6362 transitions. [2022-01-11 00:16:24,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 00:16:24,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4150 states and 6362 transitions. [2022-01-11 00:16:24,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-11 00:16:24,189 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:24,189 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:24,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 00:16:24,190 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:16:24,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:24,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1111301354, now seen corresponding path program 1 times [2022-01-11 00:16:24,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:24,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625799430] [2022-01-11 00:16:24,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:24,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:24,225 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 00:16:24,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:24,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625799430] [2022-01-11 00:16:24,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625799430] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:24,225 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:24,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:24,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196016707] [2022-01-11 00:16:24,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:24,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:24,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:24,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:24,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:24,226 INFO L87 Difference]: Start difference. First operand 4150 states and 6362 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 00:16:24,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:24,482 INFO L93 Difference]: Finished difference Result 9374 states and 14422 transitions. [2022-01-11 00:16:24,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:24,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2022-01-11 00:16:24,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:24,497 INFO L225 Difference]: With dead ends: 9374 [2022-01-11 00:16:24,497 INFO L226 Difference]: Without dead ends: 5294 [2022-01-11 00:16:24,501 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 00:16:24,502 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 247 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:24,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 865 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:16:24,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5294 states. [2022-01-11 00:16:24,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5294 to 5214. [2022-01-11 00:16:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5214 states, 5209 states have (on average 1.5023996928393166) internal successors, (7826), 5213 states have internal predecessors, (7826), 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 00:16:24,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5214 states to 5214 states and 7826 transitions. [2022-01-11 00:16:24,668 INFO L78 Accepts]: Start accepts. Automaton has 5214 states and 7826 transitions. Word has length 64 [2022-01-11 00:16:24,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:24,669 INFO L470 AbstractCegarLoop]: Abstraction has 5214 states and 7826 transitions. [2022-01-11 00:16:24,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 00:16:24,669 INFO L276 IsEmpty]: Start isEmpty. Operand 5214 states and 7826 transitions. [2022-01-11 00:16:24,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 00:16:24,670 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:24,670 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:24,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 00:16:24,670 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:16:24,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:24,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1235964956, now seen corresponding path program 1 times [2022-01-11 00:16:24,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:24,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363032991] [2022-01-11 00:16:24,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:24,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:24,709 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 00:16:24,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:24,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363032991] [2022-01-11 00:16:24,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363032991] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:24,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:24,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:16:24,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248408481] [2022-01-11 00:16:24,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:24,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:16:24,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:24,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:16:24,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:16:24,710 INFO L87 Difference]: Start difference. First operand 5214 states and 7826 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 00:16:25,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:25,302 INFO L93 Difference]: Finished difference Result 24855 states and 37216 transitions. [2022-01-11 00:16:25,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-11 00:16:25,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2022-01-11 00:16:25,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:25,336 INFO L225 Difference]: With dead ends: 24855 [2022-01-11 00:16:25,337 INFO L226 Difference]: Without dead ends: 19984 [2022-01-11 00:16:25,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-11 00:16:25,348 INFO L933 BasicCegarLoop]: 1390 mSDtfsCounter, 1536 mSDsluCounter, 2995 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 4385 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:25,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1536 Valid, 4385 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:16:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19984 states. [2022-01-11 00:16:25,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19984 to 7154. [2022-01-11 00:16:25,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7154 states, 7149 states have (on average 1.4939152328997063) internal successors, (10680), 7153 states have internal predecessors, (10680), 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 00:16:25,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7154 states to 7154 states and 10680 transitions. [2022-01-11 00:16:25,713 INFO L78 Accepts]: Start accepts. Automaton has 7154 states and 10680 transitions. Word has length 66 [2022-01-11 00:16:25,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:25,714 INFO L470 AbstractCegarLoop]: Abstraction has 7154 states and 10680 transitions. [2022-01-11 00:16:25,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 00:16:25,714 INFO L276 IsEmpty]: Start isEmpty. Operand 7154 states and 10680 transitions. [2022-01-11 00:16:25,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-11 00:16:25,715 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:25,716 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:25,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 00:16:25,716 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:16:25,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:25,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1944352916, now seen corresponding path program 1 times [2022-01-11 00:16:25,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:25,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931858022] [2022-01-11 00:16:25,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:25,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:25,778 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 00:16:25,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:25,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931858022] [2022-01-11 00:16:25,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931858022] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:25,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:25,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 00:16:25,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572669362] [2022-01-11 00:16:25,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:25,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 00:16:25,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:25,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 00:16:25,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-11 00:16:25,779 INFO L87 Difference]: Start difference. First operand 7154 states and 10680 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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 00:16:27,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:27,343 INFO L93 Difference]: Finished difference Result 32870 states and 48987 transitions. [2022-01-11 00:16:27,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-11 00:16:27,344 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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 67 [2022-01-11 00:16:27,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:27,399 INFO L225 Difference]: With dead ends: 32870 [2022-01-11 00:16:27,400 INFO L226 Difference]: Without dead ends: 25737 [2022-01-11 00:16:27,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2022-01-11 00:16:27,414 INFO L933 BasicCegarLoop]: 1863 mSDtfsCounter, 3572 mSDsluCounter, 6564 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3572 SdHoareTripleChecker+Valid, 8427 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:27,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3572 Valid, 8427 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 00:16:27,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25737 states. [2022-01-11 00:16:27,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25737 to 4501. [2022-01-11 00:16:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4501 states, 4496 states have (on average 1.4826512455516014) internal successors, (6666), 4500 states have internal predecessors, (6666), 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 00:16:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4501 states to 4501 states and 6666 transitions. [2022-01-11 00:16:27,820 INFO L78 Accepts]: Start accepts. Automaton has 4501 states and 6666 transitions. Word has length 67 [2022-01-11 00:16:27,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:27,820 INFO L470 AbstractCegarLoop]: Abstraction has 4501 states and 6666 transitions. [2022-01-11 00:16:27,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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 00:16:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand 4501 states and 6666 transitions. [2022-01-11 00:16:27,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-01-11 00:16:27,821 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:27,821 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 00:16:27,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 00:16:27,822 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:16:27,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:27,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1257255203, now seen corresponding path program 1 times [2022-01-11 00:16:27,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:27,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928092353] [2022-01-11 00:16:27,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:27,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:27,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:27,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928092353] [2022-01-11 00:16:27,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928092353] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:27,849 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:27,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:27,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366082942] [2022-01-11 00:16:27,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:27,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:27,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:27,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:27,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:27,850 INFO L87 Difference]: Start difference. First operand 4501 states and 6666 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 00:16:28,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:28,298 INFO L93 Difference]: Finished difference Result 10994 states and 16194 transitions. [2022-01-11 00:16:28,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:28,307 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 00:16:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:28,319 INFO L225 Difference]: With dead ends: 10994 [2022-01-11 00:16:28,319 INFO L226 Difference]: Without dead ends: 6402 [2022-01-11 00:16:28,335 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 00:16:28,336 INFO L933 BasicCegarLoop]: 664 mSDtfsCounter, 280 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:28,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 1057 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:16:28,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6402 states. [2022-01-11 00:16:28,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6402 to 6347. [2022-01-11 00:16:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6347 states, 6342 states have (on average 1.4635761589403973) internal successors, (9282), 6346 states have internal predecessors, (9282), 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 00:16:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6347 states to 6347 states and 9282 transitions. [2022-01-11 00:16:28,654 INFO L78 Accepts]: Start accepts. Automaton has 6347 states and 9282 transitions. Word has length 90 [2022-01-11 00:16:28,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:28,655 INFO L470 AbstractCegarLoop]: Abstraction has 6347 states and 9282 transitions. [2022-01-11 00:16:28,655 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 00:16:28,655 INFO L276 IsEmpty]: Start isEmpty. Operand 6347 states and 9282 transitions. [2022-01-11 00:16:28,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-01-11 00:16:28,656 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:28,656 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 00:16:28,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 00:16:28,657 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:16:28,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:28,657 INFO L85 PathProgramCache]: Analyzing trace with hash -313869179, now seen corresponding path program 1 times [2022-01-11 00:16:28,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:28,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574174973] [2022-01-11 00:16:28,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:28,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:28,691 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:28,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:28,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574174973] [2022-01-11 00:16:28,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574174973] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:28,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:28,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:28,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392306326] [2022-01-11 00:16:28,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:28,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:28,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:28,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:28,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:28,692 INFO L87 Difference]: Start difference. First operand 6347 states and 9282 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 00:16:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:29,002 INFO L93 Difference]: Finished difference Result 10960 states and 15886 transitions. [2022-01-11 00:16:29,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:29,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 98 [2022-01-11 00:16:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:29,009 INFO L225 Difference]: With dead ends: 10960 [2022-01-11 00:16:29,009 INFO L226 Difference]: Without dead ends: 4542 [2022-01-11 00:16:29,015 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 00:16:29,016 INFO L933 BasicCegarLoop]: 453 mSDtfsCounter, 344 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:29,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 546 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:29,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4542 states. [2022-01-11 00:16:29,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4542 to 4476. [2022-01-11 00:16:29,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4476 states, 4471 states have (on average 1.375083873853724) internal successors, (6148), 4475 states have internal predecessors, (6148), 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 00:16:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4476 states to 4476 states and 6148 transitions. [2022-01-11 00:16:29,246 INFO L78 Accepts]: Start accepts. Automaton has 4476 states and 6148 transitions. Word has length 98 [2022-01-11 00:16:29,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:29,246 INFO L470 AbstractCegarLoop]: Abstraction has 4476 states and 6148 transitions. [2022-01-11 00:16:29,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 00:16:29,246 INFO L276 IsEmpty]: Start isEmpty. Operand 4476 states and 6148 transitions. [2022-01-11 00:16:29,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-11 00:16:29,247 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:29,247 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:29,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 00:16:29,248 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:16:29,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:29,248 INFO L85 PathProgramCache]: Analyzing trace with hash -822934681, now seen corresponding path program 1 times [2022-01-11 00:16:29,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:29,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473990438] [2022-01-11 00:16:29,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:29,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-11 00:16:29,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:29,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473990438] [2022-01-11 00:16:29,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473990438] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:29,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:29,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:29,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330115461] [2022-01-11 00:16:29,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:29,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:29,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:29,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:29,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:29,290 INFO L87 Difference]: Start difference. First operand 4476 states and 6148 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 00:16:29,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:29,531 INFO L93 Difference]: Finished difference Result 7981 states and 10991 transitions. [2022-01-11 00:16:29,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:29,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 100 [2022-01-11 00:16:29,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:29,536 INFO L225 Difference]: With dead ends: 7981 [2022-01-11 00:16:29,537 INFO L226 Difference]: Without dead ends: 3537 [2022-01-11 00:16:29,540 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 00:16:29,541 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 269 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:29,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 427 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:29,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states. [2022-01-11 00:16:29,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 3233. [2022-01-11 00:16:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3233 states, 3228 states have (on average 1.3429368029739777) internal successors, (4335), 3232 states have internal predecessors, (4335), 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 00:16:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3233 states to 3233 states and 4335 transitions. [2022-01-11 00:16:29,718 INFO L78 Accepts]: Start accepts. Automaton has 3233 states and 4335 transitions. Word has length 100 [2022-01-11 00:16:29,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:29,719 INFO L470 AbstractCegarLoop]: Abstraction has 3233 states and 4335 transitions. [2022-01-11 00:16:29,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 00:16:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3233 states and 4335 transitions. [2022-01-11 00:16:29,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-11 00:16:29,721 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:29,722 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:29,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 00:16:29,722 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:16:29,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:29,722 INFO L85 PathProgramCache]: Analyzing trace with hash -821921787, now seen corresponding path program 1 times [2022-01-11 00:16:29,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:29,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649157726] [2022-01-11 00:16:29,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:29,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:29,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 00:16:29,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:29,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649157726] [2022-01-11 00:16:29,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649157726] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:29,768 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:29,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:29,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808783227] [2022-01-11 00:16:29,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:29,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:29,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:29,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:29,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:29,769 INFO L87 Difference]: Start difference. First operand 3233 states and 4335 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 00:16:29,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:29,974 INFO L93 Difference]: Finished difference Result 6271 states and 8450 transitions. [2022-01-11 00:16:29,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:29,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 100 [2022-01-11 00:16:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:29,978 INFO L225 Difference]: With dead ends: 6271 [2022-01-11 00:16:29,978 INFO L226 Difference]: Without dead ends: 3227 [2022-01-11 00:16:29,983 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 00:16:29,983 INFO L933 BasicCegarLoop]: 446 mSDtfsCounter, 339 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:29,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 539 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:29,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2022-01-11 00:16:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 3215. [2022-01-11 00:16:30,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3215 states, 3210 states have (on average 1.3021806853582554) internal successors, (4180), 3214 states have internal predecessors, (4180), 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 00:16:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3215 states to 3215 states and 4180 transitions. [2022-01-11 00:16:30,215 INFO L78 Accepts]: Start accepts. Automaton has 3215 states and 4180 transitions. Word has length 100 [2022-01-11 00:16:30,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:30,215 INFO L470 AbstractCegarLoop]: Abstraction has 3215 states and 4180 transitions. [2022-01-11 00:16:30,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 00:16:30,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3215 states and 4180 transitions. [2022-01-11 00:16:30,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-11 00:16:30,216 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:30,216 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:30,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 00:16:30,216 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:16:30,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:30,217 INFO L85 PathProgramCache]: Analyzing trace with hash 258861384, now seen corresponding path program 1 times [2022-01-11 00:16:30,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:30,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641777801] [2022-01-11 00:16:30,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:30,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-11 00:16:30,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:30,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641777801] [2022-01-11 00:16:30,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641777801] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:30,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:30,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:30,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553509141] [2022-01-11 00:16:30,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:30,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:30,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:30,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:30,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:30,255 INFO L87 Difference]: Start difference. First operand 3215 states and 4180 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 00:16:30,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:30,496 INFO L93 Difference]: Finished difference Result 3233 states and 4194 transitions. [2022-01-11 00:16:30,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:30,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 101 [2022-01-11 00:16:30,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:30,500 INFO L225 Difference]: With dead ends: 3233 [2022-01-11 00:16:30,500 INFO L226 Difference]: Without dead ends: 3229 [2022-01-11 00:16:30,501 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 00:16:30,501 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 231 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:30,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 702 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:30,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2022-01-11 00:16:30,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 3215. [2022-01-11 00:16:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3215 states, 3210 states have (on average 1.2953271028037383) internal successors, (4158), 3214 states have internal predecessors, (4158), 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 00:16:30,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3215 states to 3215 states and 4158 transitions. [2022-01-11 00:16:30,751 INFO L78 Accepts]: Start accepts. Automaton has 3215 states and 4158 transitions. Word has length 101 [2022-01-11 00:16:30,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:30,752 INFO L470 AbstractCegarLoop]: Abstraction has 3215 states and 4158 transitions. [2022-01-11 00:16:30,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 00:16:30,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3215 states and 4158 transitions. [2022-01-11 00:16:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-11 00:16:30,754 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:30,754 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:30,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 00:16:30,755 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:16:30,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:30,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1487283088, now seen corresponding path program 1 times [2022-01-11 00:16:30,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:30,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727225963] [2022-01-11 00:16:30,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:30,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-11 00:16:30,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:30,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727225963] [2022-01-11 00:16:30,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727225963] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:30,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:30,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-11 00:16:30,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299485959] [2022-01-11 00:16:30,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:30,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 00:16:30,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:30,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 00:16:30,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-11 00:16:30,827 INFO L87 Difference]: Start difference. First operand 3215 states and 4158 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 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 00:16:31,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:31,973 INFO L93 Difference]: Finished difference Result 15466 states and 20034 transitions. [2022-01-11 00:16:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-11 00:16:31,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 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 163 [2022-01-11 00:16:31,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:31,991 INFO L225 Difference]: With dead ends: 15466 [2022-01-11 00:16:31,991 INFO L226 Difference]: Without dead ends: 12434 [2022-01-11 00:16:31,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-01-11 00:16:31,998 INFO L933 BasicCegarLoop]: 1220 mSDtfsCounter, 1826 mSDsluCounter, 3467 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1826 SdHoareTripleChecker+Valid, 4687 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:31,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1826 Valid, 4687 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:16:32,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12434 states. [2022-01-11 00:16:32,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12434 to 3217. [2022-01-11 00:16:32,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3217 states, 3212 states have (on average 1.2926525529265256) internal successors, (4152), 3216 states have internal predecessors, (4152), 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 00:16:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 4152 transitions. [2022-01-11 00:16:32,285 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 4152 transitions. Word has length 163 [2022-01-11 00:16:32,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:32,285 INFO L470 AbstractCegarLoop]: Abstraction has 3217 states and 4152 transitions. [2022-01-11 00:16:32,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 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 00:16:32,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 4152 transitions. [2022-01-11 00:16:32,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 00:16:32,287 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:32,288 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:32,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 00:16:32,288 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:16:32,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:32,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1137049130, now seen corresponding path program 1 times [2022-01-11 00:16:32,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:32,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22062176] [2022-01-11 00:16:32,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:32,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 46 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 00:16:32,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:32,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22062176] [2022-01-11 00:16:32,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22062176] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 00:16:32,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760334526] [2022-01-11 00:16:32,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:32,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:16:32,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:16:32,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 00:16:32,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 00:16:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:32,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-11 00:16:32,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 00:16:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-11 00:16:33,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 00:16:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-11 00:16:33,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760334526] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 00:16:33,505 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 00:16:33,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 26 [2022-01-11 00:16:33,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976436079] [2022-01-11 00:16:33,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 00:16:33,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-11 00:16:33,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:33,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-11 00:16:33,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2022-01-11 00:16:33,507 INFO L87 Difference]: Start difference. First operand 3217 states and 4152 transitions. Second operand has 26 states, 26 states have (on average 14.5) internal successors, (377), 26 states have internal predecessors, (377), 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 00:16:49,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:49,006 INFO L93 Difference]: Finished difference Result 72563 states and 94533 transitions. [2022-01-11 00:16:49,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 289 states. [2022-01-11 00:16:49,007 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 14.5) internal successors, (377), 26 states have internal predecessors, (377), 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 00:16:49,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:49,122 INFO L225 Difference]: With dead ends: 72563 [2022-01-11 00:16:49,122 INFO L226 Difference]: Without dead ends: 69551 [2022-01-11 00:16:49,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 469 SyntacticMatches, 3 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41283 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=8741, Invalid=85201, Unknown=0, NotChecked=0, Total=93942 [2022-01-11 00:16:49,153 INFO L933 BasicCegarLoop]: 6068 mSDtfsCounter, 33571 mSDsluCounter, 66162 mSDsCounter, 0 mSdLazyCounter, 5677 mSolverCounterSat, 889 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33571 SdHoareTripleChecker+Valid, 72230 SdHoareTripleChecker+Invalid, 6566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 889 IncrementalHoareTripleChecker+Valid, 5677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:49,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33571 Valid, 72230 Invalid, 6566 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [889 Valid, 5677 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-01-11 00:16:49,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69551 states. [2022-01-11 00:16:50,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69551 to 6411. [2022-01-11 00:16:50,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6411 states, 6406 states have (on average 1.3111145800811739) internal successors, (8399), 6410 states have internal predecessors, (8399), 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 00:16:50,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6411 states to 6411 states and 8399 transitions. [2022-01-11 00:16:50,354 INFO L78 Accepts]: Start accepts. Automaton has 6411 states and 8399 transitions. Word has length 165 [2022-01-11 00:16:50,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:50,355 INFO L470 AbstractCegarLoop]: Abstraction has 6411 states and 8399 transitions. [2022-01-11 00:16:50,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 14.5) internal successors, (377), 26 states have internal predecessors, (377), 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 00:16:50,355 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 8399 transitions. [2022-01-11 00:16:50,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2022-01-11 00:16:50,359 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:50,359 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:50,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-11 00:16:50,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-11 00:16:50,561 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:16:50,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:50,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1639436138, now seen corresponding path program 1 times [2022-01-11 00:16:50,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:50,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812649663] [2022-01-11 00:16:50,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:50,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:50,788 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 317 proven. 46 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-01-11 00:16:50,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:50,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812649663] [2022-01-11 00:16:50,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812649663] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 00:16:50,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958820421] [2022-01-11 00:16:50,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:50,788 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:16:50,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:16:50,804 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 00:16:50,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-11 00:16:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:51,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 2560 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-11 00:16:51,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 00:16:51,661 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 317 proven. 44 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-01-11 00:16:51,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 00:16:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 89 proven. 387 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-11 00:16:52,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958820421] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 00:16:52,726 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 00:16:52,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 21] total 32 [2022-01-11 00:16:52,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115971569] [2022-01-11 00:16:52,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 00:16:52,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-11 00:16:52,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:52,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-11 00:16:52,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2022-01-11 00:16:52,728 INFO L87 Difference]: Start difference. First operand 6411 states and 8399 transitions. Second operand has 32 states, 32 states have (on average 19.125) internal successors, (612), 32 states have internal predecessors, (612), 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 00:17:05,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:17:05,733 INFO L93 Difference]: Finished difference Result 50139 states and 65242 transitions. [2022-01-11 00:17:05,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2022-01-11 00:17:05,734 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 19.125) internal successors, (612), 32 states have internal predecessors, (612), 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 363 [2022-01-11 00:17:05,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:17:05,805 INFO L225 Difference]: With dead ends: 50139 [2022-01-11 00:17:05,805 INFO L226 Difference]: Without dead ends: 43933 [2022-01-11 00:17:05,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1062 GetRequests, 812 SyntacticMatches, 2 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25403 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5093, Invalid=57157, Unknown=0, NotChecked=0, Total=62250 [2022-01-11 00:17:05,831 INFO L933 BasicCegarLoop]: 2797 mSDtfsCounter, 32187 mSDsluCounter, 50439 mSDsCounter, 0 mSdLazyCounter, 5059 mSolverCounterSat, 901 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32187 SdHoareTripleChecker+Valid, 53236 SdHoareTripleChecker+Invalid, 5960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 901 IncrementalHoareTripleChecker+Valid, 5059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:17:05,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32187 Valid, 53236 Invalid, 5960 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [901 Valid, 5059 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-11 00:17:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43933 states. [2022-01-11 00:17:07,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43933 to 6411. [2022-01-11 00:17:07,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6411 states, 6406 states have (on average 1.310490165469872) internal successors, (8395), 6410 states have internal predecessors, (8395), 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 00:17:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6411 states to 6411 states and 8395 transitions. [2022-01-11 00:17:07,036 INFO L78 Accepts]: Start accepts. Automaton has 6411 states and 8395 transitions. Word has length 363 [2022-01-11 00:17:07,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:17:07,037 INFO L470 AbstractCegarLoop]: Abstraction has 6411 states and 8395 transitions. [2022-01-11 00:17:07,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 19.125) internal successors, (612), 32 states have internal predecessors, (612), 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 00:17:07,064 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 8395 transitions. [2022-01-11 00:17:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2022-01-11 00:17:07,068 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:17:07,069 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:17:07,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-11 00:17:07,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:17:07,270 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 00:17:07,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:17:07,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1568405218, now seen corresponding path program 1 times [2022-01-11 00:17:07,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:17:07,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933712697] [2022-01-11 00:17:07,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:07,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:17:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:07,566 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 415 proven. 52 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-11 00:17:07,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:17:07,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933712697] [2022-01-11 00:17:07,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933712697] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 00:17:07,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953738649] [2022-01-11 00:17:07,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:17:07,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:17:07,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:17:07,568 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 00:17:07,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-11 00:17:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:17:07,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 2566 conjuncts, 47 conjunts are in the unsatisfiable core [2022-01-11 00:17:07,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 00:17:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 459 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-11 00:17:09,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 00:17:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 267 proven. 204 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-11 00:17:10,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953738649] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 00:17:10,273 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 00:17:10,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 22] total 42 [2022-01-11 00:17:10,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822598240] [2022-01-11 00:17:10,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 00:17:10,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-11 00:17:10,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:17:10,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-11 00:17:10,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1546, Unknown=0, NotChecked=0, Total=1722 [2022-01-11 00:17:10,275 INFO L87 Difference]: Start difference. First operand 6411 states and 8395 transitions. Second operand has 42 states, 42 states have (on average 16.11904761904762) internal successors, (677), 42 states have internal predecessors, (677), 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)