/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf -i ../../../trunk/examples/svcomp/locks/test_locks_5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 03:30:40,941 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 03:30:40,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 03:30:40,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 03:30:40,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 03:30:40,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 03:30:40,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 03:30:40,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 03:30:40,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 03:30:40,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 03:30:40,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 03:30:40,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 03:30:40,997 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 03:30:40,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 03:30:40,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 03:30:41,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 03:30:41,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 03:30:41,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 03:30:41,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 03:30:41,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 03:30:41,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 03:30:41,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 03:30:41,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 03:30:41,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 03:30:41,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 03:30:41,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 03:30:41,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 03:30:41,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 03:30:41,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 03:30:41,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 03:30:41,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 03:30:41,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 03:30:41,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 03:30:41,024 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 03:30:41,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 03:30:41,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 03:30:41,025 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 03:30:41,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 03:30:41,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 03:30:41,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 03:30:41,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 03:30:41,029 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 03:30:41,042 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 03:30:41,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 03:30:41,042 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 03:30:41,043 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 03:30:41,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 03:30:41,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 03:30:41,045 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 03:30:41,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 03:30:41,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 03:30:41,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 03:30:41,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 03:30:41,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 03:30:41,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 03:30:41,046 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 03:30:41,046 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 03:30:41,046 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 03:30:41,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 03:30:41,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 03:30:41,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 03:30:41,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 03:30:41,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 03:30:41,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:30:41,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 03:30:41,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 03:30:41,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 03:30:41,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 03:30:41,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 03:30:41,048 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 03:30:41,048 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 03:30:41,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 03:30:41,048 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 03:30:41,048 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 03:30:41,049 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 03:30:41,049 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 03:30:41,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 03:30:41,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 03:30:41,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 03:30:41,229 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 03:30:41,231 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 03:30:41,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2022-01-11 03:30:41,281 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af26b420/bdbba9c3637b41f2a0aa6cbe6688a9d4/FLAG43a4946cb [2022-01-11 03:30:41,559 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 03:30:41,559 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2022-01-11 03:30:41,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af26b420/bdbba9c3637b41f2a0aa6cbe6688a9d4/FLAG43a4946cb [2022-01-11 03:30:42,004 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af26b420/bdbba9c3637b41f2a0aa6cbe6688a9d4 [2022-01-11 03:30:42,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 03:30:42,007 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 03:30:42,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 03:30:42,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 03:30:42,020 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 03:30:42,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:30:42" (1/1) ... [2022-01-11 03:30:42,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19cfa92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:42, skipping insertion in model container [2022-01-11 03:30:42,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:30:42" (1/1) ... [2022-01-11 03:30:42,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 03:30:42,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 03:30:42,146 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_5.c[2207,2220] [2022-01-11 03:30:42,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:30:42,192 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 03:30:42,204 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_5.c[2207,2220] [2022-01-11 03:30:42,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:30:42,213 INFO L208 MainTranslator]: Completed translation [2022-01-11 03:30:42,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:42 WrapperNode [2022-01-11 03:30:42,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 03:30:42,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 03:30:42,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 03:30:42,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 03:30:42,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:42" (1/1) ... [2022-01-11 03:30:42,225 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:42" (1/1) ... [2022-01-11 03:30:42,243 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2022-01-11 03:30:42,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 03:30:42,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 03:30:42,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 03:30:42,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 03:30:42,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:42" (1/1) ... [2022-01-11 03:30:42,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:42" (1/1) ... [2022-01-11 03:30:42,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:42" (1/1) ... [2022-01-11 03:30:42,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:42" (1/1) ... [2022-01-11 03:30:42,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:42" (1/1) ... [2022-01-11 03:30:42,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:42" (1/1) ... [2022-01-11 03:30:42,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:42" (1/1) ... [2022-01-11 03:30:42,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 03:30:42,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 03:30:42,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 03:30:42,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 03:30:42,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:42" (1/1) ... [2022-01-11 03:30:42,273 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:30:42,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:42,293 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 03:30:42,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 03:30:42,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 03:30:42,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 03:30:42,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 03:30:42,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 03:30:42,370 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 03:30:42,372 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 03:30:42,512 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 03:30:42,516 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 03:30:42,516 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-11 03:30:42,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:42 BoogieIcfgContainer [2022-01-11 03:30:42,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 03:30:42,518 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 03:30:42,518 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 03:30:42,532 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 03:30:42,534 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:42" (1/1) ... [2022-01-11 03:30:42,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:30:42 BasicIcfg [2022-01-11 03:30:42,580 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 03:30:42,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 03:30:42,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 03:30:42,583 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 03:30:42,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 03:30:42" (1/4) ... [2022-01-11 03:30:42,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f83f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:30:42, skipping insertion in model container [2022-01-11 03:30:42,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:42" (2/4) ... [2022-01-11 03:30:42,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f83f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:30:42, skipping insertion in model container [2022-01-11 03:30:42,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:42" (3/4) ... [2022-01-11 03:30:42,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f83f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:30:42, skipping insertion in model container [2022-01-11 03:30:42,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:30:42" (4/4) ... [2022-01-11 03:30:42,585 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_5.cTransformedIcfg [2022-01-11 03:30:42,588 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 03:30:42,588 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 03:30:42,616 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 03:30:42,621 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 03:30:42,621 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 03:30:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.826086956521739) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:42,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-11 03:30:42,632 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:42,632 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:42,633 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:42,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:42,636 INFO L85 PathProgramCache]: Analyzing trace with hash 964920048, now seen corresponding path program 1 times [2022-01-11 03:30:42,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:42,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85626084] [2022-01-11 03:30:42,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:42,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:42,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:42,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:42,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85626084] [2022-01-11 03:30:42,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85626084] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:42,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:42,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:42,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100100376] [2022-01-11 03:30:42,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:42,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:42,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:42,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:42,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:42,844 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.826086956521739) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 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.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:42,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:42,887 INFO L93 Difference]: Finished difference Result 53 states and 85 transitions. [2022-01-11 03:30:42,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:42,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-01-11 03:30:42,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:42,896 INFO L225 Difference]: With dead ends: 53 [2022-01-11 03:30:42,896 INFO L226 Difference]: Without dead ends: 39 [2022-01-11 03:30:42,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:42,908 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 27 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 79 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-11 03:30:42,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 79 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:42,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-11 03:30:42,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2022-01-11 03:30:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 26 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2022-01-11 03:30:42,939 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 12 [2022-01-11 03:30:42,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:42,940 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 46 transitions. [2022-01-11 03:30:42,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:42,940 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2022-01-11 03:30:42,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-11 03:30:42,941 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:42,942 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:42,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 03:30:42,942 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:42,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:42,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1587236913, now seen corresponding path program 1 times [2022-01-11 03:30:42,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:42,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349218656] [2022-01-11 03:30:42,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:42,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:43,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:43,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349218656] [2022-01-11 03:30:43,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349218656] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:43,008 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:43,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:43,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187589794] [2022-01-11 03:30:43,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:43,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:43,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:43,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:43,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,012 INFO L87 Difference]: Start difference. First operand 27 states and 46 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:43,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:43,034 INFO L93 Difference]: Finished difference Result 64 states and 109 transitions. [2022-01-11 03:30:43,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:43,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-01-11 03:30:43,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:43,036 INFO L225 Difference]: With dead ends: 64 [2022-01-11 03:30:43,036 INFO L226 Difference]: Without dead ends: 39 [2022-01-11 03:30:43,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,039 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 23 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 73 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-11 03:30:43,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 73 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:43,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-11 03:30:43,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-01-11 03:30:43,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 36 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-11 03:30:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 62 transitions. [2022-01-11 03:30:43,049 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 62 transitions. Word has length 12 [2022-01-11 03:30:43,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:43,050 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 62 transitions. [2022-01-11 03:30:43,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 62 transitions. [2022-01-11 03:30:43,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-11 03:30:43,053 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:43,053 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:43,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 03:30:43,054 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:43,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:43,056 INFO L85 PathProgramCache]: Analyzing trace with hash -152217671, now seen corresponding path program 1 times [2022-01-11 03:30:43,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:43,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158219608] [2022-01-11 03:30:43,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:43,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:43,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:43,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:43,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158219608] [2022-01-11 03:30:43,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158219608] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:43,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:43,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:43,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004821294] [2022-01-11 03:30:43,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:43,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:43,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:43,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:43,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,095 INFO L87 Difference]: Start difference. First operand 37 states and 62 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:43,108 INFO L93 Difference]: Finished difference Result 60 states and 96 transitions. [2022-01-11 03:30:43,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:43,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-01-11 03:30:43,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:43,108 INFO L225 Difference]: With dead ends: 60 [2022-01-11 03:30:43,109 INFO L226 Difference]: Without dead ends: 42 [2022-01-11 03:30:43,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,109 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 25 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 80 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-11 03:30:43,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 80 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:43,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-11 03:30:43,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-01-11 03:30:43,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.641025641025641) internal successors, (64), 39 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:43,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 64 transitions. [2022-01-11 03:30:43,113 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 64 transitions. Word has length 13 [2022-01-11 03:30:43,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:43,113 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 64 transitions. [2022-01-11 03:30:43,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:43,113 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 64 transitions. [2022-01-11 03:30:43,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-11 03:30:43,114 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:43,114 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:43,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 03:30:43,114 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:43,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:43,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1959672134, now seen corresponding path program 1 times [2022-01-11 03:30:43,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:43,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901502558] [2022-01-11 03:30:43,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:43,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:43,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:43,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901502558] [2022-01-11 03:30:43,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901502558] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:43,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:43,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:43,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730350082] [2022-01-11 03:30:43,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:43,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:43,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:43,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:43,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,166 INFO L87 Difference]: Start difference. First operand 40 states and 64 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:43,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:43,178 INFO L93 Difference]: Finished difference Result 73 states and 117 transitions. [2022-01-11 03:30:43,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:43,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-01-11 03:30:43,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:43,179 INFO L225 Difference]: With dead ends: 73 [2022-01-11 03:30:43,179 INFO L226 Difference]: Without dead ends: 71 [2022-01-11 03:30:43,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,180 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 20 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 65 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-11 03:30:43,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 65 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:43,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-11 03:30:43,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2022-01-11 03:30:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 52 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 85 transitions. [2022-01-11 03:30:43,184 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 85 transitions. Word has length 13 [2022-01-11 03:30:43,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:43,185 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 85 transitions. [2022-01-11 03:30:43,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:43,185 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 85 transitions. [2022-01-11 03:30:43,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-11 03:30:43,185 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:43,185 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:43,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 03:30:43,186 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:43,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:43,186 INFO L85 PathProgramCache]: Analyzing trace with hash -216861799, now seen corresponding path program 1 times [2022-01-11 03:30:43,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:43,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699558948] [2022-01-11 03:30:43,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:43,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:43,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:43,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:43,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699558948] [2022-01-11 03:30:43,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699558948] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:43,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:43,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:43,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856643106] [2022-01-11 03:30:43,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:43,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:43,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:43,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:43,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,210 INFO L87 Difference]: Start difference. First operand 53 states and 85 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:43,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:43,219 INFO L93 Difference]: Finished difference Result 121 states and 195 transitions. [2022-01-11 03:30:43,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:43,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-01-11 03:30:43,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:43,222 INFO L225 Difference]: With dead ends: 121 [2022-01-11 03:30:43,222 INFO L226 Difference]: Without dead ends: 73 [2022-01-11 03:30:43,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,223 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 22 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 74 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-11 03:30:43,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 74 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:43,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-11 03:30:43,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-01-11 03:30:43,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 70 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:43,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 111 transitions. [2022-01-11 03:30:43,228 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 111 transitions. Word has length 13 [2022-01-11 03:30:43,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:43,228 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 111 transitions. [2022-01-11 03:30:43,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:43,228 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 111 transitions. [2022-01-11 03:30:43,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-11 03:30:43,229 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:43,229 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:43,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 03:30:43,229 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:43,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:43,230 INFO L85 PathProgramCache]: Analyzing trace with hash -620261973, now seen corresponding path program 1 times [2022-01-11 03:30:43,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:43,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974355014] [2022-01-11 03:30:43,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:43,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:43,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:43,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974355014] [2022-01-11 03:30:43,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974355014] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:43,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:43,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:43,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312747266] [2022-01-11 03:30:43,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:43,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:43,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:43,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:43,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,265 INFO L87 Difference]: Start difference. First operand 71 states and 111 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-11 03:30:43,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:43,282 INFO L93 Difference]: Finished difference Result 108 states and 166 transitions. [2022-01-11 03:30:43,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:43,283 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-11 03:30:43,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:43,283 INFO L225 Difference]: With dead ends: 108 [2022-01-11 03:30:43,284 INFO L226 Difference]: Without dead ends: 75 [2022-01-11 03:30:43,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,285 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 76 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-11 03:30:43,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 76 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:43,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-11 03:30:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2022-01-11 03:30:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 72 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2022-01-11 03:30:43,290 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 14 [2022-01-11 03:30:43,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:43,290 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2022-01-11 03:30:43,290 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-11 03:30:43,290 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2022-01-11 03:30:43,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-11 03:30:43,291 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:43,291 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:43,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 03:30:43,291 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:43,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:43,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1867250860, now seen corresponding path program 1 times [2022-01-11 03:30:43,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:43,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642327346] [2022-01-11 03:30:43,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:43,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:43,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:43,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642327346] [2022-01-11 03:30:43,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642327346] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:43,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:43,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:43,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181278888] [2022-01-11 03:30:43,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:43,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:43,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:43,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:43,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,312 INFO L87 Difference]: Start difference. First operand 73 states and 111 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-11 03:30:43,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:43,321 INFO L93 Difference]: Finished difference Result 129 states and 197 transitions. [2022-01-11 03:30:43,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:43,321 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-11 03:30:43,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:43,322 INFO L225 Difference]: With dead ends: 129 [2022-01-11 03:30:43,322 INFO L226 Difference]: Without dead ends: 127 [2022-01-11 03:30:43,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,323 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 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-11 03:30:43,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:43,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-01-11 03:30:43,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 101. [2022-01-11 03:30:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.51) internal successors, (151), 100 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 151 transitions. [2022-01-11 03:30:43,330 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 151 transitions. Word has length 14 [2022-01-11 03:30:43,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:43,330 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 151 transitions. [2022-01-11 03:30:43,330 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-11 03:30:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 151 transitions. [2022-01-11 03:30:43,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-11 03:30:43,331 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:43,331 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:43,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 03:30:43,331 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:43,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:43,332 INFO L85 PathProgramCache]: Analyzing trace with hash -684906101, now seen corresponding path program 1 times [2022-01-11 03:30:43,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:43,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337976224] [2022-01-11 03:30:43,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:43,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:43,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:43,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:43,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337976224] [2022-01-11 03:30:43,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337976224] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:43,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:43,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:43,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106006551] [2022-01-11 03:30:43,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:43,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:43,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:43,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:43,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,352 INFO L87 Difference]: Start difference. First operand 101 states and 151 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-11 03:30:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:43,369 INFO L93 Difference]: Finished difference Result 229 states and 341 transitions. [2022-01-11 03:30:43,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:43,370 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-11 03:30:43,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:43,371 INFO L225 Difference]: With dead ends: 229 [2022-01-11 03:30:43,371 INFO L226 Difference]: Without dead ends: 135 [2022-01-11 03:30:43,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,372 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 21 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 75 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-11 03:30:43,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 75 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:43,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-01-11 03:30:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-01-11 03:30:43,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.446969696969697) internal successors, (191), 132 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2022-01-11 03:30:43,395 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 14 [2022-01-11 03:30:43,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:43,396 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2022-01-11 03:30:43,396 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-11 03:30:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2022-01-11 03:30:43,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-11 03:30:43,396 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:43,397 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:43,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 03:30:43,397 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:43,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:43,397 INFO L85 PathProgramCache]: Analyzing trace with hash 2050233973, now seen corresponding path program 1 times [2022-01-11 03:30:43,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:43,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248936195] [2022-01-11 03:30:43,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:43,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:43,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:43,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248936195] [2022-01-11 03:30:43,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248936195] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:43,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:43,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:43,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270369205] [2022-01-11 03:30:43,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:43,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:43,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:43,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:43,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,438 INFO L87 Difference]: Start difference. First operand 133 states and 191 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-11 03:30:43,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:43,454 INFO L93 Difference]: Finished difference Result 201 states and 285 transitions. [2022-01-11 03:30:43,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:43,455 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-11 03:30:43,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:43,455 INFO L225 Difference]: With dead ends: 201 [2022-01-11 03:30:43,455 INFO L226 Difference]: Without dead ends: 139 [2022-01-11 03:30:43,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,459 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 23 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 72 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-11 03:30:43,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 72 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:43,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-01-11 03:30:43,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2022-01-11 03:30:43,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 136 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:43,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 191 transitions. [2022-01-11 03:30:43,469 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 191 transitions. Word has length 15 [2022-01-11 03:30:43,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:43,469 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 191 transitions. [2022-01-11 03:30:43,469 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-11 03:30:43,469 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 191 transitions. [2022-01-11 03:30:43,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-11 03:30:43,470 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:43,470 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:43,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 03:30:43,470 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:43,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:43,470 INFO L85 PathProgramCache]: Analyzing trace with hash 242779510, now seen corresponding path program 1 times [2022-01-11 03:30:43,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:43,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220164226] [2022-01-11 03:30:43,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:43,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:43,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:43,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220164226] [2022-01-11 03:30:43,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220164226] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:43,515 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:43,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:43,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106020632] [2022-01-11 03:30:43,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:43,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:43,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:43,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:43,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,516 INFO L87 Difference]: Start difference. First operand 137 states and 191 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-11 03:30:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:43,527 INFO L93 Difference]: Finished difference Result 233 states and 325 transitions. [2022-01-11 03:30:43,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:43,528 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-11 03:30:43,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:43,529 INFO L225 Difference]: With dead ends: 233 [2022-01-11 03:30:43,529 INFO L226 Difference]: Without dead ends: 231 [2022-01-11 03:30:43,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,530 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 14 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 61 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-11 03:30:43,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 61 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:43,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-01-11 03:30:43,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 197. [2022-01-11 03:30:43,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.3622448979591837) internal successors, (267), 196 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:43,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 267 transitions. [2022-01-11 03:30:43,540 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 267 transitions. Word has length 15 [2022-01-11 03:30:43,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:43,541 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 267 transitions. [2022-01-11 03:30:43,541 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-11 03:30:43,541 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 267 transitions. [2022-01-11 03:30:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-11 03:30:43,542 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:43,542 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:43,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 03:30:43,542 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:43,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:43,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1985589845, now seen corresponding path program 1 times [2022-01-11 03:30:43,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:43,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469807705] [2022-01-11 03:30:43,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:43,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:43,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:43,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469807705] [2022-01-11 03:30:43,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469807705] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:43,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:43,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:43,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155629919] [2022-01-11 03:30:43,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:43,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:43,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:43,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:43,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,562 INFO L87 Difference]: Start difference. First operand 197 states and 267 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-11 03:30:43,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:43,578 INFO L93 Difference]: Finished difference Result 441 states and 589 transitions. [2022-01-11 03:30:43,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:43,578 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-11 03:30:43,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:43,579 INFO L225 Difference]: With dead ends: 441 [2022-01-11 03:30:43,579 INFO L226 Difference]: Without dead ends: 255 [2022-01-11 03:30:43,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,580 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 20 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 76 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-11 03:30:43,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 76 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-01-11 03:30:43,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2022-01-11 03:30:43,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.2817460317460319) internal successors, (323), 252 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:43,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 323 transitions. [2022-01-11 03:30:43,587 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 323 transitions. Word has length 15 [2022-01-11 03:30:43,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:43,587 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 323 transitions. [2022-01-11 03:30:43,587 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-11 03:30:43,587 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 323 transitions. [2022-01-11 03:30:43,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-11 03:30:43,588 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:43,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:43,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 03:30:43,589 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:43,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:43,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1063737497, now seen corresponding path program 1 times [2022-01-11 03:30:43,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:43,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607298387] [2022-01-11 03:30:43,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:43,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:43,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:43,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:43,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607298387] [2022-01-11 03:30:43,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607298387] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:43,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:43,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:43,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081772619] [2022-01-11 03:30:43,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:43,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:43,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:43,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:43,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,626 INFO L87 Difference]: Start difference. First operand 253 states and 323 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-11 03:30:43,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:43,648 INFO L93 Difference]: Finished difference Result 381 states and 481 transitions. [2022-01-11 03:30:43,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:43,648 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-11 03:30:43,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:43,649 INFO L225 Difference]: With dead ends: 381 [2022-01-11 03:30:43,649 INFO L226 Difference]: Without dead ends: 263 [2022-01-11 03:30:43,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,650 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 22 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 68 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-11 03:30:43,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 68 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:43,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-01-11 03:30:43,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2022-01-11 03:30:43,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.2423076923076923) internal successors, (323), 260 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 323 transitions. [2022-01-11 03:30:43,656 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 323 transitions. Word has length 16 [2022-01-11 03:30:43,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:43,656 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 323 transitions. [2022-01-11 03:30:43,656 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-11 03:30:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 323 transitions. [2022-01-11 03:30:43,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-11 03:30:43,657 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:43,658 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:43,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 03:30:43,658 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:43,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:43,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1423775336, now seen corresponding path program 1 times [2022-01-11 03:30:43,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:43,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432524964] [2022-01-11 03:30:43,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:43,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:43,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:43,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:43,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432524964] [2022-01-11 03:30:43,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432524964] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:43,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:43,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:43,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355092855] [2022-01-11 03:30:43,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:43,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:43,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:43,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:43,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,688 INFO L87 Difference]: Start difference. First operand 261 states and 323 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-11 03:30:43,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:43,703 INFO L93 Difference]: Finished difference Result 423 states and 516 transitions. [2022-01-11 03:30:43,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:43,704 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-11 03:30:43,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:43,705 INFO L225 Difference]: With dead ends: 423 [2022-01-11 03:30:43,705 INFO L226 Difference]: Without dead ends: 421 [2022-01-11 03:30:43,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,706 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 58 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-11 03:30:43,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 58 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:43,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-01-11 03:30:43,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 389. [2022-01-11 03:30:43,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 1.2036082474226804) internal successors, (467), 388 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:43,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 467 transitions. [2022-01-11 03:30:43,716 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 467 transitions. Word has length 16 [2022-01-11 03:30:43,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:43,717 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 467 transitions. [2022-01-11 03:30:43,717 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-11 03:30:43,717 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 467 transitions. [2022-01-11 03:30:43,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-11 03:30:43,720 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:43,720 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:43,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 03:30:43,721 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:43,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:43,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1128381625, now seen corresponding path program 1 times [2022-01-11 03:30:43,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:43,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315812402] [2022-01-11 03:30:43,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:43,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:43,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:43,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:43,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315812402] [2022-01-11 03:30:43,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315812402] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:43,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:43,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:43,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517720845] [2022-01-11 03:30:43,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:43,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:43,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:43,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:43,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,750 INFO L87 Difference]: Start difference. First operand 389 states and 467 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-11 03:30:43,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:43,773 INFO L93 Difference]: Finished difference Result 853 states and 995 transitions. [2022-01-11 03:30:43,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:43,774 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-11 03:30:43,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:43,774 INFO L225 Difference]: With dead ends: 853 [2022-01-11 03:30:43,775 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 03:30:43,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,781 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 18 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 75 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-11 03:30:43,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 75 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:43,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 03:30:43,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 03:30:43,783 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-11 03:30:43,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 03:30:43,783 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-01-11 03:30:43,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:43,783 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 03:30:43,783 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-11 03:30:43,783 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 03:30:43,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 03:30:43,785 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 03:30:43,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 03:30:43,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 03:30:43,794 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 03:30:43,794 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 03:30:43,794 INFO L861 garLoopResultBuilder]: At program point L85-1(lines 26 90) the Hoare annotation is: true [2022-01-11 03:30:43,795 INFO L861 garLoopResultBuilder]: At program point L91(lines 7 95) the Hoare annotation is: true [2022-01-11 03:30:43,795 INFO L858 garLoopResultBuilder]: For program point L28(lines 28 30) no Hoare annotation was computed. [2022-01-11 03:30:43,795 INFO L861 garLoopResultBuilder]: At program point L94(lines 6 95) the Hoare annotation is: true [2022-01-11 03:30:43,795 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 45) no Hoare annotation was computed. [2022-01-11 03:30:43,795 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 03:30:43,795 INFO L858 garLoopResultBuilder]: For program point L43-2(lines 26 90) no Hoare annotation was computed. [2022-01-11 03:30:43,795 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 03:30:43,795 INFO L858 garLoopResultBuilder]: For program point L47-1(lines 26 90) no Hoare annotation was computed. [2022-01-11 03:30:43,796 INFO L858 garLoopResultBuilder]: For program point L51-1(lines 26 90) no Hoare annotation was computed. [2022-01-11 03:30:43,796 INFO L858 garLoopResultBuilder]: For program point L55-1(lines 26 90) no Hoare annotation was computed. [2022-01-11 03:30:43,796 INFO L858 garLoopResultBuilder]: For program point L59-1(lines 26 90) no Hoare annotation was computed. [2022-01-11 03:30:43,796 INFO L858 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2022-01-11 03:30:43,796 INFO L858 garLoopResultBuilder]: For program point L65-1(lines 26 90) no Hoare annotation was computed. [2022-01-11 03:30:43,796 INFO L854 garLoopResultBuilder]: At program point L86-1(lines 7 95) the Hoare annotation is: false [2022-01-11 03:30:43,796 INFO L858 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2022-01-11 03:30:43,796 INFO L858 garLoopResultBuilder]: For program point L70-1(lines 26 90) no Hoare annotation was computed. [2022-01-11 03:30:43,796 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) no Hoare annotation was computed. [2022-01-11 03:30:43,796 INFO L858 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2022-01-11 03:30:43,796 INFO L858 garLoopResultBuilder]: For program point L75-1(lines 26 90) no Hoare annotation was computed. [2022-01-11 03:30:43,796 INFO L858 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2022-01-11 03:30:43,796 INFO L858 garLoopResultBuilder]: For program point L80-1(lines 26 90) no Hoare annotation was computed. [2022-01-11 03:30:43,796 INFO L858 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2022-01-11 03:30:43,798 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:43,800 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 03:30:43,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:30:43 BasicIcfg [2022-01-11 03:30:43,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 03:30:43,808 INFO L158 Benchmark]: Toolchain (without parser) took 1801.23ms. Allocated memory was 185.6MB in the beginning and 235.9MB in the end (delta: 50.3MB). Free memory was 128.2MB in the beginning and 201.3MB in the end (delta: -73.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 03:30:43,808 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 144.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 03:30:43,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.85ms. Allocated memory was 185.6MB in the beginning and 235.9MB in the end (delta: 50.3MB). Free memory was 128.0MB in the beginning and 208.8MB in the end (delta: -80.8MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-01-11 03:30:43,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.04ms. Allocated memory is still 235.9MB. Free memory was 208.8MB in the beginning and 207.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-11 03:30:43,809 INFO L158 Benchmark]: Boogie Preprocessor took 18.42ms. Allocated memory is still 235.9MB. Free memory was 207.3MB in the beginning and 206.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-11 03:30:43,809 INFO L158 Benchmark]: RCFGBuilder took 254.73ms. Allocated memory is still 235.9MB. Free memory was 206.2MB in the beginning and 194.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-11 03:30:43,809 INFO L158 Benchmark]: IcfgTransformer took 62.08ms. Allocated memory is still 235.9MB. Free memory was 194.7MB in the beginning and 191.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-11 03:30:43,810 INFO L158 Benchmark]: TraceAbstraction took 1226.79ms. Allocated memory is still 235.9MB. Free memory was 191.0MB in the beginning and 201.3MB in the end (delta: -10.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 03:30:43,811 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 185.6MB. Free memory is still 144.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.85ms. Allocated memory was 185.6MB in the beginning and 235.9MB in the end (delta: 50.3MB). Free memory was 128.0MB in the beginning and 208.8MB in the end (delta: -80.8MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.04ms. Allocated memory is still 235.9MB. Free memory was 208.8MB in the beginning and 207.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.42ms. Allocated memory is still 235.9MB. Free memory was 207.3MB in the beginning and 206.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 254.73ms. Allocated memory is still 235.9MB. Free memory was 206.2MB in the beginning and 194.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 62.08ms. Allocated memory is still 235.9MB. Free memory was 194.7MB in the beginning and 191.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * TraceAbstraction took 1226.79ms. Allocated memory is still 235.9MB. Free memory was 191.0MB in the beginning and 201.3MB in the end (delta: -10.3MB). There was no memory consumed. 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: 93]: 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, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 286 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 286 mSDsluCounter, 995 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 384 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 75 IncrementalHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 611 mSDtfsCounter, 75 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=389occurred in iteration=13, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 138 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 41 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 414 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-01-11 03:30:43,847 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...