/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/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 21:42:45,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 21:42:45,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 21:42:45,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 21:42:45,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 21:42:45,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 21:42:45,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 21:42:45,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 21:42:45,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 21:42:45,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 21:42:45,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 21:42:45,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 21:42:45,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 21:42:45,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 21:42:45,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 21:42:45,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 21:42:45,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 21:42:45,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 21:42:45,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 21:42:45,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 21:42:45,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 21:42:45,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 21:42:45,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 21:42:45,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 21:42:45,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 21:42:45,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 21:42:45,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 21:42:45,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 21:42:45,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 21:42:45,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 21:42:45,114 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 21:42:45,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 21:42:45,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 21:42:45,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 21:42:45,116 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 21:42:45,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 21:42:45,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 21:42:45,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 21:42:45,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 21:42:45,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 21:42:45,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 21:42:45,123 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-10 21:42:45,136 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 21:42:45,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 21:42:45,137 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 21:42:45,137 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 21:42:45,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 21:42:45,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 21:42:45,138 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 21:42:45,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 21:42:45,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 21:42:45,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 21:42:45,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 21:42:45,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 21:42:45,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 21:42:45,138 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 21:42:45,138 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 21:42:45,138 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 21:42:45,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 21:42:45,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 21:42:45,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 21:42:45,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 21:42:45,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 21:42:45,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:42:45,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 21:42:45,146 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 21:42:45,146 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 21:42:45,146 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 21:42:45,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 21:42:45,146 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 21:42:45,147 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 21:42:45,147 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 21:42:45,147 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 21:42:45,147 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 21:42:45,148 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 21:42:45,148 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-10 21:42:45,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 21:42:45,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 21:42:45,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 21:42:45,368 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 21:42:45,369 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 21:42:45,369 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2022-01-10 21:42:45,407 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d0dce1d7/510105ac0b9e4e9d988c46a1e7e8e289/FLAG71b5f8879 [2022-01-10 21:42:45,753 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 21:42:45,753 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2022-01-10 21:42:45,758 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d0dce1d7/510105ac0b9e4e9d988c46a1e7e8e289/FLAG71b5f8879 [2022-01-10 21:42:45,766 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d0dce1d7/510105ac0b9e4e9d988c46a1e7e8e289 [2022-01-10 21:42:45,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 21:42:45,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 21:42:45,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 21:42:45,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 21:42:45,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 21:42:45,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:42:45" (1/1) ... [2022-01-10 21:42:45,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7d87a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:45, skipping insertion in model container [2022-01-10 21:42:45,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:42:45" (1/1) ... [2022-01-10 21:42:45,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 21:42:45,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 21:42:45,907 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c[2881,2894] [2022-01-10 21:42:45,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:42:45,919 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 21:42:45,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c[2881,2894] [2022-01-10 21:42:45,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:42:45,942 INFO L208 MainTranslator]: Completed translation [2022-01-10 21:42:45,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:45 WrapperNode [2022-01-10 21:42:45,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 21:42:45,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 21:42:45,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 21:42:45,943 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 21:42:45,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:45" (1/1) ... [2022-01-10 21:42:45,952 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:45" (1/1) ... [2022-01-10 21:42:45,963 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 97 [2022-01-10 21:42:45,963 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 21:42:45,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 21:42:45,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 21:42:45,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 21:42:45,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:45" (1/1) ... [2022-01-10 21:42:45,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:45" (1/1) ... [2022-01-10 21:42:45,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:45" (1/1) ... [2022-01-10 21:42:45,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:45" (1/1) ... [2022-01-10 21:42:45,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:45" (1/1) ... [2022-01-10 21:42:45,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:45" (1/1) ... [2022-01-10 21:42:45,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:45" (1/1) ... [2022-01-10 21:42:45,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 21:42:45,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 21:42:45,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 21:42:45,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 21:42:46,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:45" (1/1) ... [2022-01-10 21:42:46,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:42:46,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:42:46,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 21:42:46,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 21:42:46,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 21:42:46,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 21:42:46,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 21:42:46,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 21:42:46,097 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 21:42:46,098 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 21:42:46,208 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 21:42:46,214 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 21:42:46,214 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 21:42:46,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:42:46 BoogieIcfgContainer [2022-01-10 21:42:46,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 21:42:46,216 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 21:42:46,217 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 21:42:46,226 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 21:42:46,232 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:42:46" (1/1) ... [2022-01-10 21:42:46,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:42:46 BasicIcfg [2022-01-10 21:42:46,305 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 21:42:46,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 21:42:46,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 21:42:46,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 21:42:46,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 09:42:45" (1/4) ... [2022-01-10 21:42:46,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fdf07b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:42:46, skipping insertion in model container [2022-01-10 21:42:46,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:45" (2/4) ... [2022-01-10 21:42:46,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fdf07b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:42:46, skipping insertion in model container [2022-01-10 21:42:46,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:42:46" (3/4) ... [2022-01-10 21:42:46,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fdf07b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:42:46, skipping insertion in model container [2022-01-10 21:42:46,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:42:46" (4/4) ... [2022-01-10 21:42:46,310 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.cTransformedIcfg [2022-01-10 21:42:46,313 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 21:42:46,313 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 21:42:46,356 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 21:42:46,369 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 21:42:46,370 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 21:42:46,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 30 states have internal predecessors, (54), 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-10 21:42:46,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 21:42:46,387 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:46,388 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:46,388 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:46,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:46,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1865851278, now seen corresponding path program 1 times [2022-01-10 21:42:46,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:46,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019866643] [2022-01-10 21:42:46,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:46,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:46,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:46,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019866643] [2022-01-10 21:42:46,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019866643] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:46,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:46,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:46,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558080053] [2022-01-10 21:42:46,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:46,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:46,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:46,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:46,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:46,625 INFO L87 Difference]: Start difference. First operand has 31 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 30 states have internal predecessors, (54), 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 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-10 21:42:46,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:46,671 INFO L93 Difference]: Finished difference Result 65 states and 109 transitions. [2022-01-10 21:42:46,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:46,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2022-01-10 21:42:46,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:46,681 INFO L225 Difference]: With dead ends: 65 [2022-01-10 21:42:46,682 INFO L226 Difference]: Without dead ends: 51 [2022-01-10 21:42:46,684 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-10 21:42:46,686 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 37 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:46,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 103 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:46,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-10 21:42:46,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2022-01-10 21:42:46,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 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-10 21:42:46,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 62 transitions. [2022-01-10 21:42:46,718 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 62 transitions. Word has length 14 [2022-01-10 21:42:46,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:46,719 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 62 transitions. [2022-01-10 21:42:46,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-10 21:42:46,720 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 62 transitions. [2022-01-10 21:42:46,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 21:42:46,720 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:46,720 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:46,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 21:42:46,721 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:46,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:46,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2062364783, now seen corresponding path program 1 times [2022-01-10 21:42:46,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:46,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171334476] [2022-01-10 21:42:46,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:46,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:46,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:46,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:46,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171334476] [2022-01-10 21:42:46,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171334476] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:46,782 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:46,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:46,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438430950] [2022-01-10 21:42:46,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:46,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:46,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:46,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:46,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:46,784 INFO L87 Difference]: Start difference. First operand 35 states and 62 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-10 21:42:46,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:46,806 INFO L93 Difference]: Finished difference Result 84 states and 149 transitions. [2022-01-10 21:42:46,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:46,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2022-01-10 21:42:46,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:46,809 INFO L225 Difference]: With dead ends: 84 [2022-01-10 21:42:46,809 INFO L226 Difference]: Without dead ends: 51 [2022-01-10 21:42:46,810 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-10 21:42:46,810 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 33 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:46,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 101 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:46,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-10 21:42:46,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-01-10 21:42:46,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 48 states have internal predecessors, (86), 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-10 21:42:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 86 transitions. [2022-01-10 21:42:46,815 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 86 transitions. Word has length 14 [2022-01-10 21:42:46,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:46,816 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 86 transitions. [2022-01-10 21:42:46,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-10 21:42:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 86 transitions. [2022-01-10 21:42:46,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 21:42:46,816 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:46,816 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:46,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 21:42:46,817 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:46,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:46,817 INFO L85 PathProgramCache]: Analyzing trace with hash -2006782819, now seen corresponding path program 1 times [2022-01-10 21:42:46,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:46,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019075557] [2022-01-10 21:42:46,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:46,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:46,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:46,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019075557] [2022-01-10 21:42:46,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019075557] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:46,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:46,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:46,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387357151] [2022-01-10 21:42:46,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:46,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:46,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:46,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:46,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:46,854 INFO L87 Difference]: Start difference. First operand 49 states and 86 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-10 21:42:46,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:46,864 INFO L93 Difference]: Finished difference Result 78 states and 132 transitions. [2022-01-10 21:42:46,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:46,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-01-10 21:42:46,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:46,865 INFO L225 Difference]: With dead ends: 78 [2022-01-10 21:42:46,865 INFO L226 Difference]: Without dead ends: 54 [2022-01-10 21:42:46,865 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-10 21:42:46,866 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 35 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:46,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 112 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:46,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-10 21:42:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-01-10 21:42:46,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 51 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 88 transitions. [2022-01-10 21:42:46,871 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 88 transitions. Word has length 15 [2022-01-10 21:42:46,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:46,872 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 88 transitions. [2022-01-10 21:42:46,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-10 21:42:46,872 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 88 transitions. [2022-01-10 21:42:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 21:42:46,872 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:46,873 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:46,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 21:42:46,873 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:46,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:46,873 INFO L85 PathProgramCache]: Analyzing trace with hash 491233118, now seen corresponding path program 1 times [2022-01-10 21:42:46,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:46,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563355413] [2022-01-10 21:42:46,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:46,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:46,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:46,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563355413] [2022-01-10 21:42:46,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563355413] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:46,907 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:46,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:46,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091323003] [2022-01-10 21:42:46,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:46,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:46,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:46,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:46,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:46,908 INFO L87 Difference]: Start difference. First operand 52 states and 88 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-10 21:42:46,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:46,922 INFO L93 Difference]: Finished difference Result 97 states and 165 transitions. [2022-01-10 21:42:46,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:46,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-01-10 21:42:46,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:46,924 INFO L225 Difference]: With dead ends: 97 [2022-01-10 21:42:46,924 INFO L226 Difference]: Without dead ends: 95 [2022-01-10 21:42:46,925 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-10 21:42:46,926 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 30 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:46,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 89 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:46,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-01-10 21:42:46,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 69. [2022-01-10 21:42:46,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 68 states have internal predecessors, (117), 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-10 21:42:46,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 117 transitions. [2022-01-10 21:42:46,932 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 117 transitions. Word has length 15 [2022-01-10 21:42:46,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:46,932 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 117 transitions. [2022-01-10 21:42:46,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-10 21:42:46,932 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 117 transitions. [2022-01-10 21:42:46,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 21:42:46,933 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:46,933 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:46,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 21:42:46,933 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:46,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:46,934 INFO L85 PathProgramCache]: Analyzing trace with hash 294719613, now seen corresponding path program 1 times [2022-01-10 21:42:46,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:46,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546756841] [2022-01-10 21:42:46,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:46,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:46,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:46,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:46,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546756841] [2022-01-10 21:42:47,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546756841] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:47,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:47,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:47,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385978603] [2022-01-10 21:42:47,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:47,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:47,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:47,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:47,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:47,001 INFO L87 Difference]: Start difference. First operand 69 states and 117 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-10 21:42:47,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:47,031 INFO L93 Difference]: Finished difference Result 161 states and 275 transitions. [2022-01-10 21:42:47,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:47,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-01-10 21:42:47,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:47,036 INFO L225 Difference]: With dead ends: 161 [2022-01-10 21:42:47,036 INFO L226 Difference]: Without dead ends: 97 [2022-01-10 21:42:47,036 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-10 21:42:47,037 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 32 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:47,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 102 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-10 21:42:47,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2022-01-10 21:42:47,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.6914893617021276) internal successors, (159), 94 states have internal predecessors, (159), 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-10 21:42:47,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 159 transitions. [2022-01-10 21:42:47,044 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 159 transitions. Word has length 15 [2022-01-10 21:42:47,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:47,044 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 159 transitions. [2022-01-10 21:42:47,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-10 21:42:47,044 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 159 transitions. [2022-01-10 21:42:47,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 21:42:47,045 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:47,045 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:47,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 21:42:47,045 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:47,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:47,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1951610451, now seen corresponding path program 1 times [2022-01-10 21:42:47,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:47,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735147539] [2022-01-10 21:42:47,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:47,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:47,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:47,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735147539] [2022-01-10 21:42:47,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735147539] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:47,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:47,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:47,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197817377] [2022-01-10 21:42:47,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:47,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:47,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:47,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:47,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:47,074 INFO L87 Difference]: Start difference. First operand 95 states and 159 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-10 21:42:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:47,089 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2022-01-10 21:42:47,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:47,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-01-10 21:42:47,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:47,090 INFO L225 Difference]: With dead ends: 144 [2022-01-10 21:42:47,090 INFO L226 Difference]: Without dead ends: 99 [2022-01-10 21:42:47,091 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-10 21:42:47,091 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 34 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:47,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 108 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:47,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-01-10 21:42:47,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2022-01-10 21:42:47,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.65625) internal successors, (159), 96 states have internal predecessors, (159), 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-10 21:42:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 159 transitions. [2022-01-10 21:42:47,097 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 159 transitions. Word has length 16 [2022-01-10 21:42:47,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:47,098 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 159 transitions. [2022-01-10 21:42:47,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-10 21:42:47,098 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 159 transitions. [2022-01-10 21:42:47,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 21:42:47,098 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:47,099 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:47,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 21:42:47,099 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:47,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash 546405486, now seen corresponding path program 1 times [2022-01-10 21:42:47,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:47,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109245501] [2022-01-10 21:42:47,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:47,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:47,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:47,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109245501] [2022-01-10 21:42:47,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109245501] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:47,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:47,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:47,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367038733] [2022-01-10 21:42:47,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:47,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:47,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:47,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:47,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:47,126 INFO L87 Difference]: Start difference. First operand 97 states and 159 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-10 21:42:47,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:47,140 INFO L93 Difference]: Finished difference Result 177 states and 293 transitions. [2022-01-10 21:42:47,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:47,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-01-10 21:42:47,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:47,142 INFO L225 Difference]: With dead ends: 177 [2022-01-10 21:42:47,142 INFO L226 Difference]: Without dead ends: 175 [2022-01-10 21:42:47,142 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-10 21:42:47,143 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 27 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:47,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 87 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:47,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-01-10 21:42:47,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 133. [2022-01-10 21:42:47,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.628787878787879) internal successors, (215), 132 states have internal predecessors, (215), 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-10 21:42:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 215 transitions. [2022-01-10 21:42:47,151 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 215 transitions. Word has length 16 [2022-01-10 21:42:47,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:47,151 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 215 transitions. [2022-01-10 21:42:47,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-10 21:42:47,151 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 215 transitions. [2022-01-10 21:42:47,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 21:42:47,152 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:47,152 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:47,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 21:42:47,152 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:47,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:47,153 INFO L85 PathProgramCache]: Analyzing trace with hash 349891981, now seen corresponding path program 1 times [2022-01-10 21:42:47,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:47,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049454921] [2022-01-10 21:42:47,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:47,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:47,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:47,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049454921] [2022-01-10 21:42:47,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049454921] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:47,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:47,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:47,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910012065] [2022-01-10 21:42:47,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:47,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:47,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:47,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:47,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:47,186 INFO L87 Difference]: Start difference. First operand 133 states and 215 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-10 21:42:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:47,200 INFO L93 Difference]: Finished difference Result 309 states and 501 transitions. [2022-01-10 21:42:47,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:47,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-01-10 21:42:47,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:47,202 INFO L225 Difference]: With dead ends: 309 [2022-01-10 21:42:47,202 INFO L226 Difference]: Without dead ends: 183 [2022-01-10 21:42:47,204 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-10 21:42:47,204 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 31 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:47,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 103 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:47,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-01-10 21:42:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2022-01-10 21:42:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.5944444444444446) internal successors, (287), 180 states have internal predecessors, (287), 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-10 21:42:47,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 287 transitions. [2022-01-10 21:42:47,217 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 287 transitions. Word has length 16 [2022-01-10 21:42:47,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:47,217 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 287 transitions. [2022-01-10 21:42:47,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-10 21:42:47,217 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 287 transitions. [2022-01-10 21:42:47,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 21:42:47,218 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:47,218 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:47,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 21:42:47,218 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:47,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:47,219 INFO L85 PathProgramCache]: Analyzing trace with hash -241266919, now seen corresponding path program 1 times [2022-01-10 21:42:47,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:47,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044633346] [2022-01-10 21:42:47,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:47,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:47,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:47,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044633346] [2022-01-10 21:42:47,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044633346] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:47,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:47,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:47,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232897517] [2022-01-10 21:42:47,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:47,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:47,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:47,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:47,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:47,264 INFO L87 Difference]: Start difference. First operand 181 states and 287 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-10 21:42:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:47,285 INFO L93 Difference]: Finished difference Result 273 states and 429 transitions. [2022-01-10 21:42:47,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:47,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2022-01-10 21:42:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:47,287 INFO L225 Difference]: With dead ends: 273 [2022-01-10 21:42:47,287 INFO L226 Difference]: Without dead ends: 187 [2022-01-10 21:42:47,287 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-10 21:42:47,288 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 33 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:47,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 104 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-01-10 21:42:47,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2022-01-10 21:42:47,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.559782608695652) internal successors, (287), 184 states have internal predecessors, (287), 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-10 21:42:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 287 transitions. [2022-01-10 21:42:47,297 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 287 transitions. Word has length 17 [2022-01-10 21:42:47,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:47,298 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 287 transitions. [2022-01-10 21:42:47,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-10 21:42:47,298 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 287 transitions. [2022-01-10 21:42:47,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 21:42:47,299 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:47,299 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:47,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 21:42:47,299 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:47,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:47,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2038218278, now seen corresponding path program 1 times [2022-01-10 21:42:47,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:47,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141612427] [2022-01-10 21:42:47,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:47,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:47,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:47,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:47,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141612427] [2022-01-10 21:42:47,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141612427] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:47,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:47,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:47,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607684767] [2022-01-10 21:42:47,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:47,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:47,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:47,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:47,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:47,334 INFO L87 Difference]: Start difference. First operand 185 states and 287 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-10 21:42:47,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:47,348 INFO L93 Difference]: Finished difference Result 329 states and 517 transitions. [2022-01-10 21:42:47,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:47,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2022-01-10 21:42:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:47,350 INFO L225 Difference]: With dead ends: 329 [2022-01-10 21:42:47,350 INFO L226 Difference]: Without dead ends: 327 [2022-01-10 21:42:47,350 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-10 21:42:47,351 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 24 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:47,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 85 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:47,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-01-10 21:42:47,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 261. [2022-01-10 21:42:47,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.5192307692307692) internal successors, (395), 260 states have internal predecessors, (395), 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-10 21:42:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 395 transitions. [2022-01-10 21:42:47,359 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 395 transitions. Word has length 17 [2022-01-10 21:42:47,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:47,359 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 395 transitions. [2022-01-10 21:42:47,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-10 21:42:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 395 transitions. [2022-01-10 21:42:47,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 21:42:47,370 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:47,371 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:47,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 21:42:47,371 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:47,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:47,371 INFO L85 PathProgramCache]: Analyzing trace with hash 2060235513, now seen corresponding path program 1 times [2022-01-10 21:42:47,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:47,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264229987] [2022-01-10 21:42:47,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:47,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:47,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:47,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:47,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264229987] [2022-01-10 21:42:47,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264229987] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:47,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:47,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:47,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263492333] [2022-01-10 21:42:47,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:47,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:47,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:47,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:47,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:47,404 INFO L87 Difference]: Start difference. First operand 261 states and 395 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-10 21:42:47,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:47,425 INFO L93 Difference]: Finished difference Result 601 states and 909 transitions. [2022-01-10 21:42:47,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:47,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2022-01-10 21:42:47,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:47,427 INFO L225 Difference]: With dead ends: 601 [2022-01-10 21:42:47,427 INFO L226 Difference]: Without dead ends: 351 [2022-01-10 21:42:47,428 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-10 21:42:47,429 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 30 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:47,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 104 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:47,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-01-10 21:42:47,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2022-01-10 21:42:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4798850574712643) internal successors, (515), 348 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-10 21:42:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 515 transitions. [2022-01-10 21:42:47,446 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 515 transitions. Word has length 17 [2022-01-10 21:42:47,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:47,446 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 515 transitions. [2022-01-10 21:42:47,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-10 21:42:47,446 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 515 transitions. [2022-01-10 21:42:47,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 21:42:47,447 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:47,448 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:47,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 21:42:47,448 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:47,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:47,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1239775145, now seen corresponding path program 1 times [2022-01-10 21:42:47,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:47,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795248608] [2022-01-10 21:42:47,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:47,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:47,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:47,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795248608] [2022-01-10 21:42:47,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795248608] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:47,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:47,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:47,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326560168] [2022-01-10 21:42:47,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:47,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:47,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:47,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:47,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:47,466 INFO L87 Difference]: Start difference. First operand 349 states and 515 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10 21:42:47,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:47,484 INFO L93 Difference]: Finished difference Result 525 states and 769 transitions. [2022-01-10 21:42:47,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:47,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2022-01-10 21:42:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:47,486 INFO L225 Difference]: With dead ends: 525 [2022-01-10 21:42:47,486 INFO L226 Difference]: Without dead ends: 359 [2022-01-10 21:42:47,486 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-10 21:42:47,487 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 32 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:47,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 100 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-01-10 21:42:47,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2022-01-10 21:42:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 1.446629213483146) internal successors, (515), 356 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-10 21:42:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 515 transitions. [2022-01-10 21:42:47,494 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 515 transitions. Word has length 18 [2022-01-10 21:42:47,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:47,494 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 515 transitions. [2022-01-10 21:42:47,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10 21:42:47,495 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 515 transitions. [2022-01-10 21:42:47,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 21:42:47,495 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:47,495 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:47,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 21:42:47,496 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:47,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:47,496 INFO L85 PathProgramCache]: Analyzing trace with hash -557176214, now seen corresponding path program 1 times [2022-01-10 21:42:47,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:47,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357089924] [2022-01-10 21:42:47,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:47,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:47,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:47,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:47,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357089924] [2022-01-10 21:42:47,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357089924] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:47,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:47,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:47,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355569918] [2022-01-10 21:42:47,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:47,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:47,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:47,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:47,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:47,523 INFO L87 Difference]: Start difference. First operand 357 states and 515 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10 21:42:47,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:47,535 INFO L93 Difference]: Finished difference Result 617 states and 901 transitions. [2022-01-10 21:42:47,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:47,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2022-01-10 21:42:47,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:47,537 INFO L225 Difference]: With dead ends: 617 [2022-01-10 21:42:47,537 INFO L226 Difference]: Without dead ends: 615 [2022-01-10 21:42:47,538 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-10 21:42:47,540 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 21 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:47,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 83 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:47,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-01-10 21:42:47,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 517. [2022-01-10 21:42:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 1.4011627906976745) internal successors, (723), 516 states have internal predecessors, (723), 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-10 21:42:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 723 transitions. [2022-01-10 21:42:47,551 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 723 transitions. Word has length 18 [2022-01-10 21:42:47,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:47,552 INFO L470 AbstractCegarLoop]: Abstraction has 517 states and 723 transitions. [2022-01-10 21:42:47,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10 21:42:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 723 transitions. [2022-01-10 21:42:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 21:42:47,553 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:47,553 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:47,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 21:42:47,553 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:47,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:47,554 INFO L85 PathProgramCache]: Analyzing trace with hash -753689719, now seen corresponding path program 1 times [2022-01-10 21:42:47,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:47,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113539763] [2022-01-10 21:42:47,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:47,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:47,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:47,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:47,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113539763] [2022-01-10 21:42:47,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113539763] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:47,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:47,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:47,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002524992] [2022-01-10 21:42:47,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:47,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:47,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:47,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:47,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:47,578 INFO L87 Difference]: Start difference. First operand 517 states and 723 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10 21:42:47,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:47,595 INFO L93 Difference]: Finished difference Result 1177 states and 1637 transitions. [2022-01-10 21:42:47,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:47,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2022-01-10 21:42:47,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:47,598 INFO L225 Difference]: With dead ends: 1177 [2022-01-10 21:42:47,598 INFO L226 Difference]: Without dead ends: 679 [2022-01-10 21:42:47,598 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-10 21:42:47,599 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 29 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:47,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 105 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:47,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-01-10 21:42:47,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 677. [2022-01-10 21:42:47,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 676 states have (on average 1.3535502958579881) internal successors, (915), 676 states have internal predecessors, (915), 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-10 21:42:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 915 transitions. [2022-01-10 21:42:47,610 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 915 transitions. Word has length 18 [2022-01-10 21:42:47,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:47,611 INFO L470 AbstractCegarLoop]: Abstraction has 677 states and 915 transitions. [2022-01-10 21:42:47,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10 21:42:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 915 transitions. [2022-01-10 21:42:47,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 21:42:47,612 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:47,612 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:47,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 21:42:47,613 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:47,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:47,613 INFO L85 PathProgramCache]: Analyzing trace with hash -92561003, now seen corresponding path program 1 times [2022-01-10 21:42:47,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:47,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718543338] [2022-01-10 21:42:47,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:47,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:47,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:47,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718543338] [2022-01-10 21:42:47,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718543338] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:47,645 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:47,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:47,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233600329] [2022-01-10 21:42:47,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:47,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:47,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:47,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:47,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:47,647 INFO L87 Difference]: Start difference. First operand 677 states and 915 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-10 21:42:47,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:47,665 INFO L93 Difference]: Finished difference Result 1017 states and 1365 transitions. [2022-01-10 21:42:47,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:47,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2022-01-10 21:42:47,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:47,667 INFO L225 Difference]: With dead ends: 1017 [2022-01-10 21:42:47,667 INFO L226 Difference]: Without dead ends: 695 [2022-01-10 21:42:47,669 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-10 21:42:47,669 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 31 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:47,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 96 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:47,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-01-10 21:42:47,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 693. [2022-01-10 21:42:47,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.3222543352601157) internal successors, (915), 692 states have internal predecessors, (915), 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-10 21:42:47,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 915 transitions. [2022-01-10 21:42:47,683 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 915 transitions. Word has length 19 [2022-01-10 21:42:47,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:47,683 INFO L470 AbstractCegarLoop]: Abstraction has 693 states and 915 transitions. [2022-01-10 21:42:47,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-10 21:42:47,683 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 915 transitions. [2022-01-10 21:42:47,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 21:42:47,685 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:47,685 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:47,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 21:42:47,686 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:47,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:47,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1889512362, now seen corresponding path program 1 times [2022-01-10 21:42:47,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:47,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588213459] [2022-01-10 21:42:47,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:47,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:47,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:47,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588213459] [2022-01-10 21:42:47,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588213459] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:47,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:47,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:47,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374130296] [2022-01-10 21:42:47,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:47,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:47,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:47,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:47,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:47,724 INFO L87 Difference]: Start difference. First operand 693 states and 915 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-10 21:42:47,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:47,741 INFO L93 Difference]: Finished difference Result 1161 states and 1541 transitions. [2022-01-10 21:42:47,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:47,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2022-01-10 21:42:47,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:47,744 INFO L225 Difference]: With dead ends: 1161 [2022-01-10 21:42:47,744 INFO L226 Difference]: Without dead ends: 1159 [2022-01-10 21:42:47,745 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-10 21:42:47,746 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 18 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:47,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 81 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:47,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-01-10 21:42:47,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1029. [2022-01-10 21:42:47,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1028 states have (on average 1.2791828793774318) internal successors, (1315), 1028 states have internal predecessors, (1315), 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-10 21:42:47,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1315 transitions. [2022-01-10 21:42:47,767 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1315 transitions. Word has length 19 [2022-01-10 21:42:47,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:47,767 INFO L470 AbstractCegarLoop]: Abstraction has 1029 states and 1315 transitions. [2022-01-10 21:42:47,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-10 21:42:47,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1315 transitions. [2022-01-10 21:42:47,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 21:42:47,768 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:47,769 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:47,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 21:42:47,769 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:47,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:47,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2086025867, now seen corresponding path program 1 times [2022-01-10 21:42:47,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:47,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588814425] [2022-01-10 21:42:47,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:47,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:47,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:47,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588814425] [2022-01-10 21:42:47,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588814425] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:47,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:47,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:47,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091785124] [2022-01-10 21:42:47,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:47,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:47,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:47,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:47,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:47,796 INFO L87 Difference]: Start difference. First operand 1029 states and 1315 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-10 21:42:47,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:47,822 INFO L93 Difference]: Finished difference Result 2313 states and 2917 transitions. [2022-01-10 21:42:47,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:47,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2022-01-10 21:42:47,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:47,826 INFO L225 Difference]: With dead ends: 2313 [2022-01-10 21:42:47,826 INFO L226 Difference]: Without dead ends: 1319 [2022-01-10 21:42:47,827 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-10 21:42:47,828 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:47,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 106 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:47,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2022-01-10 21:42:47,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1317. [2022-01-10 21:42:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1316 states have (on average 1.2180851063829787) internal successors, (1603), 1316 states have internal predecessors, (1603), 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-10 21:42:47,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1603 transitions. [2022-01-10 21:42:47,853 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1603 transitions. Word has length 19 [2022-01-10 21:42:47,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:47,854 INFO L470 AbstractCegarLoop]: Abstraction has 1317 states and 1603 transitions. [2022-01-10 21:42:47,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-10 21:42:47,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1603 transitions. [2022-01-10 21:42:47,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 21:42:47,855 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:47,856 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] [2022-01-10 21:42:47,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 21:42:47,856 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:47,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:47,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1554691493, now seen corresponding path program 1 times [2022-01-10 21:42:47,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:47,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107627079] [2022-01-10 21:42:47,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:47,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:47,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:47,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107627079] [2022-01-10 21:42:47,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107627079] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:47,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:47,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:47,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082090618] [2022-01-10 21:42:47,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:47,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:47,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:47,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:47,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:47,872 INFO L87 Difference]: Start difference. First operand 1317 states and 1603 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-10 21:42:47,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:47,910 INFO L93 Difference]: Finished difference Result 1977 states and 2389 transitions. [2022-01-10 21:42:47,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:47,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2022-01-10 21:42:47,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:47,913 INFO L225 Difference]: With dead ends: 1977 [2022-01-10 21:42:47,913 INFO L226 Difference]: Without dead ends: 1351 [2022-01-10 21:42:47,914 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-10 21:42:47,914 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 30 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:47,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 92 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:47,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-01-10 21:42:47,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1349. [2022-01-10 21:42:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1348 states have (on average 1.1891691394658754) internal successors, (1603), 1348 states have internal predecessors, (1603), 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-10 21:42:47,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1603 transitions. [2022-01-10 21:42:47,942 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1603 transitions. Word has length 20 [2022-01-10 21:42:47,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:47,943 INFO L470 AbstractCegarLoop]: Abstraction has 1349 states and 1603 transitions. [2022-01-10 21:42:47,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-10 21:42:47,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1603 transitions. [2022-01-10 21:42:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 21:42:47,944 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:47,944 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] [2022-01-10 21:42:47,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 21:42:47,945 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:47,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:47,945 INFO L85 PathProgramCache]: Analyzing trace with hash -242259866, now seen corresponding path program 1 times [2022-01-10 21:42:47,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:47,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090917156] [2022-01-10 21:42:47,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:47,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:47,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:47,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090917156] [2022-01-10 21:42:47,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090917156] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:47,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:47,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:47,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531030315] [2022-01-10 21:42:47,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:47,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:47,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:47,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:47,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:47,963 INFO L87 Difference]: Start difference. First operand 1349 states and 1603 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-10 21:42:47,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:47,996 INFO L93 Difference]: Finished difference Result 2183 states and 2564 transitions. [2022-01-10 21:42:47,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:47,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2022-01-10 21:42:47,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:48,000 INFO L225 Difference]: With dead ends: 2183 [2022-01-10 21:42:48,001 INFO L226 Difference]: Without dead ends: 2181 [2022-01-10 21:42:48,002 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-10 21:42:48,003 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:48,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 78 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:48,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2022-01-10 21:42:48,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2053. [2022-01-10 21:42:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2052 states have (on average 1.155458089668616) internal successors, (2371), 2052 states have internal predecessors, (2371), 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-10 21:42:48,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 2371 transitions. [2022-01-10 21:42:48,041 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 2371 transitions. Word has length 20 [2022-01-10 21:42:48,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:48,041 INFO L470 AbstractCegarLoop]: Abstraction has 2053 states and 2371 transitions. [2022-01-10 21:42:48,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-10 21:42:48,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2371 transitions. [2022-01-10 21:42:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 21:42:48,043 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:48,043 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] [2022-01-10 21:42:48,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 21:42:48,044 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:48,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:48,044 INFO L85 PathProgramCache]: Analyzing trace with hash -438773371, now seen corresponding path program 1 times [2022-01-10 21:42:48,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:48,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877964134] [2022-01-10 21:42:48,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:48,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:42:48,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:48,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877964134] [2022-01-10 21:42:48,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877964134] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:48,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:48,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:48,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136519568] [2022-01-10 21:42:48,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:48,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:48,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:48,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:48,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:48,058 INFO L87 Difference]: Start difference. First operand 2053 states and 2371 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-10 21:42:48,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:48,102 INFO L93 Difference]: Finished difference Result 4549 states and 5123 transitions. [2022-01-10 21:42:48,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:48,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2022-01-10 21:42:48,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:48,103 INFO L225 Difference]: With dead ends: 4549 [2022-01-10 21:42:48,103 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 21:42:48,106 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-10 21:42:48,107 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 26 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:48,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 105 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 21:42:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 21:42:48,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-10 21:42:48,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 21:42:48,110 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-01-10 21:42:48,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:48,111 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 21:42:48,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-10 21:42:48,111 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 21:42:48,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 21:42:48,113 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 21:42:48,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 21:42:48,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 21:42:48,122 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 21:42:48,122 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 21:42:48,122 INFO L861 garLoopResultBuilder]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2022-01-10 21:42:48,122 INFO L861 garLoopResultBuilder]: At program point L119(lines 7 123) the Hoare annotation is: true [2022-01-10 21:42:48,122 INFO L858 garLoopResultBuilder]: For program point L34(lines 34 36) no Hoare annotation was computed. [2022-01-10 21:42:48,122 INFO L861 garLoopResultBuilder]: At program point L122(lines 6 123) the Hoare annotation is: true [2022-01-10 21:42:48,122 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 55) no Hoare annotation was computed. [2022-01-10 21:42:48,122 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 21:42:48,123 INFO L858 garLoopResultBuilder]: For program point L53-2(lines 32 118) no Hoare annotation was computed. [2022-01-10 21:42:48,123 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 21:42:48,123 INFO L858 garLoopResultBuilder]: For program point L57-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 21:42:48,123 INFO L858 garLoopResultBuilder]: For program point L61-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 21:42:48,123 INFO L858 garLoopResultBuilder]: For program point L65-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 21:42:48,123 INFO L858 garLoopResultBuilder]: For program point L69-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 21:42:48,123 INFO L858 garLoopResultBuilder]: For program point L73-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 21:42:48,123 INFO L858 garLoopResultBuilder]: For program point L77-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 21:42:48,123 INFO L858 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2022-01-10 21:42:48,123 INFO L858 garLoopResultBuilder]: For program point L83-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 21:42:48,124 INFO L854 garLoopResultBuilder]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2022-01-10 21:42:48,124 INFO L858 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2022-01-10 21:42:48,124 INFO L858 garLoopResultBuilder]: For program point L88-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 21:42:48,124 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2022-01-10 21:42:48,124 INFO L858 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2022-01-10 21:42:48,124 INFO L858 garLoopResultBuilder]: For program point L93-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 21:42:48,124 INFO L858 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2022-01-10 21:42:48,124 INFO L858 garLoopResultBuilder]: For program point L98-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 21:42:48,124 INFO L858 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2022-01-10 21:42:48,125 INFO L858 garLoopResultBuilder]: For program point L103-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 21:42:48,125 INFO L858 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2022-01-10 21:42:48,125 INFO L858 garLoopResultBuilder]: For program point L108-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 21:42:48,125 INFO L858 garLoopResultBuilder]: For program point L114(line 114) no Hoare annotation was computed. [2022-01-10 21:42:48,127 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:48,131 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 21:42:48,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:42:48 BasicIcfg [2022-01-10 21:42:48,138 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 21:42:48,139 INFO L158 Benchmark]: Toolchain (without parser) took 2370.24ms. Allocated memory was 202.4MB in the beginning and 249.6MB in the end (delta: 47.2MB). Free memory was 154.2MB in the beginning and 121.0MB in the end (delta: 33.2MB). Peak memory consumption was 81.3MB. Max. memory is 8.0GB. [2022-01-10 21:42:48,139 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 202.4MB. Free memory was 170.5MB in the beginning and 170.4MB in the end (delta: 78.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 21:42:48,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.37ms. Allocated memory is still 202.4MB. Free memory was 154.0MB in the beginning and 178.8MB in the end (delta: -24.8MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-01-10 21:42:48,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.42ms. Allocated memory is still 202.4MB. Free memory was 178.8MB in the beginning and 177.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 21:42:48,142 INFO L158 Benchmark]: Boogie Preprocessor took 34.16ms. Allocated memory is still 202.4MB. Free memory was 177.2MB in the beginning and 176.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 21:42:48,142 INFO L158 Benchmark]: RCFGBuilder took 217.32ms. Allocated memory is still 202.4MB. Free memory was 175.7MB in the beginning and 165.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-10 21:42:48,142 INFO L158 Benchmark]: IcfgTransformer took 88.48ms. Allocated memory is still 202.4MB. Free memory was 165.2MB in the beginning and 161.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-10 21:42:48,142 INFO L158 Benchmark]: TraceAbstraction took 1832.60ms. Allocated memory was 202.4MB in the beginning and 249.6MB in the end (delta: 47.2MB). Free memory was 160.5MB in the beginning and 121.0MB in the end (delta: 39.4MB). Peak memory consumption was 87.1MB. Max. memory is 8.0GB. [2022-01-10 21:42:48,145 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 202.4MB. Free memory was 170.5MB in the beginning and 170.4MB in the end (delta: 78.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 170.37ms. Allocated memory is still 202.4MB. Free memory was 154.0MB in the beginning and 178.8MB in the end (delta: -24.8MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.42ms. Allocated memory is still 202.4MB. Free memory was 178.8MB in the beginning and 177.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.16ms. Allocated memory is still 202.4MB. Free memory was 177.2MB in the beginning and 176.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 217.32ms. Allocated memory is still 202.4MB. Free memory was 175.7MB in the beginning and 165.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 88.48ms. Allocated memory is still 202.4MB. Free memory was 165.2MB in the beginning and 161.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * TraceAbstraction took 1832.60ms. Allocated memory was 202.4MB in the beginning and 249.6MB in the end (delta: 47.2MB). Free memory was 160.5MB in the beginning and 121.0MB in the end (delta: 39.4MB). Peak memory consumption was 87.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 121]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 575 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 575 mSDsluCounter, 1944 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 767 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 1177 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2053occurred in iteration=19, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 530 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 137 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 323 ConstructedInterpolants, 0 QuantifiedInterpolants, 771 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-10 21:42:48,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...